Low Cost Quality of Service Multicast Routing in High Speed Networks

Many of the services envisaged for high speed networks, such as B-ISDN/ATM, will support real-time applications with large numbers of users. Examples of these types of application range from those used by closed groups, such as private video meetings or conferences, where all participants must be known to the sender, to applications used by open groups, such as video lectures, where partcipants need not be known by the sender. These types of application will require high volumes of network resources in addition to the real-time delay constraints on data delivery. For these reasons, several multicast routing heuristics have been proposed to support both interactive and distribution multimedia services, in high speed networks. The objective of such heuristics is to minimise the multicast tree cost while maintaining a real-time bound on delay. Previous evaluation work has compared the relative average performance of some of these heuristics and concludes that they are generally efficient, although some perform better for small multicast groups and others perform better for larger groups. Firstly, we present a detailed analysis and evaluation of some of these heuristics which illustrates that in some situations their average performance is reversed; a heuristic that in general produces efficient solutions for small multicasts may sometimes produce a more efficient solution for a particular large multicast, in a specific network. Also, in a limited number of cases using Dijkstra's algorithm produces the best result. We conclude that the efficiency of a heuristic solution depends on the topology of both the network and the multicast, and that it is difficult to predict. Because of this unpredictability we propose the integration of two heuristics with Dijkstra's shortest path tree algorithm to produce a hybrid that consistently generates efficient multicast solutions for all possible multicast groups in any network. These heuristics are based on Dijkstra's algorithm which maintains acceptable time complexity for the hybrid, and they rarely produce inefficient solutions for the same network/multicast. The resulting performance attained is generally good and in the rare worst cases is that of the shortest path tree. The performance of our hybrid is supported by our evaluation results. Secondly, we examine the stability of multicast trees where multicast group membership is dynamic. We conclude that, in general, the more efficient the solution of a heuristic is, the less stable the multicast tree will be as multicast group membership changes. For this reason, while the hybrid solution we propose might be suitable for use with closed user group multicasts, which are likely to be stable, we need a different approach for open user group multicasting, where group membership may be highly volatile. We propose an extension to an existing heuristic that ensures multicast tree stability where multicast group membership is dynamic. Although this extension decreases the efficiency of the heuristics solutions, its performance is significantly better than that of the worst case, a shortest path tree. Finally, we consider how we might apply the hybrid and the extended heuristic in current and future multicast routing protocols for the Internet and for ATM Networks.

Reservation Models, From Arequipa to SRP

We analyse and illustrate two approaches that we have developed for providing reservations to flows. The first approach uses the explicit reservation model: a traffic profile is negotiated between users and the network. ATM and RSVP are two examples for this approach. In this paper we describe our experience in the ACT project EXPERT (AC094) with the explicit reservation model in the context of ATM. We show that the integration of ATM in a TCP/IP oriented operating system is easy and does not require developing applications specially for ATM. The method we have designed is called Arequipa and is described in RFC 2170. It is fully implemented in Linux. However, we are confronted with the complexity required to support a single reservation for each flow. Our analysis is that it is well suited for segregating flows in applications such as private virtual networks, but that, for multimedia networks, the cost of handling a large number of flows is too high. This and other factors led us to develop an alternative solution, based on an implicit reservation model. Our solution is called the Scalable Reservation Protocol (SRP). SRP aggregates flows inside the network: routers other than edge routers performing policing do maintain only aggregate information per port. SRP is being developed and implemented in the framework of the ACTS project DIANA (AC319). Keywords: QoS; Aggregation; Arequipa; ATM; IP; SR

Interworking public and private ATM networks

Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1996.Includes bibliographical references (p. 125-128).by C. Brit Gould.M.Eng

Resource management for multimedia traffic over ATM broadband satellite networks

PhDAbstract not availabl

A slotted-CDMA based wireless-ATM link layer : guaranteeing QoS over a wireless link.

Thesis (M.Sc.)-University of Natal, Durban, 2000.Future wireless networks will have to handle varying combinations of multimedia traffic that present the network with numerous quality of service (QoS) requirements. The continuously growing demand for mobile phones has resulted in radio spectrum becoming a precious resource that cannot be wasted. The current second-generation mobile networks are designed for voice communication and, even with the enhancements being implemented to accommodate data, they cannot efficiently handle the multimedia traffic demands that will be introduced in the near future. This thesis begins with a survey of existing wireless ATM (WATM) protocols, followed by an examination of some medium access control (MAC) protocols, supporting multimedia traffic, and based on code division multiple access (CDMA) physical layers. A WATM link layer protocol based on a CDMA physical layer, and incorporating techniques from some of the surveyed protocols, is then proposed. The MAC protocol supports a wide range of service requirements by utilising a flexible scheduling algorithm that takes advantage of the graceful degradation of CDMA with increasing user interference to schedule cells for transmission according to their maximum bit error rate (BER) requirements. The data link control (DLC) accommodates the various traffic types by allowing virtual channels (VCs) to make use of forward error correction (FEc) or retransmission techniques. The proposed link layer protocol has been implemented on a Blue Wave Systems DSP board that forms part of Alcatel Altech Telecoms' software radio platform. The details and practicality of the implementation are presented. A simulation model for the protocol has been developed using MIL3 's Opnet Modeler. Hence, both simulated and measured performance results are presented before the thesis concludes with suggestions for improvements and future work

Protocol security for third generation telecommunication systems

In this thesis, a novel protocol stack architecture is presented. The Future Core Networks System (FCNS) forms a secure reference model for use in packet-switched structures, with its applicability ranging from computer to telecommunication networks. An insight on currently used network protocol systems is given, analysing standardised sets of communication rules with respect to the security they afford to the messages exchanged. The lack of protection schemes for the internal protocol stack messages and the implementation pitfalls of their security architectures are described, in relation to the effects they have on the communication process. The OSI security model is also considered, with disadvantages identified in the placement of security functionality and its management. The drawbacks depicted for currently used systems form the motivation behind this work. The analysis of the FCNS follows, which is composed of three parts. In the first part, the FCNS communication layers are examined, with respect to the mechanisms used to establish, maintain and tear down a connection between peer entities. In the second part, the security mechanisms of the proposed reference architecture are given, including details on the FCNS keystream generator used for the security of the internal FCNS messages. Finally, the FCNS Error Protocol is depicted, illustrating the modes of operation and advantages it exhibits over currently used systems. The work then moves into presenting details of the software FCNS implementation, followed by the presentation of the results and measurements obtained by the case studies created. Comparisons are given in relation to the TCP/IP suite, to provide the means of identifying the FCNS applicability in various network environments. The work is concluded by presenting the FCNS functionality in delivering information for the UMTS, together with further work that may enhance the flexibility and use of the proposed architecture

A Hybrid Approach to Quality of Service Multicast Routing in High Speed Networks

Multimedia services envisaged for high speed networks may have large numbers of users, require high volumes of network resources and have real-time delay constraints. For these reasons, several multicast routing heuristics that use two link metrics have been proposed with the objective of minimising multicast tree cost while maintaining a bound on delay. Previous evaluation work has compared the relative average performance of some of these heuristics and concludes that they are generally efficient. This thesis presents a detailed analysis and evaluation of these heuristics which illustrate that in some situations their average performance is prone to wide variance for a particular multicast in a specific network. It concludes that the efficiency of an heuristic solution depends on the topology of both the network and the multicast, which is difficult to predict. The integration of two heuristics with Dijkstras shortest path tree algorithm is proposed, to produce a hybrid that consistently generates efficient multicast solutions for all possible multicast groups in any network. The evaluation results show good performance over a wide range of networks (flat and hierarchical) and multicast groups, within differing delay bounds. The more efficient the multicast tree is, the less stable it will be as multicast group membership changes. An efficient heuristic is extended to ensure multicast tree stability where multicast group membership is dynamic. This extension decreases the efficiency of the heuristics solutions, although they remain significantly cheaper than the worst case, a shortest delay path tree. This thesis also discusses how the hybrid and the extended heuristic might be applied to multicast routing protocols for the Internet and ATM Networks. Additionally, the behaviour of the heuristics is examined in networks that use a single link metric to calculate multicast trees and concludes one of the heuristics may be of benefit in such networks