In this paper we present a framework for the emerging Internet Quality of Service (QoS) All the important components of this framework, ie, Integrated Services, RSVP, Differentiated Services, Multi-Protocol Label Switching (MPLS) and Constraint Based Routing are covered We describe what Integrated Services and Differentiated Services are, how they can be implemented, and the problems they have We then describe why MPLS and Constraint Based Routing have been introduced into this framework, how they differ from and relate to each other, and where they fit into the Differentiated Services architecture Two likely service architectures are presented, and the end-to-end service deliveries in these two architectures are illustrated We also compare ATM networks to router networks with Differentiated Services and MPLS Putting all these together, we give the readers a grasp of the big picture of the emerging Internet QoS

/pdf/internet-qos-the-big-picture-58k838a1to.pdf

Internet QoS: the Big Picture

We present a framework for the emerging Internet quality of service (QoS). All the important components of this framework-integrated services, RSVP, differentiated services, multiprotocol label switching (MPLS), and constraint-based routing-are covered. We describe what integrated services and differentiated services are, how they can be implemented, and the problems they have. We then describe why MPLS and constraint-based routing have been introduced into this framework, how they differ from and relate to each other, and where they fit into the differentiated services architecture. Two likely service architectures are presented, and the end-to-end service deliveries in these two architectures are illustrated. We also compare ATM networks to router networks with differentiated services and MPLS. Putting all these together, we give the readers a grasp of the big picture of the emerging Internet QoS.

/pdf/internet-qos-a-big-picture-1t8pzyxl0g.pdf

Internet QoS: a big picture

We present CEDAR, a core-extraction distributed ad hoc routing algorithm for quality-of-service (QoS) routing in ad hoc network environments, CEDAR has three key components: (a) the establishment and maintenance of a self-organizing routing infrastructure called the core for performing route computations; (b) the propagation of the link-state of high bandwidth and stable links in the core through increase/decrease waves; and (c) a QoS-route computation algorithm that is executed at the core nodes using only locally available state. The performance evaluations show that CEDAR is a robust and adaptive QoS routing algorithm that reacts quickly and effectively to the dynamics of the network while still approximating the performance of link-state routing for stable networks.

/pdf/cedar-a-core-extraction-distributed-ad-hoc-routing-algorithm-29hr0pett6.pdf

CEDAR: a core-extraction distributed ad hoc routing algorithm

In the next generation high-speed wireless networks, it is important to provide quality-of-service (QoS) guarantees as they are expected to support multimedia applications. This paper proposes an admission control scheme based on adaptive bandwidth reservation to provide QoS guarantees for multimedia traffic carried in high-speed wireless cellular networks. The proposed scheme allocates bandwidth to a connection in the cell where the connection request originates and reserves bandwidth in all neighboring cells. When a user moves to a new cell and a handoff occurs, bandwidth is allocated in the new cell, bandwidth is reserved in the new cell's neighboring cells, and reserved bandwidth in more distant cells is released. The amount of bandwidth to reserve is dynamically adjusted, reflecting the current network conditions. The performance of the proposed scheme is evaluated through simulations of realistic cellular environments. The simulated network consists of a large number of cells, mobile users with various movement patterns are assumed, and a variety of multimedia applications (e.g., audio phone, video conference, video on demand, file transfer, etc.) is considered. It is shown that the proposed scheme provides small handoff dropping probability (i.e., the probability that handoff connections are dropped due to a lack of bandwidth) and achieves high bandwidth utilization.

An adaptive bandwidth reservation scheme for high-speed multimedia wireless networks

Transmission of multimedia streams imposes a minimum-bandwidth requirement on the path being used to ensure end-to-end Quality-of-Service (QoS) guarantees. While any shortest-path algorithm can be used to select a feasible path, additional constraints that limit resource consumption and balance the network load are needed to achieve efficient resource utilization. We present a systematic evaluation of four routing algorithms that offer different tradeoffs between limiting the path hop count and balancing the network load. Our evaluation considers not only the call blocking rate but also the fairness to requests for different bandwidths, robustness to inaccurate routing information, and sensitivity to the routing information update frequency. It evaluates not only the performance of these algorithms for the sessions with bandwidth guarantees, but also their impact on the lower priority best-effort sessions. Our results show that a routing algorithm that gives preference to limiting the hop count performs better when the network load is heavy, while an algorithm that gives preference to balancing the network load performs slightly better when the network load is light. We also show that the performance of using pre-computed paths with a few discrete bandwidth requests is comparable to that of computing paths on-demand, which implies feasibility of class-based routing. We observe that the routing information update interval can be set reasonably large to reduce routing overhead without sacrificing the overall performance, although an increased number of sessions can be misrouted.

On path selection for traffic with bandwidth guarantees

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

Zheng Wang

Papers

Quality-of-service routing for supporting multimedia applications