On the modeling of delay and burstiness for calculating throughput

Authors:
Kashif Mahmood;Yuming Jiang;Addisu T. Eshete
Affiliations:
Centre for Quantifiable Quality of Service in Communication Systems, NTNU, Norway;Centre for Quantifiable Quality of Service in Communication Systems, NTNU, Norway;Centre for Quantifiable Quality of Service in Communication Systems, NTNU, Norway
Venue:
Sarnoff'10 Proceedings of the 33rd IEEE conference on Sarnoff
Year:
2010

Citing 5
Cited 0

Determining end-to-end delay bounds in heterogeneous networks

Multimedia Systems - Special issue on the fifth workshop on network and operating system support for digital audio and video 1995 (NOSSDAV)
Performance Guarantees in Communication Networks

Performance Guarantees in Communication Networks
Delay bounds for a network of guaranteed rate servers with FIFO aggregation

Computer Networks: The International Journal of Computer and Telecommunications Networking
Information theory and communication networks: an unconsummated union

IEEE Transactions on Information Theory
Rethinking information theory for mobile ad hoc networks

IEEE Communications Magazine

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a formula for the throughput of a network considering the bursty nature and delay requirements of real sources by using the established results in the area of guaranteed rate scheduling. The network of which the throughput is derived, implements aggregate scheduling which has been tipped as the solution to address scalability issues in large scale networks. The formula is quite general and is applicable to a wide range of arrival and services processes. The study is useful in the domain of network information theory for estimating the amount of traffic that can be accommodated within a network with a specified bit rate and at the same time ensuring that QoS criteria are met along the path traversed by the input flow.