Packet-level traffic control for the Internet: A framework and its experimental validation

Vayias, E; Soldatos, J; Mitrou, N

dc.contributor.author	Vayias, E	en
dc.contributor.author	Soldatos, J	en
dc.contributor.author	Mitrou, N	en
dc.date.accessioned	2014-03-01T02:42:08Z
dc.date.available	2014-03-01T02:42:08Z
dc.date.issued	2002	en
dc.identifier.issn	0166-5316	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/30811
dc.subject	Admission control	en
dc.subject	Experiments	en
dc.subject	Shaping	en
dc.subject	Traffic model	en
dc.subject.classification	Computer Science, Hardware & Architecture	en
dc.subject.classification	Computer Science, Theory & Methods	en
dc.subject.other	Bandwidth	en
dc.subject.other	Multiplexing	en
dc.subject.other	Packet networks	en
dc.subject.other	Quality of service	en
dc.subject.other	Queueing networks	en
dc.subject.other	Resource allocation	en
dc.subject.other	Telecommunication traffic	en
dc.subject.other	Packet-level traffic control	en
dc.subject.other	Internet	en
dc.title	Packet-level traffic control for the Internet: A framework and its experimental validation	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1016/S0166-5316(02)00031-7	en
heal.identifier.secondary	http://dx.doi.org/10.1016/S0166-5316(02)00031-7	en
heal.language	English	en
heal.publicationDate	2002	en
heal.abstract	This paper presents a theoretical framework, which can be the basis for traffic control and resource management mechanisms, that provide QoS with quantitative guarantees in the Internet. The starting point is a fairly general traffic shaping algorithm for effective rate enforcement which is based on a packet spacing law. Multiplexing several independent shaped streams results in a tight upper bound to the queue-length distribution at the multiplexer. The algorithm effectively works with any kind of input traffic (non-stationary, non-Markovian, heterogeneous, long-range dependent (LRD), etc.). Based on the definition of shaped streams, we devise mechanisms for aggregating, splitting and policing such streams without affecting the queuing performance at subsequent network, nodes. Also, a calculus for end-to-end QoS in this framework is presented. The theoretical statements are supported by simulation and experimental results on a network testbed. Since the enforced effective rate features the convenient additivity property Sigma(i)f(i) = C, it can be handily used for many traffic control and accounting functions, like policing, admission control, bandwidth allocation and charging. (C) 2002 Elsevier Science B.V. All rights reserved.	en
heal.publisher	ELSEVIER SCIENCE BV	en
heal.journalName	Performance Evaluation	en
dc.identifier.doi	10.1016/S0166-5316(02)00031-7	en
dc.identifier.isi	ISI:000175584200005	en
dc.identifier.volume	48	en
dc.identifier.issue	1-4	en
dc.identifier.spage	67	en
dc.identifier.epage	85	en