Diverse QOS requirements in Integrated Broadband Networks : Roles of Priorities and In-Call Negotiations

Deborah Estrin Computer Science Dept. University of Southern California estrin@usc.edu (213)740-4524 (213)740-7285 (fax) My research interest is quality of service support in LARGE high speed networks, in particular: routing, interaction of routing and resource reservation/management, user incentives/charging model, and simulation techniques, all for very large internetworks. Each of these is described, briefly, below. Several of the papers listed provide more detailed discussions. 1. The increasing speed of underlying transmission media is enabling new, and perhaps more importantly, integrated applications. However, because of the size and decentralized nature of the global internet, we cannot assume that the network will be homogeneously capable of all new services. Therefore, routing must identify routes with specific type-of-service (TOS) capabilities. Moreover, we suggest that TOS-routing for performance-sensitive applications (e.g., real-time video-conference, real-time interaction with high-bandwidth sensor or experimental data) should be sensitive to significant load changes, as well as to topology changes. At the same time, global scale means that we must minimize reliance on global consistency of routing databases and global distribution of dynamic routing information. As a basis for supporting application-specific routing we propose the use of source routing and a limited distribution mechanisms called Reverse Path Update. Source routing allows a wide range of routes to be used in the network without burdening intermediate nodes with agreement on, or precomputation of, all possible routing choices. Source routing also allows us to route without loops even in cases where different network nodes may maintain different (inconsistent) routing databases and criteria. We are exploring a technique called Reverse Path Update (RPU). RPU supports real time requirements, while reducing routing overhead by exploiting locality. It achieves this by distributing status and dynamic-load information only along ‘‘active routes’’. In other words, when an inter-domain connection experiences a change in state (i.e., fails, resumes service, passes a load-threshold), the domain that detects the change distributes the information only to the sources of routes that currently pass through the domain. This does not mean that information is distributed only to sources that pass through the affected physical router; in order to exploit route locality, information is distributed to active routes that pass through any of the border routers belonging to that same domain. The load information distributed indicates long-term load as opposed to short-lived fluctuations. We have documented preliminary results from simulation (see paper below), but many more research questions remain unaddressed, in particular, selection algorithms, load measures, and interaction with resource reservation and flow control mechanisms. (Joint work with L. Breslau (PhD student) and L. Zhang (Xerox)) 2. To support real-time traffic across a heterogeneous internet, resource management and routing must interact in a complementary manner. An obvious example is that stated above: if a particular flow can not be accommodated along a particular path due to insufficient resources (i.e. excessive traffic) then it may be desirable to provide an alternative route. Another routing issue is multicast. We must adapt current IP multicast approaches to interact with resourcereservation mechanism (i.e., what happens when part of a multicast tree does not have sufficient resources to provide the service guarantees required by a flow), and to scale more efficiently (i.e., allow senders to install/define small multicast groups/routes on demand when the entire group is known and is very small compared to the global internet). Beyond the problem of identifying a usable route, is the interaction between resource reservation/management techniques and adaptive routing. Some networks may require explicit flow setup and resource reservation to precede data transmission, and may install flow or flowtype specific state to provide service guarantees. Other networks, ALONG THE SAME sourcedestination path, may be very resource rich with respect to individual flows and may not require flow-specific setup or state. We need an internet protocol that allows individual networks along a path to make independent service guarantees in the presence of diverse network resources,

[1]  Manolis Katevenis,et al.  Fast switching and fair control of congested flow in broadband networks , 1987, IEEE J. Sel. Areas Commun..

[2]  A. Fraser,et al.  Towards a Universal Data Transport System , 1983, IEEE J. Sel. Areas Commun..

[3]  Ward Whitt,et al.  Characterizing Superposition Arrival Processes in Packet Multiplexers for Voice and Data , 1986, IEEE J. Sel. Areas Commun..

[4]  Scott Shenker,et al.  Supporting real-time applications in an Integrated Services Packet Network: architecture and mechanism , 1992, SIGCOMM '92.

[5]  A. Temple,et al.  TeraNet: a multihop multichannel ATM lightwave network , 1991, ICC 91 International Conference on Communications Conference Record.

[6]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks-the single node case , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[7]  D. O. Bowker,et al.  An integrated access terminal for wideband packet networking: Design and performance overview , 1990, International Symposium on Switching.

[8]  Deborah Estrin,et al.  Exploiting locality to provide adaptive routing of real-time flows in global internets (abstract) , 1992, CCRV.

[9]  Kotikalapudi Sriram,et al.  End-to-end performance models for variable bit rate voice over tandem links in packet networks , 1989, IEEE J. Sel. Areas Commun..

[10]  Harry Heffes,et al.  Performance of an In-Call Buffer-Window Reservation/Allocation Scheme for Long File Transfers , 1991, IEEE J. Sel. Areas Commun..

[11]  Deborah Estrin,et al.  A study of priority pricing in multiple service class networks , 1991, SIGCOMM '91.

[12]  Kotikalapudi Sriram Dynamic bandwidth allocation and congestion control schemes for voice and data multiplexing in wideband packet technology , 1990, IEEE International Conference on Communications, Including Supercomm Technical Sessions.

[13]  John S. White,et al.  Real-Time Traffic Measurements on MAGNET II , 1990, IEEE J. Sel. Areas Commun..

[14]  Aurel A. Lazar,et al.  Joint scheduling and admission control for ATS-based switching nodes , 1992, SIGCOMM '92.

[15]  Craig Partridge,et al.  An implementation of the revised internet stream protocol (ST-2) , 2001 .

[16]  E. L. Hahne,et al.  Round robin scheduling for fair flow control in data communication networks , 1986, ICC.

[17]  Domenico Ferrari,et al.  Design and Applications of a Delay Jitter Control Scheme for Packet-Switching Internetworks , 1991, NOSSDAV.

[18]  Mostafa Hashem Sherif,et al.  Voice Packetization and Compression in Broadband ATM Networks , 1991, IEEE J. Sel. Areas Commun..

[19]  B. Hamber Publications , 1998, Weed Technology.

[20]  Samuel P. Morgan Queueing disciplines and passive congestion control in byte-stream networks , 1989, IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies.

[21]  S. Shenker,et al.  Observations on the dynamics of a congestion control algorithm: the effects of two-way traffic , 1991, SIGCOMM '91.

[22]  MARS: the magnet II real-time scheduling algorithm , 1991, SIGCOMM '91.

[23]  Aurel A. Lazar,et al.  MAGNET II: A Metropolitan Area Network Based on Asynchronous Time Sharing , 1990, IEEE J. Sel. Areas Commun..

[24]  Aurel A. Lazar,et al.  An architecture for real-time control of broadband networks , 1991, IEEE Global Telecommunications Conference GLOBECOM '91: Countdown to the New Millennium. Conference Record.

[25]  Srinivasan Keshav,et al.  Comparison of rate-based service disciplines , 1991, SIGCOMM '91.

[26]  S. Jamaloddin Golestani A Stop-and-Go Queueing Framework for Congestion Management , 1990, SIGCOMM.

[27]  Terence D. Todd,et al.  Local and metropolitan multimesh networks , 1992, [Conference Record] SUPERCOMM/ICC '92 Discovering a New World of Communications.

[28]  Scott Shenker,et al.  Some observations on the dynamics of a congestion control algorithm , 1990, CCRV.

[29]  Aurel A. Lazar,et al.  AN ARCHITECTURE FOR INTEGRATED NETWORKS THAT GUARANTEES QUALITY OF SERVICE , 2006 .

[30]  Control of resources in broadband networks with quality of service guarantees , 1991, IEEE Communications Magazine.

[31]  Henning Schulzrinne,et al.  Congestion control for real-time traffic in high-speed networks , 1990, Proceedings. IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies@m_The Multiple Facets of Integration.

[32]  Ramesh Nagarajan,et al.  On defining, computing and guaranteeing quality-of-service in high-speed networks , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[33]  James F. Kurose,et al.  On computing per-session performance bounds in high-speed multi-hop computer networks , 1992, SIGMETRICS '92/PERFORMANCE '92.

[34]  Aurel A. Lazar,et al.  Real-Time Scheduling of Switching Nodes Based on Asynchronous Time Sharing , 1990 .

[35]  David M. Lucantoni,et al.  Traffic smoothing effects of bit dropping in a packet voice multiplexer , 1989, IEEE Trans. Commun..

[36]  D. Verma,et al.  Design and implementation of the real-time internet protocol , 1992, IEEE Workshop on the Architecture and Implementation of High Performance Communication Subsystems.

[37]  E. L. Hahne,et al.  Round-Robin Scheduling for Max-Min Fairness in Data Networks , 1991, IEEE J. Sel. Areas Commun..

[38]  A. G. Fraser,et al.  Queueing and framing disciplines for a mixture of data traffic types , 1984, AT&T Bell Laboratories Technical Journal.

[39]  Lixia Zhang VirtualClock: a new traffic control algorithm for packet-switched networks , 1991, TOCS.

[40]  Aurel A. Lazar,et al.  Real-Time Scheduling with Quality of Service Constraints , 1991, IEEE J. Sel. Areas Commun..

[41]  Craig Partridge Isochronous applications do not require jitter-controlled networks , 1991, RFC.

[42]  Domenico Ferrari,et al.  Real-Time Communication in an Internetwork , 1992, J. High Speed Networks.

[43]  D. Burr,et al.  Recent publications , 1898, The Journal of Geology.

[44]  Nicholas F. Maxemchuk,et al.  DQDB networks with and without bandwidth balancing , 1992, IEEE Trans. Commun..

[45]  Aurel A. Lazar,et al.  Cooperative distributed scheduling for ATS-based broadband networks , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.