On the Elasticity of Marking Functions in an Integrated Network

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 321
  • Download : 0
Much of the research on network modeling and analysis has focused on the design of end controllers and network algorithms with the objective of stability and convergence of the transmission rate. However, a network is typically composed of a mixture of both controlled elastic flows and uncontrolled real-time flows. In this paper, we study the effects of marking elasticity (which characterizes how aggressively the marking function responds to congestion) on queue overflow probability for uncontrolled real-time flows. First, we derive lower and upper bounds on the queue overflow probability at a router of a single bottleneck system. Using this, we quantify the trade-off between stability for controlled flows and queue overflow probability for uncontrolled real-time flows as a function of marking elasticity. Next, we compare the capacity required at a router with only FIFO scheduling versus a router with priority scheduling (priority given to the real-time flows) for supporting a given queue overflow probability. We quantify the "scheduling-gain" of priority scheduling over FIFO scheduling, as a function of marking elasticity. We show that this scheduling gain decreases with more elastic marking functions.
Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Issue Date
2009-02
Language
English
Article Type
Article
Keywords

MANY-FLOWS REGIME; CONGESTION CONTROL; LARGE DEVIATIONS; INTERNET; MODELS; STABILITY; ASYMPTOTICS; ALGORITHMS; DELAYS; SCALE

Citation

IEEE TRANSACTIONS ON AUTOMATIC CONTROL, v.54, no.2, pp.323 - 336

ISSN
0018-9286
DOI
10.1109/TAC.2008.2010697
URI
http://hdl.handle.net/10203/98444
Appears in Collection
EE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0