Results 1 
8 of
8
On the Impact of Link Scheduling on EndtoEnd Delays in Large Networks
, 2010
"... We seek to provide an analytical answer whether the impact of link scheduling algorithms on endtoend delays diminishes on long network paths. The answer is provided through a detailed multihop delay analysis, which is applicable to a broad class of scheduling algorithms, and which can account fo ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
We seek to provide an analytical answer whether the impact of link scheduling algorithms on endtoend delays diminishes on long network paths. The answer is provided through a detailed multihop delay analysis, which is applicable to a broad class of scheduling algorithms, and which can account for statistical multiplexing. The analysis is enabled by two contributions: (1) We derive a function that can characterize the available bandwidth at a buffered link for various scheduling algorithms. This characterization is sharp enough to provide necessary and sufficient conditions for satisfying worstcase delay bounds at a single link; (2) We obtain endtoend delay bounds by solving an optimization problem, in which the service received on a multihop path is subsumed into a single function. Since our analysis captures the properties of a broad group of schedulers in a single parameter, it can provide insight how the choice of scheduling algorithms impacts endtoend delay bounds. An important finding of this paper is that schedulers may exhibit noticeable performance differences which persist in a network setting with long paths.
Does Link Scheduling Matter on Long Paths?
 INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS
, 2010
"... We seek to provide an analytical answer whether the impact of the selection of link scheduling algorithms diminishes on long network paths. The answer is provided through a detailed multinode delay analysis, which is applicable to a broad class of scheduling algorithms, and which can account for st ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
(Show Context)
We seek to provide an analytical answer whether the impact of the selection of link scheduling algorithms diminishes on long network paths. The answer is provided through a detailed multinode delay analysis, which is applicable to a broad class of scheduling algorithms, and which can account for statistical multiplexing. The analysis is enabled by two contributions: (1) We derive a function that can characterize the available bandwidth at a node for various scheduling algorithms. The function has an accuracy that recovers necessary and sufficient conditions for satisfying worstcase delay bounds at a single node; (2) We obtain endtoend delay bounds by providing an explicit solution to an optimization problem, in which the service received at multiple nodes is subsumed into a single function. By presenting a unified analysis that captures the properties of a broad group of schedulers in a single parameter, we can provide insight how the choice of scheduling algorithms impacts endtoend delay bounds. An important finding of this paper is that some schedulers show noticeable performance differences which persist in a network setting with long paths.
The impact of link scheduling on long paths: Statistical analysis and optimal bounds
 In Proc. of IEEE INFOCOM
, 2011
"... Abstract—We study how the choice of packet scheduling algorithms influences endtoend performance on long network paths. Taking a network calculus approach, we consider both deterministic and statistical performance metrics. A key enabling contribution for our analysis is a significantly sharpened ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
(Show Context)
Abstract—We study how the choice of packet scheduling algorithms influences endtoend performance on long network paths. Taking a network calculus approach, we consider both deterministic and statistical performance metrics. A key enabling contribution for our analysis is a significantly sharpened method for computing a statistical bound for the service given to a flow by the network as a whole. For a suitably parsimonious traffic model we develop closedform expressions for endtoend delays, backlog, and output burstiness. The deterministic versions of our bounds yield optimal bounds on endtoend backlog and output burstiness for some schedulers, and are highly accurate for endtoend delay bounds. I.
Information Systems
"... The Internet has become a very important communication medium of our daily lives in many fields. People nowadays can study, buy, watch, and obtain more information and more and more services from the Internet. Therefore, the Internet networks have to carry different types of data, such as voice, vid ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
The Internet has become a very important communication medium of our daily lives in many fields. People nowadays can study, buy, watch, and obtain more information and more and more services from the Internet. Therefore, the Internet networks have to carry different types of data, such as voice, video, image, and text data. These several types of data grow the Internet traffic up with the needs of providing Quality of Service (QoS) for each type of data. Thus, reducing the size of transmission and storage has become a focal area in the current research, as a solution for the traffic growth. In this paper, a survey of the current literature of the Internet traffics, traffic contract, traffic forms, and its parameters have been introduced. This survey shows the advantages of CBR and VBR traffic that make them in the nearest future two of the most traffic used in the Internet networks.
On the Impact of Packet Scheduling on EndtoEnd Delays in Large Networks
"... We seek to provide an analytical answer whether the impact of packet scheduling algorithms on endtoend delays diminishes on long network paths. The answer is provided through a detailed multinode delay analysis, which is applicable to a broad class of scheduling algorithms, and which can account ..."
Abstract
 Add to MetaCart
(Show Context)
We seek to provide an analytical answer whether the impact of packet scheduling algorithms on endtoend delays diminishes on long network paths. The answer is provided through a detailed multinode delay analysis, which is applicable to a broad class of scheduling algorithms, and which can account for statistical multiplexing. The analysis is enabled by two contributions: (1) We derive a function that can characterize the available bandwidth at a node for various scheduling algorithms. This characterization is sharp enough to provide necessary and sufficient conditions for satisfying worstcase delay bounds at a single node; (2) We obtain endtoend delay bounds by solving an optimization problem, in which the service received at multiple nodes is subsumed into a single function. Since our unified analysis captures the properties a broad group of schedulers in a single parameter, it can provide insight how the choice of scheduling algorithms impacts endtoend delay bounds. An important finding of this paper is that some schedulers show noticeable performance differences which persist in a network setting with long paths.
On the Convergence to Fairness in Overloaded FIFO Systems
"... Abstract—Many of today’s computing and communication systems are based on FIFO queues whose performance, e.g., in terms of throughput and fairness, is highly impacted by load fluctuations, especially in the case of shortterm overload. This paper analytically proves that overloaded FIFO queues are f ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract—Many of today’s computing and communication systems are based on FIFO queues whose performance, e.g., in terms of throughput and fairness, is highly impacted by load fluctuations, especially in the case of shortterm overload. This paper analytically proves that overloaded FIFO queues are fair in the sense that each flow or aggregate of flows receives a proportional fair share of the service rate. The convergence rate is evaluated with respect to flow sizes and intensity of overutilization for two broad and distinctive arrival classes: Markovian and heavytailed/selfsimilar. For the former class the paper shows smaller convergence times at higher utilizations, which is exactly the opposite behavior characteristic to underloaded queueing systems. I.
1Statistical Analysis of Link Scheduling on Long Paths
"... We study how the choice of packet scheduling algorithms influences endtoend performance on long network paths. Taking a network calculus approach, we consider both deterministic and statistical performance metrics. A key enabling contribution for our analysis is a significantly sharpened method fo ..."
Abstract
 Add to MetaCart
We study how the choice of packet scheduling algorithms influences endtoend performance on long network paths. Taking a network calculus approach, we consider both deterministic and statistical performance metrics. A key enabling contribution for our analysis is a significantly sharpened method for computing a statistical bound for the service given to a flow by the network as a whole. For a suitably parsimonious traffic model we develop closedform expressions for endtoend delays, backlog, and output burstiness. The deterministic versions of our bounds yield optimal bounds on endtoend backlog and output burstiness for some schedulers, and are highly accurate for endtoend delay bounds. I.