EPrints@IIT Delhi >
Faculty Research Publicatons  >
Computer Science and Engineering >

Please use this identifier to cite or link to this item: http://eprint.iitd.ac.in/handle/2074/1980

Title: Scheduling algorithms for bounded delay service in virtual networks
Authors: Garg, R
Saran, H
Keywords: virtual networks
latency rate servers
output burstiness
Issue Date: 1999
Citation: Global Telecommunications Conference, GLOBECOM, 2, 1318 - 1322p.
Abstract: With their widespread deployment, the need to provide QoS in virtual networks is being realized. We show that traditional scheduling algorithms like WFQ are incapable of providing a bounded delay service in a virtual network. The problem arises because traffic of a number of sessions sharing a virtual link in a virtual network is aggregated and tunneled through the physical network, which cannot isolate the traffic of well behaved sessions from that of misbehaving sessions. We show that this problem can be solved by regulating output burstiness on virtual links. Using the theory of latency rate servers, we show that latency rate servers with bounded output burstiness, may be used in a virtual network to provide bounded delay service. This gives a method to design a generic class of scheduling algorithms for virtual networks. Finally, we discuss how to integrate best effort and real-time traffic in a virtual network
URI: http://eprint.iitd.ac.in/dspace/handle/2074/1980
Appears in Collections:Computer Science and Engineering

Files in This Item:

File Description SizeFormat
gargsch1999.pdf53.61 kBAdobe PDFView/Open
View Statistics

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.


Valid XHTML 1.0! DSpace Software Copyright © 2002-2010  Duraspace - Feedback