Oriented Multicast Routing Applied to Network Level Agent Search
Damien MagoniDiscrete mathematics & theoretical computer science DMTCS
Sign up for access to the world's latest research
checkGet notified about relevant papers
checkSave papers to use in your research
checkJoin the discussion with peers
checkTrack your impact
Abstract
Many protocols need a discovery mechanism to enable a given node to locate one or several nodes involved in the same communication. However, there is no protocol ready to fulfill this service at the network-layer. Every protocol usually implements its own solution. In particular, multicast protocols often use a searching technique based on an algorithm called expanding ring search. This algorithm searches for nodes in all directions and thus uses much bandwidth. However a typical search can usually restrict its scan in a specific direction. To enable this broadcast restriction, we propose an oriented multicast routing algorithm. The algorithm's principle is to direct the multicast of packets towards a special node, involved in the communication, in order to search only in a limited area. The area must be as small as possible to reduce network flooding but still has to contain many nodes satisfying the search criteria. This new algorithm is the core part of a network-level node search framework also defined herein. A search protocol based on this framework could provide a network-level agent discovery service to current protocols. We have simulated an agent search with our algorithm on one side and with the expanding ring algorithm on the other side and we give comparative results.
Related papers
Oriented Multicast Routing Algorithm Applied to Network-level Agent Search
Many protocols need a discovery mechanism to enable a given node to locate one or several nodes involved in the same communication. However, there is no protocol ready to fulfill this service at the network-layer. Every protocol usually implements its own solution. In particular, multicast protocols often use a searching technique based on an algorithm called expanding ring search. This algorithm searches for nodes in all directions and thus uses much bandwidth. However a typical search can usually restrict its scan in a specific direction. To enable this broadcast restriction, we propose an oriented multicast routing algorithm. The algorithm's principle is to direct the multicast of packets towards a special node, involved in the communication, in order to search only in a limited area. The area must be as small as possible to reduce network flooding but still has to contain many nodes satisfying the search criteria. This new algorithm is the core part of a network-level node search framework also defined herein. A search protocol based on this framework could provide a network-level agent discovery service to current protocols. We have simulated an agent search with our algorithm on one side and with the expanding ring algorithm on the other side and we give comparative results.
Agent search by oriented multicast
2000
Many applications or protocols need to locate and select one or more nodes in the network to play a special role, without any a priori knowledge of the location of such nodes. One proposed algorithm is known as the Expanding Ring Search (ERS). However this algorithm looks for nodes in all directions. In some cases, it is desirable to select nodes that are located in the direction of a special node (root of a multicast tree, server, …) called the target. In this paper, we propose a new search algorithm to improve the expanding ring search mechanism. We assume that the initiator of the search knows the address of the target. Packets are multicasted in a controlled way, such that they do not go too far off the shortest path from the initiator to the target. We give some simulation results on the number of packets needed to achieve a search, and the quality of the agents that have been found.
Network Layer Search Service Using Oriented Multicasting
Many protocols and applications need a discovery mechanism to enable a given client node to locate one or several specific nodes involved in the same communication. However, there is no protocol ready to fulfill this service at the network layer. Every protocol usually implements its own solution. In particular, multicast protocols often use a search technique called expanding ring search. This method searches for those specific nodes in all directions and thus uses much bandwidth. However a typical search can usually restrict its scan in a specific direction. To answer this problem, we propose a network layer search service in replacement of the expanding ring search whenever it is appropriate. This service is based on an oriented multicasting protocol in order to ensure an efficiency higher than the expanding ring search. The oriented multicasting principle is to channel the multicasting of search packets towards a special node, involved in the communication, in order to scan only a limited area. We describe both the network layer search service and the oriented multicasting and we provide comparative simulation results between our service and the expanding ring search.
Algorithm for an Oriented Multicast Routing Protocol
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.
The directed reverse path join (DRPJ) protocol: an efficient multicast routing protocol
Computer Communications, 2001
The new Directed Reverse Path Join (DRPJ) protocol efficiently implements a Greedy routing algorithm for generating a multicast tree. The DRPJ protocol minimizes the messaging overhead from probe messages and allows a joining node to find multiple paths that are not constrained to be only the shortest paths. This enables a controllable tradeoff between path length and bandwidth consumption. Using simulation, the DRPJ protocol is compared to the existing Flooding with TTL and Directed Spanning Join (DSJ) protocols. Using a topology model of the current Internet, it is found that the DRPJ protocol reduces probe messages by nearly 90% and 75% when compared to the Flooding with TTL and DSJ protocols, respectively.
Multicast Routing Algorithms
Multicasting on the Internet and its Applications, 1998
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
Multicast Routing Protocols in Wired Networks: A Comprehensive Study
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.
Efficient Search Techniques in Peer to Peer Networks
In order to use Internet resources efficiently we need to search and locate information efficiently. System performance diminishes by either duplicating a large quantity of data on each and every node or flooding query to all the nodes in the network. Firstly, this paper reviews various searching algorithms. Search techniques can be classified as blind search in which information about neighbors is not kept by the peer and informed search where peers store information for routing queries to other nodes. It discusses how range queries can be processed efficiently by rotating scheme over structured P2P systems and secure searching algorithm based on topology adaptation which penalizes the malicious peers. Genetic algorithm providing parallel search are also covered in the paper. Lastly, it focuses on merits, demerits and applicability of these algorithms in different situations.
A Service-Centric Multicast Architecture and Routing Protocol
IEEE Transactions on Parallel and Distributed Systems, 2008
In this paper, we present a new multicast architecture and the associated multicast routing protocol for providing efficient and flexible multicast services over the Internet. Traditional multicast architectures construct and update the multicast tree in a distributed manner, which causes two problems: first, since each node has only local or partial information on the network topology and group membership, it is difficult to build an efficient multicast tree; second, due to lack of the complete information, broadcast is often used when transmitting control packets or data packets, which consumes a great deal of network bandwidth. In the newly proposed multicast architecture, a few powerful routers, called m-routers, collect multicast-related information and process multicast requests based on the information collected. m-routers handle most of multicast related tasks, while other routers only need to perform minimum functions for routing. m-routers are designed to be able to handle simultaneous many-to-many communications efficiently. The new multicast routing protocol, called Service Centric Multicast Protocol (SCMP), builds a dynamic shared multicast tree rooted at the m-router for each group. The multicast tree can satisfy the QoS constraint on maximum end-to-end delay and minimize tree cost as well. The tree construction is performed by a special type of self-routing packets to minimize protocol overhead. Our simulation results on NS-2 demonstrate that the new SCMP protocol outperforms other existing protocols and is a promising alternative for providing efficient and flexible multicast services over the Internet.
A new path probing strategy for inter-domain multicast routing
NGI 2005 - Next Generation Internet Networks: Traffic Engineering, 2005
Many already in use applications require the provision of QoS services from the underlying network infra-structure. This is particularly true for multicast, since it involves many participants at very sparse locations usually aiming to receive or send multimedia real-time streams. One way to provide QoS is through routing, since QoS aware multicast routing protocols can find feasible multicast trees.
Related papers
Cost-efficient multicast routing in ad hoc and sensor networks
The most commonly used model for these networks is called "Unit Disk Graph". The network is modeled as an undirected graph G = (V, E) where V is the set of vertices and E is the set of edges. The model assumes that the network is two dimensional (every node v ∈ V is embedded in the plane) and wireless nodes are represented by vertices of the graph. Each node v ∈ V has a transmission range r. Let dist(v 1 , v 2) be the distance between two vertices v 1 , v 2 ∈ V. An edge between two nodes v 1 , v 2 ∈ V exists iff dist(v 1 , v 2) ≤ r (i.e. v 1 and v 2 are able to communicate directly). Unicast routing both for MANETs and WSNs can be defined as the process of finding a paths in the network to deliver a message from the originator to the destination. As we mentioned before, in these networks such paths are formed by a set of nodes acting as relays. The multicast routing task is similar the unicast routing except that there are a number of destinations instead of a single node. These destinations are often referred as "receivers" in the literature. In this particular case, the set of relay nodes usually forms a tree, commonly known as "multicast tree". Below, we define more precisely the problem of unicast and multicast routing in these networks. Definition 56.1 Given a graph G = (V, E), a source node s ∈ V and a destination node D ∈ V , the unicast routing problem can be defined as finding a set of relay nodes F ⊂ V s.t. {s} ∪ F ∪ {D} is connected. Similarly, the multicast routing problem can be defined as follows: Definition 56.2 Given a graph G = (V, E), a source node s ∈ V and a set of destinations R ⊆ V , the multicast routing problem, can be defined as finding a set of relay nodes F ⊂ V s.t. {s} ∪ F ∪ R is connected. Of course, routing algorithms are designed to avoid cycles, and usually select paths according to some metric or combination of metrics such as hop count, delays, etc. In fact, most of the existing routing protocols use the hop count as the path selection metric. The problem of unicast routing is well-known and there are many distributed algorithms like Dijkstra, Bellman-Ford, etc. For the problem of multicast routing, there are also algorithms to build source path trees (SPT), shared trees, etc. In fact, the problem of the efficient distribution of traffic from a set of senders to a group of receivers in a datagram network was already studied by Deering [1] in the late 80's. Several multicast routing protocols like DVMRP [2], MOSPF [3], CBT [4] and PIM [5] have been proposed for IP
A Distributed Routing Method for Dynamic Multicasting
Telecommunication Systems, 2004
Single point, sender based control does not scale well for multicast delivery. For applications, such as group video or teleconferencing a low total cost multicast tree is required. In this article we present a destination driven algorithm to minimize the total tree cost of multicast tree in a dynamic situation for the whole session duration. In this heuristic approach we considered the staying duration of participants are available at the time of joining. The performance of our algorithm is analyzed through extensive simulation and evaluated against several other existing dynamic multicast routing and also against one well known near optimum heuristic algorithm used for solving Steiner tree problem. We have further tested our algorithm using erroneous information given by the joining participants. Simulation results show that its performance does not degrade that much even when the range of error is considerably high, which proves the robustness of our algorithm.
Multicast Routing and Its Protocols
2014
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. Group communication and network multimedia applications are becoming more and more popular. These applications set new demands on the quality of network resources such as bandwidth or latency. While these resources are usually very limited, good multicast routing will be more and more important as networks and the number of users continues to grow. In this paper, we discuss about the multicast routing tha...
On multicast path finding algorithms
IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings, 1991
We have designed and implemented three multicast path finding algorithms for networks with directed links: an optimal algorithm based on the dynamic programming technique, a heuristic algorithm with the assumption that all vertices have the multicast capability, and a heuristic algorithm for networks where some vertices do not have the multicast capability. Computation results show that the heuristic algorithms can find multicast paths whose costs are close to optimal and can operate with reasonable response time for large networks. We discuss applications of these path finding algorithms to set up multipoint connections.
Survey of Multicast Routing Algorithms and Protocols
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
Study of Multicasting Routing Protocols
Sending various duplicates of bundle to various hubs is called Multicasting. Wired and foundation based remote systems are bolstered by numerous multicast directing conventions. In any case, applying this idea in Mobile Ad hoc remote systems (MANETs) is a major test. Issues in specially appointed systems are the shortage of data transfer capacity, short lifetime of the hubs because of energy imperatives and dynamic topology because of the portability of hubs. These issues put in power to plan a straightforward, versatile, hearty and vitality productive directing convention for multicast condition. In this paper we will examine distinctive multicasting directing conventions for versatile specially appointed systems and their sending issues.
A Comparison of the Internet Multicast Routing Protocols
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.
Expanding ring search for route discovery in LOADng routing protocol
LOADng is an on-demand routing protocol, derived from AODV, simplified for use in lossy, low-power and constrained environments, where the ability for devices to communicate is a commodity to their primary function, and where therefore not only the communications channel offers limited capacity, but also the resources available to the device's communications subsystem are limted.
A Survey of Multicast Routing Protocols
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.
An architecture for wide-area multicast routing
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.
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.