Capacity allocation for long tailed traffic in packet switching networks

Authors:
Xian Liu
Affiliations:
Department of Systems Engineering, University of Arkansas at Little Rock, Little Rock, AR
Venue:
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Year:
2009

Citing 10
Cited 0

Introduction to queueing networks

Introduction to queueing networks
Data networks (2nd ed.)

Data networks (2nd ed.)
On the self-similar nature of Ethernet traffic (extended version)

IEEE/ACM Transactions on Networking (TON)
A generalized processor sharing approach to flow control in integrated services networks: the multiple node case

IEEE/ACM Transactions on Networking (TON)
Empirically derived analytic models of wide-area TCP connections

IEEE/ACM Transactions on Networking (TON)
Wide area traffic: the failure of Poisson modeling

IEEE/ACM Transactions on Networking (TON)
Virtual path control for ATM networks with call level quality of service guarantees

IEEE/ACM Transactions on Networking (TON)
Introduction to ATM Design and Performance: With Applications Analysis Software

Introduction to ATM Design and Performance: With Applications Analysis Software
Delay moments for FIFO GI/GI/s queues

Queueing Systems: Theory and Applications
On the use of fractional Brownian motion in the theory of connectionless networks

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The packet switching techniques are under evolution. The conventional "best effort" approach will no longer be the dominant service. The next generation of IP networks must provide the QoS to customers. Inadequacy is obvious when the conventional capacity allocation (CA) models are applied to the new IP architecture. In this paper, we propose a CA model that characterizes (1) the service priority scheme, (2) the service preemption scheme, and (3) the non-Poisson traffic in which the packets follow long tailed distributions.