Sökning: onr:"swepub:oai:DiVA.org:kth-235888" >
Multiperiod Network...
Multiperiod Network Rate Allocation With End-to-End Delay Constraints
-
- Hajiesmaili, Mohammad Hassan (författare)
- Johns Hopkins Univ, Whiting Sch Engn, Baltimore, MD 21218 USA.
-
- Talebi Mazraeh Shahi, Mohammad Sadegh, 1982- (författare)
- KTH,Reglerteknik,K
-
- Khonsari, Ahmad (författare)
- Univ Tehran, Dept Elect & Comp Engn, Tehran 1417614418, Iran.;Inst Res Fundamental Sci, Sch Comp Sci, Tehran 1953833511, Iran.
-
Johns Hopkins Univ, Whiting Sch Engn, Baltimore, MD 21218 USA Reglerteknik (creator_code:org_t)
- Institute of Electrical and Electronics Engineers (IEEE), 2018
- 2018
- Engelska.
-
Ingår i: IEEE Transactions on Control of Network Systems. - : Institute of Electrical and Electronics Engineers (IEEE). - 2325-5870. ; 5:3, s. 1087-1097
- Relaterad länk:
-
https://urn.kb.se/re...
-
visa fler...
-
https://doi.org/10.1...
-
visa färre...
Abstract
Ämnesord
Stäng
- QoS-aware networking applications such as real-time streaming and video surveillance systems require nearly fixed average end-to-end delay over long periods to communicate efficiently, although may tolerate some delay variations in short periods. This variability exhibits complex dynamics that makes rate control of such applications a formidable task. This paper addresses rate allocation for heterogeneous QoS-aware applications that preserves the long-term end-to-end delay constraint while seeking the maximum network utility cumulated over a fixed time interval. To capture the temporal dynamics of sources, we incorporate a novel time-coupling constraint in which delay sensitivity of sources is considered such that a certain end-to-end average delay for each source over a prespecified time interval is satisfied. We propose an algorithm, as a dual-based solution, which allocates source rates for the next time interval in a distributed fashion, given the knowledge of network parameters in advance. Also, we extend the algorithm to the case that the problem data is not known fully in advance to capture more realistic scenarios. Through numerical experiments, we show that our proposed algorithm attains higher average link utilization and a wider range of feasible scenarios in comparison with the best, to our knowledge, rate control schemes that may guarantee such constraints on delay.
Ämnesord
- TEKNIK OCH TEKNOLOGIER -- Elektroteknik och elektronik -- Kommunikationssystem (hsv//swe)
- ENGINEERING AND TECHNOLOGY -- Electrical Engineering, Electronic Engineering, Information Engineering -- Communication Systems (hsv//eng)
Nyckelord
- Convex optimization
- end-to-end delay
- network utility maximization (NUM)
- rate allocation
Publikations- och innehållstyp
- ref (ämneskategori)
- art (ämneskategori)
Hitta via bibliotek
Till lärosätets databas