Computer Science – Networking and Internet Architecture
Scientific paper
2011-01-06
Computer Science
Networking and Internet Architecture
20 pages, 6 figures
Scientific paper
We study how the choice of packet scheduling algorithms influences end-to-end 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 closed-form expressions for end-to-end delays, backlog, and output burstiness. The deterministic versions of our bounds yield optimal bounds on end-to-end backlog and output burstiness for some schedulers, and are highly accurate for end-to-end delay bounds.
Burchard Almut
Ghiassi-Farrokhfal Yashar
Liebeherr Jörg
No associations
LandOfFree
Statistical Analysis of Link Scheduling on Long Paths does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Statistical Analysis of Link Scheduling on Long Paths, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Statistical Analysis of Link Scheduling on Long Paths will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-399795