Several new architectures have been developed for supporting multimedia applications such as digital video and audio. However, quality-of-service (QoS) routing is an important element that is still missing from these architectures. In this paper, we consider a number of issues in QoS routing. We first examine the basic problem of QoS routing, namely, finding a path that satisfies multiple constraints, and its implications on routing metric selection, and then present three path computation algorithms for source routing and for hop-by-hop routing.

/pdf/quality-of-service-routing-for-supporting-multimedia-4ixdfalt3u.pdf

Quality-of-service routing for supporting multimedia applications

Network Calculus.- Application of Network Calculus to the Internet.- Basic Min-plus and Max-plus Calculus.- Min-plus and Max-plus System Theory.- Optimal Multimedia Smoothing.- FIFO Systems and Aggregate Scheduling.- Adaptive and Packet Scale Rate Guarantees.- Time Varying Shapers.- Systems with Losses.

Network Calculus: A Theory of Deterministic Queuing Systems for the Internet

A resource reservation protocol (RSVP), a flexible and scalable receiver-oriented simplex protocol, is described. RSVP provides receiver-initiated reservations to accommodate heterogeneity among receivers as well as dynamic membership changes; separates the filters from the reservation, thus allowing channel changing behavior; supports a dynamic and robust multipoint-to-multipoint communication model by taking a soft-state approach in maintaining resource reservations; and decouples the reservation and routing functions. A simple network configuration with five hosts connected by seven point-to-point links and three switches is presented to illustrate how RSVP works. Related work and unresolved issues are discussed. >

/pdf/rsvp-a-new-resource-reservation-protocol-ew2ul3cri4.pdf

RSVP: a new resource ReSerVation Protocol

While today's computer networks support only best-effort service, future packet-switching integrated-services networks will have to support real-time communication services that allow clients to transport information with performance guarantees expressed in terms of delay, delay jitter, throughput, and loss rate. An important issue in providing guaranteed performance service is the choice of the packet service discipline at switching nodes. In this paper, we survey several service disciplines that are proposed in the literature to provide per-connection end-to-end performance guarantees in packet-switching networks. We describe their mechanisms, their similarities and differences and the performance guarantees they can provide. Various issues and tradeoffs in designing service disciplines for guaranteed performance service are discussed, and a general framework for studying and comparing these disciplines are presented. >

/pdf/service-disciplines-for-guaranteed-performance-service-in-yk74mpzi11.pdf

Service disciplines for guaranteed performance service in packet-switching networks

The Internet has been a startling and dramatic success. Originally designed to link together a small group of researchers, the Internet is now used by many millions of people. However, multimedia applications, with their novel traffic characteristics and service requirements, pose an interesting challenge to the technical foundations of the Internet. We address some of the fundamental architectural design issues facing the future Internet. In particular, we discuss whether the Internet should adopt a new service model, how this service model should be invoked, and whether this service model should include admission control. These architectural issues are discussed in a nonrigorous manner, through the use of a utility function formulation and some simple models. While we do advocate some design choices over others, the main purpose here is to provide a framework for discussing the various architectural alternatives. >

/pdf/fundamental-design-issues-for-the-future-internet-dw1a17ldbl.pdf

Fundamental design issues for the future Internet

Future high-speed networks are expected to carry traffic with a wide range of performance requirements. Two queue service disciplines, rate-based scheduling and hierarchical round robin scheduling, are described. These disciplines allow some connections to receive guaranteed rate and jitter performance, while others receive best-effort service. Rate based scheduling is designed for fast packet networks, while hierarchical round robin is an extension of round robin scheduling suitable for use in networks based on the asynchronous transfer mode (ATM) being defined in CCITT. Both schemes are feasible at rates of 1 Gb/s. The schemes allow strict bounds on the buffer space required for rate controlled connections and can provide efficient utilization of transmission bandwidth. >

http://blizzard.cs.uwaterloo.ca/keshav/home/Papers/data/90/hrr_globecom.pdf

H. Kanakia

Papers

Rate controlled servers for very high-speed networks