Solving QoS Multicast Routing Problem Using ACO Algorithm I

PROCEEDINGS OF THE INTERNATIONAL …, 2002

In the age of multimedia and high-speed networks, multicast is one of the mechanisms by which the power of the Internet can be further harnessed in an efficient manner. When more than one receiver is interested in receiving a transmission from a single or a set of senders, multicast is the most efficient and viable mechanism. In the protocol stack of the network, multicast is best implemented in the network layer in the form of a multicast routing protocol to select the best path for the transmission. The other layers of the protocol stack provide additional features for multicast. This paper deals with how multicasting is implemented in the Internet (IPv4). With emphasis on the implementation of multicast at the network layer the implementation of additional features for multicast at the other layers of the protocol stack are presented. The network layer is concerned with routing of the data in an efficient manner with minimal duplication of data to the various receivers. The features of the routing protocols that have been proposed for best effort as well as QoS-based multicast are analyzed. Some of the issues and open problems related to multicast implementation and deployment are discussed along with an overview on how multicast service is deployed in some of the existing backbone networks. multimedia applications and Distributed Interactive Simulation (DIS). The multicast applications can be divided into the following categories: Single-point to multi-point e.g. Audio-Video broadcasts, Database updates, Push applications Multi-point to multi-point e.g. Video-conferencing, Distance Learning, Multiplayer Games Multi-point to single-point e.g. Resource Discovery, Data Collection, Auctions Address Range Uses 224.0.0.0 to 224.0.0.255 Administrative functions and system level routing chores (always sent with TTL of 1) 224.0.1.0 to 238.255.255.255 Multicast end user applications within groups, intranets and Internet 239.0.0.0 to 239.255.255.255 Locally administered or site specific multicast applications

Computer Communication Review, 2001

IP Multicast is facing a slow take-off although it is a hotly debated topic since more than a decade. Many reasons are responsible for this status. Hence, the Internet is likely to be organized with both unicast and multicast enabled networks. Thus, it is of utmost importance to design protocols that allow the progressive deployment of the multicast service by supporting unicast clouds. This paper proposes HBH (Hop-By-Hop multicast routing protocol). HBH adopts the source-specific channel abstraction to simplify address allocation and implements data distribution using recursive unicast trees, which allow the transparent support of unicastonly routers. Additionally, HBH is original because its tree construction algorithm takes into account the unicast routing asymmetries. As most multicast routing protocols rely on the unicast infrastructure, these asymmetries impact the structure of the multicast trees. We show through simulation that HBH outperforms other multicast routing protocols in terms of the delay experienced by the receivers and the bandwidth consumption of the multicast trees. * This work was sponsored by FUJB, CNPq, CAPES, COFECUB, and IST Project GCAP N 0 1999-10504.

Multicast routing is a group oriented communication whose objective is to support the propagation of data from a sender to all the receivers of a multicast group while trying to use the available bandwidth efficiently, it also reduces the communication cost and saves the network resources. In this paper, multicast routing protocols in wired networks that was proposed in recent years has been covered and made a comprehensive study on existing multicast routing protocols.

2008

One way to characterize communication is by the number of parties involved. The traditional communication modes are unicast, ie, one-to-one, and broadcast, ie, one-to-all. Between these two extremes we find multicast, the transmission of a message or datastream to an arbitrary set of receivers, ie, one-to-many. Multicast can be seen as a unifying communication mode, as it is a generalization of both unicast and broadcast.

An increasing number of Internet applications and services will require the use of multicast in the near future. However, only a few techniques are currently used in networklayer multicast routing protocols, such as flooding, pruning or reverse path construction methods. We propose an algorithm to define a new way of multicasting. The base principle is to perform a limited multicast channeled around the unicast path joining the sender to a specific destination, hence the name "oriented". This algorithm is close to reverse path multicast algorithms but the flooding is much more controlled. A protocol based on our algorithm could have many applications such as performing network node searches in a specific area. The algorithm is tailored as to be scalable to enable its use in an inter-domain environment.

Computer Networks, 2000

Multicast routing, once dominated by a single routing protocol, is becoming increasingly diverse. It is generally agreed that at least three routing protocols, PIM, DVMRP, and CBT will be widely deployed and must interoperate. This signals a shift from the Mbone as one large domain to a collection of administrative domains where each domain selects its own multicast routing protocol.

2005

The rapid growth of multimedia group-based applications motivates research into QoS guaranteed multicast network. In the multicast network carrying traffics of different QoS requirements, bandwidth fragmentation is considered as a bottleneck for traffic admission fairness and efficient usage of bandwidth resource. When the bandwidth fragmentation happens, the chance of accepting high-bandwidth flows is greatly decreased. To prevent bandwidth fragmentation in multicast network, we propose a new approach of bandwidth fragmentation avoided QoS multicast routing in this paper. In our new approach, we integrate active admission control into traditional QoS multicast routing algorithms to gain bandwidth fragmentation immunity. Moreover, an algorithm named dynamic bandwidth allocation with adaptive constraint is proposed and investigated as an example of active admission control algorithm in this paper. Because this algorithm is nonlinear and unsolvable by analytical approach, we employ OPNET simulation to study its performance.

Computer Communications, 1999

The exploding Internet has brought many novel network applications. These include teleconferencing, interactive games, the voice/video phone, real-time multimedia playing, distributed computing, web casting, and so on. One of the specific characteristics of these applications is that all involve interactions among multiple members in a single session. Unlike the traditional one-to-one message transmission (unicasting), if the underlying networks provide no suitable protocol supports, these applications may be costly and infeasible to implement.

Encyclopedia of Internet Technologies and Applications, 2008

Computer Networks, 2006

The last decade has seen a deluge of proposals for supporting multicast in the Internet. These proposals can be categorized as either infrastructure-based, with the multicast functionality provided by specialized network nodes, or host-based, with the multicast functionality provided by the members of the multicast group itself. In this paper, we present the design and evaluation of a hybrid multicast architecture wherein the infrastructure provides packet forwarding, and the end-hosts implement the control plane. End-hosts build multicast trees by setting up forwarding state in the infrastructure. This division of functionality enables our architecture to combine the efficiency of infrastructure-based solutions and the flexibility and deployability of host-based solutions. We present scalable and efficient algorithms for distributed tree construction and maintenance, and for reliable packet delivery. We have implemented the algorithms using i3 as the forwarding infrastructure. We evaluate our techniques using a combination of event-driven packet-level simulations, and our implementation over the PlanetLab testbed.

Proceedings 1997 International Conference on Network Protocols, 1997

The IP-multicast architecture i s extended with addressing information along multicast routing trees that permits more eficient and sophisticated multicast routing options and encourages communication and cooperation between IP and higher-layer protocols. The Addressable Internet Multicast (AIM) architecture is introduced that enables sources to restrict the delivery of packets to a subset of the receivers in a multicast group on a per-packet basis, permits receivers to listen to subsets of sources on a subscription basis, provides nearest-host routing, and allows higher-layer protocols to place packets into application-defined logical streams, so that hosts may direct the multicast routing of packets based on application-defined contexts. In addition, the Reliable Multicast Architecture (RMA) i s introduced to support end-toend reliable multicasting using heterogeneous reliable multicast protocols and providing acknowledgment trees implicitly, thereby eliminating the ACK implosion problem and allowing NAK-avoidance algorithms to work within local groups.

A mobile ad hoc network (MANET) is a selfconfiguring infrastructure less network of mobile devices connected by wireless.A protocol manages group membership and controls the path that multicast data takes over the network. Examples of mu lticast routing protocols include Protocol Independent Multicast (PIM). There are lots of mu lticast routing protocols, some wo rks with wired networks while the others with wireless networks, some protocols deals with both wired and wireless networks. But applying this concept in Mobile Ad Hoc networks (Manets) is a big challenge. The main aim of this paper is to explore the performance characteristics of mu lticast protocols.

Computer Communication Review, 1994

Existing multica.st routing mechanisms were intended for use within regions where a group is widely represented or bandwidth is universally plentiful. When group members, and senders to those group members, are distributed sparsely across a wide area, these schemes are not efficient; data packets or membership report information are occasionally sent over many links that do not lead to receivers or senders, respectively. We have developed a multicast routing architecture that efficiently establishes distribution trees across wide area internets, where many groups will be sparsely represented. Efficiency is measured in terms of the state, control message processing, and data packet processing, required across the entire network in order to deliver data packets to the members of the group. Our Protocol Independent Multicast (PIM) architecture: (a) maintains the traditional 1P multicast service model of receiver-initiated membership; (b) can be configured to adapt to different multicast group and network characteristics; (c) is not dependent on a specific unicast routing protocol; and (d) uses soft-state mechanisms to adapt to underlying network conditions and group dynamics. The robustness, flexibility, and scaling properties of this architecture make it well suited to large heterogeneous inter-networks.

IEEE ACM Transactions on Networking, 1996

The purpose of multicast routing is to reduce the communication coats for applications that send the same data to multiple recipients. Existing multicast routing mechanisms were intended for use within regions where a group is widely represented or bandwidth is universally plentiful. when group members, and senders to those group members, are d~tributed sparsely across a wide area, these schemes are not efficient; data packets or membership report information are occasionally sent over many links that do not lead to receivers or senders, respectively. We have developed a multicast routing archhecture that efficiently established distribution trees across wide area interneta, where many groups will be sparsely represented. Efficiency is measured in terms of the router state, control message processing, and data packet processing, required across the entire network in order to deliver data packets to the members of the group. Our protocol independent multicast (PIM) architecture: a) maintains the traditional 1P multicast service model of receiverinitiated membership, b) supports both shared and source-specific (shortest-path) distribution treea, c) is not dependent on a specific unicast routing protocol, and d) uses soft-state mechanisms to adapt to underlying network conditions and group dynamics. The robustness, flexibility, and seating properties of this arddtecture make it well-suited to large heterogeneous intemetworks. 1. intrOdUCtiOn T HIS paper describes an architecture for efficiently routing to multicast groups that span wide-area (and interdomain) intemets. We refer to the approach as protocol independent multicast (PIM) because it is not dependent on any particular unicast routing protocol. The architecture proposed here complements existing multicast routing mechanisms such as those proposed by Deering in [9] and [ 101 and implemented in MOSPF [26] and distance vector multicast routing protocol (DVMRP) [29]. These traditional multicast schemes were intended for use within regions where a group is widely represented or bandwidth is universally plentiful. However, when group members, and Manuscript recci~cd Februa~8, 1995; approved by JEEE/ACM TRANSACTIONSON NFTWORK!N(, Editor C. Partridge. S. Deering is with Xerox PARC. Palo Alto. CA 94304 USA (e-mail: deering @> pare. xcrol .cmm) D. L. Estrin IS w !th the