Multicast traffic aggregation in MPLS-based VPN networks

This article gives an overview of the current practical approaches under study for a scalable implementation of multicast in layer 2 and 3 VPNs over an IP-MPLS multiservice network. These proposals are based on a well-known technique: the aggregation of traffic into shared trees to manage the forwarding state vs. bandwidth saving trade-off. This sort of traffic engineering mechanism requires methods to estimate the resources needed to set up a multicast shared tree for a set of VPNs. The methodology proposed in this article consists of studying the effect of aggregation obtained by random shared tree allocation on a reference model of a representative network scenario.Publicad

Analysis domain model for shared virtual environments

The field of shared virtual environments, which also encompasses online games and social 3D environments, has a system landscape consisting of multiple solutions that share great functional overlap. However, there is little system interoperability between the different solutions. A shared virtual environment has an associated problem domain that is highly complex raising difficult challenges to the development process, starting with the architectural design of the underlying system. This paper has two main contributions. The first contribution is a broad domain analysis of shared virtual environments, which enables developers to have a better understanding of the whole rather than the part(s). The second contribution is a reference domain model for discussing and describing solutions - the Analysis Domain Model

REDO RSVP: Efficient Signalling for Multimedia in the Internet

Alarming reports of performance and scalability problems associated with per-flow reservations, have led many to lose belief in RSVP and the Integrated Services Architecture that relies on it. Because we are convinced of the need for some form of resource reservation, to support multimedia communications in the Internet, we have set about trying to improve RSVP. By careful study of the protocol, we have identified areas for improvement, and propose REDO RSVP, a reduced overhead version that includes a fast establishment mechanism (FEM). In this paper we describe the rationale for REDO RSVP and present a detailed analysis of its features and operations. We also analyse REDO RSVP by means of simulations, and show that it offers improvements to the performance of RSVP

Modelling & Improving Flow Establishment in RSVP

RSVP has developed as a key component for the evolving Internet, and in particular for the Integrated Services Architecture. Therefore, RSVP performance is crucially important; yet this has been little studied up till now. In this paper, we target one of the most important aspects of RSVP: its ability to establish flows. We first identify the factors influencing the performance of the protocol by modelling the establishment mechanism. Then, we propose a Fast Establishment Mechanism (FEM) aimed at speeding up the set-up procedure in RSVP. We analyse FEM by means of simulation, and show that it offers improvements to the performance of RSVP over a range of likely circumstances

Selective Advance Reservations Based on Host Movement Detection and Resource-Aware Handoff

This paper proposes a new mechanism, which addresses the excessive advance reservation requirements of QoS guarantee methods for mobile Internet. To save resources for excessive advance reservations, the proposed mechanism employs a movement detection scheme for a mobile host (MH) using link-layer functionalities. With the movement detection scheme, advance reservations can be established at only where a MH is likely to visit soon. Another novel feature of our mechanism is resource-aware handoff direction scheme that allows a MH to choose its next BS according to not only the link-layer signal strength, but also the available amount of resources in the reachable base stations (BSs). It considerably decreases a probability that QoS is disrupted due to the failure in advance reservation request. Also, the proposed mechanism requires fewer functional and structural changes to the current Internet components and protocols since all the enhanced features are integrated only into leaf BSs and MHs. It does not suffer from the problems of the conventional approaches based on Mobile IP and RSVP Tunnel, such as non-optimal routing path and signalling overhead. Our experiment results show that the proposed mechanism successfully eliminates the overhead for useless advance reservations while guaranteeing seamless QoS for MHs. The performance comparison demonstrates that our mechanism slightly outperforms the conventional approaches while requiring fewer modifications and additions to the existing Internet architecture. This performance advantage of the proposed mechanism becomes noticeable when the network is congested and the mobility of a host is high. Copyright © 2006 John Wiley & Sons, Ltd

Selective Advance Reservations Based on Host Movement Detection and Resource-Aware Handoff

This paper proposes a new mechanism, which addresses the excessive advance reservation requirements of QoS guarantee methods for mobile Internet. To save resources for excessive advance reservations, the proposed mechanism employs a movement detection scheme for a mobile host (MH) using link-layer functionalities. With the movement detection scheme, advance reservations can be established at only where a MH is likely to visit soon. Another novel feature of our mechanism is resource-aware handoff direction scheme that allows a MH to choose its next BS according to not only the link-layer signal strength, but also the available amount of resources in the reachable base stations (BSs). It considerably decreases a probability that QoS is disrupted due to the failure in advance reservation request. Also, the proposed mechanism requires fewer functional and structural changes to the current Internet components and protocols since all the enhanced features are integrated only into leaf BSs and MHs. It does not suffer from the problems of the conventional approaches based on Mobile IP and RSVP Tunnel, such as non-optimal routing path and signalling overhead. Our experiment results show that the proposed mechanism successfully eliminates the overhead for useless advance reservations while guaranteeing seamless QoS for MHs. The performance comparison demonstrates that our mechanism slightly outperforms the conventional approaches while requiring fewer modifications and additions to the existing Internet architecture. This performance advantage of the proposed mechanism becomes noticeable when the network is congested and the mobility of a host is high. Copyright © 2006 John Wiley & Sons, Ltd

Mobile IP: state of the art report

Due to roaming, a mobile device may change its network attachment each time it moves to a new link. This might cause a disruption for the Internet data packets that have to reach the mobile node. Mobile IP is a protocol, developed by the Mobile IP Internet Engineering Task Force (IETF) working group, that is able to inform the network about this change in network attachment such that the Internet data packets will be delivered in a seamless way to the new point of attachment. This document presents current developments and research activities in the Mobile IP area

Efficient Resource Management Mechanism for 802.16 Wireless Networks Based on Weighted Fair Queuing

Wireless Networking continues on its path of being one of the most commonly used means of communication. The evolution of this technology has taken place through the design of various protocols. Some common wireless protocols are the WLAN, 802.16 or WiMAX, and the emerging 802.20, which specializes in high speed vehicular networks, taking the concept from 802.16 to higher levels of performance. As with any large network, congestion becomes an important issue. Congestion gains importance as more hosts join a wireless network. In most cases, congestion is caused by the lack of an efficient mechanism to deal with exponential increases in host devices. This can effectively lead to very huge bottlenecks in the network causing slow sluggish performance, which may eventually reduce the speed of the network. With continuous advancement being the trend in this technology, the proposal of an efficient scheme for wireless resource allocation is an important solution to the problem of congestion. The primary area of focus will be the emerging standard for wireless networks, the 802.16 or “WiMAX”. This project, attempts to propose a mechanism for an effective resource management mechanism between subscriber stations and the corresponding base station

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.