Multicast routing and bandwidth dimensioning in overlay networks

Multicast services can be provided either as a basic network service or as an application-layer service. Higher level multicast implementations often provide more sophisticated features and can provide multicast services at places where no network layer support is available. Overlay multicast networks offer an intermediate option, potentially combining the flexibility and advanced features of application layer multicast with the greater efficiency of network layer multicast. In this paper, we introduce the multicast routing problem specific to the overlay network environment and the related capacity assignment problem for overlay network planning. Our main contributions are the design of several routing algorithms that optimize the end-to-end delay and the interface bandwidth usage at the multicast service nodes within the overlay network. The interface bandwidth is typically a key resource for an overlay network provider, and needs to be carefully managed in order to maximize the number of users that can be served. Through simulations, we evaluate the performance of these algorithms under various traffic conditions and on various network topologies. The results show that our approach is cost-effective and robust under traffic variations.     

Stateless overlay multicast with in-packet bloom filters

Due to the difficulty of deploying Internet protocol (IP) multicast on the Internet on a large scale, overlay multicast has been considered as a promising alternative to develop the multicast communication in recent years. However, the existing overlay multicast solutions suffer from high costs to maintain the state information of nodes in the multicast forwarding tree. A stateless overlay multicast scheme is proposed, in which the multicast routing information is encoded by a bloom filter (BF) and encapsulated into the packet header without any need for maintaining the multicast forwarding tree. Our scheme leverages the node heterogeneity and proximity information in the physical topology and hierarchically constructs the transit-stub overlay topology by assigning geometric coordinates to all overlay nodes. More importantly, the scheme uses BF technology to identify the nodes and links of the multicast forwarding tree, which improves the forwarding efficiency and decreases the false-positive forwarding loop. The analytical and simulation results show that the proposal can achieve high forwarding efficiency and good scalability.     

An Efficient Multicast Routing Protocol in Wireless Mobile Networks

Providing multicast service to mobile hosts in wireless mobile networking environments is difficult due to frequent changes of mobile host location and group membership. If a conventional multicast routing protocol is used in wireless mobile networks, several problems may be experienced since existing multicast routing protocols assume static hosts when they construct the multicast delivery tree. To overcome the problems, several multicast routing protocols for mobile hosts have been proposed. Although the protocols solve several problems inherent in multicast routing proposals for static hosts, they still have problems such as non-optimal delivery path, datagram duplication, overheads resulting from frequent reconstruction of a multicast tree, etc. In this paper, we summarize these problems of multicast routing protocols and propose an efficient multicast routing protocol based on IEFT mobile IP in wireless mobile networks. The proposed protocol introduces a multicast agent, where a mobile host receives a tunneled multicast datagram from a multicast agent located in a network close to it or directly from the multicast router in the current network. While receiving a tunneled multicast datagram from a remote multicast agent, the local multicast agent may start multicast join process, which makes the multicast delivery route optimal. The proposed protocol reduces data delivery path length and decreases the amount of duplicate copies of multicast datagrams. We examined and compared the performance of the proposed protocol and existing protocols by simulation under various environments and we got an improved performance over the existing proposals.     

Ad Hoc网络中基于协商机制的QoS多播路由研究

针对移动Ad Hoc网络QoS多播路由中普遍存在的拥塞问题,提出了一种基于协商机制的QoS多播路由协议,节点协商使用以一定QoS约束建立起的多播链路,避免过度使用多播资源引起网络拥塞,从而提高分组投递率和网络吞吐量。通过NS2仿真证明,该协议能够保证不同类型业务在网络中传输的服务质量,提高网络的利用率。     

Power aware scalable multicast routing protocol for MANETs

Multicasting is an effective way to provide group communication. In mobile ad hoc networks (MANETs), multicasting can support a wide variety of applications that are characterized by a close degree of collaboration. Since MANETs exhibit severe resource constraints such as battery power, limited bandwidth, dynamic network topology and lack of centralized administration, multicasting in MANETs become complex. The existing multicast routing protocols concentrate more on quality of service parameters like end‐to‐end delay, jitter, bandwidth and power. They do not stress on the scalability factor of the multicast. In this paper, we address the problem of multicast scalability and propose an efficient scalable multicast routing protocol called ‘Power Aware Scalable Multicast Routing Protocol (PASMRP)’ for MANETs. PASMRP uses the concept of class of service with three priority levels and local re‐routing to provide scalability. The protocol also ensures fair utilization of the resources among the nodes through re‐routing and hence the lifetime of the network is increased. The protocol has been simulated and the results show that PASMRP has better scalability and enhanced lifetime than the existing multicast routing protocols. Copyright © 2005 John Wiley & Sons, Ltd.     

OMAC: A new access control architecture for overlay multicast communications

Multicast communications concern the transfer of data among multiple users. Multicast communications can be provided at the network layer—an example is IP multicast—or at the application layer, also called overlay multicast. An important issue in multicast communications is to control how different users—senders, receivers, and delivery nodes—access the transmitted data as well as the network resources. Many researchers have proposed solutions addressing access control in IP multicast. However, little attention has been paid to overlay multicast. In this paper, we investigate the access control issues in overlay multicast and present OMAC: a new solution to address these issues. OMAC provides access control for senders, receivers, and delivery nodes in overlay multicast. The proposed architecture, which is based on symmetric key cryptosystem, centralizes the authentication process in one server whereas it distributes the authorization process among the delivery nodes. Moreover, delivery nodes are utilized as a buffer zone between end systems and the authentication server, making it less exposed to malicious end systems. To evaluate our work, we have used simulation to compare the performance of OMAC against previous solutions. Results of the simulation show that OMAC outperforms previous multicast access control schemes. Copyright © 2010 John Wiley & Sons, Ltd.     

BSMR: Byzantine-Resilient Secure Multicast Routing in Multihop Wireless Networks

Multihop wireless networks rely on node cooperation to provide multicast services. The multihop communication offers increased coverage for such services but also makes them more vulnerable to insider (or Byzantine) attacks coming from compromised nodes that behave arbitrarily to disrupt the network. In this work, we identify vulnerabilities of on-demand multicast routing protocols for multihop wireless networks and discuss the challenges encountered in designing mechanisms to defend against them. We propose BSMR, a novel secure multicast routing protocol designed to withstand insider attacks from colluding adversaries. Our protocol is a software-based solution and does not require additional or specialized hardware. We present simulation results that demonstrate that BSMR effectively mitigates the identified attacks.     

The Performance Analysis of the Multicast Extension Support for Proxy MIPv6

Mobile multicast is based on the traditional multicast protocols and the mobility support protocols to provide the multicast services for the mobile subscribers. Several mobile multicast methods were proposed in the past few years, but most of them are based on Mobile IPv6 and its variants which require the mobile node to support the mobility function. Recently, Proxy Mobile IPv6 (PMIPv6) was proposed to provide the mobility support for the mobile node with or without mobility function, and the previous studies have shown that PMIPv6 can improve the performance in term of the handover performance and protocol cost. However, PMIPv6 mainly concerns on the mobility support for unicast routing and little considers the multicast routing. In this paper, we propose two multicast methods called the MAG (Mobile Access Gateway)-based method and LMA (Local Mobility Anchor)-based method based on the different multicast delivery transmission path to extend PMIPv6, and analyze their performance under the different scenarios. The analytical results show that the LMA-based method is suitable for the higher speed, bigger domain size, and larger network topology scenarios, whereas the MAG-based method is suitable for the lower speed, smaller domain size and smaller network topology scenarios.     

DREAM : Density Aware Overlay Multicast Forwarding in Mobile Ad Hoc Networks

Instead of multicast functionality on a network entity, the overlay multicast schemes support multicast service with help of underlying unicast routing protocol. However, due to a node's free migration and communication based on broadcasting capability, effectiveness of overlay multicast scheme is not guaranteed in Mobile Ad Hoc Networks (MANET). Specially, nodes' density within some areas changes frequently so heterogeneous forwarding scheme based on density is strongly desired in order to reduce a number of collisions as well as enhance resource utilization. To achieve this, in this paper, we introduce a new forwarding scheme, called as DREAM (Density aware overlay Multicast forwarding). A key feature of DREAM is to introduce a scoped flooding where the nodes densely locates, on the other hand, data forwarding based on unicast routing protocol is maintained in sparse environment. Distinct advantages are evaluated by simulation. Ki-Il Kim received the M.S. and Ph.D. degrees in computer science from the Chungnam National University, Daejeon, Korea, in 2002 and 2005, respectively. He is currently with Department of Information Science, Gyeongsang National University as a faculty member. His research interests include routing for MANET, QoS in wireless network, multicast, and sensor networks. Sang-Ha Kim received the B.S. degree in chemistry from Seoul National University, Seoul, Korea, in 1980. He received the M.S. and Ph.D. degrees in quantum scattering and computer science from the University of Houston, Houston, TX, in 1984 and 1989, respectively. From 1990 to 1991, he was with the Supercomputing Center, SERI, Korean Institute of Science and Technology (KIST) as Senior Researcher. He joined Chungnam National University, Daejeon,Korea, in 1992, where he is a Professor. His current research interests include wireless networks, ad hoc networks, QoS, optical networks, and network analysis.     

Alternate path routing for multicast

Current network-layer multicast routing protocols build multicast trees based only on hop count and policy. If a tree cannot meet application requirements, the receivers have no alternative. In this paper, we propose a general and modular architecture that integrates alternate path routing with the network's multicast services. This enables individual multicast receivers to reroute a multicast tree according to their needs, subject to policy restrictions. Our design focuses on the two primary components of this architecture - a loop-free path installation protocol and a scalable, distributed path computation algorithm. Based on a simulation study, we demonstrate that using alternate path routing enables receivers to find acceptable paths nearly as well as a link-state protocol, with much lower overhead. We also show that our approach scales to large networks and that performance improves as a multicast group grows in size.     

A cross-layer approach for real-time multimedia streaming on wireless peer-to-peer ad hoc network

Peer-to-peer (P2P) live streaming over mobile ad hoc network (MANET) is a state-of-the-art technique for wireless multimedia applications, such as entertainments and disaster recovery. The peers share the live streaming over MANET via multi-hop wireless link, so an efficient data delivery scheme must be required. However, the high churn rate and the frequent mobility baffle the P2P membership management and overlay maintenance. The unreliable wireless connection of MANET leads to the difficulties of large-scale and real-time streaming distribution, and a lack of overlay proximity leads to the inefficient streaming delivery. We present a cross-layer design for P2P over MANET to manage and maintain the overlay, and select efficient routing path to multicast media streams. Our proposed scheme (COME-P2P) integrates both P2P DHT-based lookup and IPv6 routing header to improve the delivery efficiency. Through the cross-layer design, the low layer detects mobility for informing high layer to refine the finger table, and high layer maintains the efficient multicast path for informing low layer to refine the routing table. How to keep stable routing paths for live streaming via IPv6 routing is the main contribution of this paper. The overlay proximity can shorten routing propagation delay, and the hop-by-hop routing can avoid the traffic bottleneck. Through the mathematical analysis and simulation results, COME-P2P can be demonstrated to achieve high smoothness and reduce signaling overhead for live streaming.     

Topology based placement of multicast capable nodes for supporting efficient multicast communication in WDM optical networks

Most existing algorithms for the problem of optical signal splitter placement or multicast splitting-capable node placement in a WDM network are based on the performance of attempting a large set of randomly generated multicast sessions in the network. Experiments show that placement of multicast capable nodes based on their importance for routing one set of multicast sessions may not be a right choice for another set of multicast sessions. In this work, we propose placement algorithms that are based on network topology and the relative importance of a node in routing multicast sessions, which is measured by our proposed metrics. Since a network topology is fixed once given, the proposed algorithms are essentially network traffic independent. We evaluate the proposed placement algorithms given static sets of multicast sessions as well as under dynamic traffic conditions, which are routed using our splitter constrained multicast routing algorithm. Our results show that the proposed algorithms perform better, compared to existing algorithms.     

Multi‐path routing scheme for non‐interactive multicast communications

This paper proposes a multicast routing algorithm that makes use of multiple node‐disjoint distribution trees for its routing from the source to the multicast group members. The specialty of this scheme is that the different packets of a message between a source and destinations are routed through node‐disjoint paths to provide reliable and secure multicast communication. In this proposed routing scheme the computation of the node‐disjoint path for packet routing is done either at a centralized route moderator or in a distributed fashion at all destinations in order to avoid single point failure. An effective provision is made to enable new members to join the existing multicast trees and to prune leaving members. The performance parameters of the proposed reliable and secure multi‐path routing scheme are studied under various network conditions using GloMoSim. Copyright © 2006 John Wiley & Sons, Ltd.     

Beacon-less geographic multicast routing in a real-world wireless sensor network testbed

We study the problem of geographic multicast routing (GMR) in a wireless sensor network. In particular, we are interested in geographic routing solutions with a very limited control overhead and overall bandwidth consumption. Existing GMR protocols require nodes to periodically exchange beacon messages to gather information about the position of their neighbors. These beacons represent a waste of resources, specially in areas of the network with no active communications. Beacons also induce significant problems in real deployments such as interferences and collisions that cause inconsistencies in neighboring tables. In this paper we propose a new beacon-less geographic multicast routing protocol called BRUMA. Unlike previous solutions, BRUMA uses the propagation of data packets to opportunistically select next hops among those that are reachable from the sending node. In addition, we contribute a novel next hop selection function by which candidate next hops schedule their responses based on their progress along each of the branches of the multicast tree. This allows the protocol to overcome most of the issues of beacon-based solutions in real deployments such as collisions, low-quality links, etc. The results of our empirical tests in a real testbed as well as in simulations show that BRUMA achieves a higher packet delivery ratio and a lower overall bandwidth consumption than GMR, which is the protocol performing best among existing geographic multicast solutions.     

Providing Fault-Tolerant Ad hoc Routing Service in Adversarial Environments

Most existing designs of ad hoc networks are based on the assumption of non-adversarial environments, where each node in the network is cooperative and well-behaved. When misbehaving nodes exist in the network, the performance of current routing protocols degrades significantly. Since ad hoc networks, consisting of autonomous nodes, are open and distributed in nature, maintaining a fault-free network environment is extremely difficult and expensive. In this paper, we propose a new routing service named best-effort fault-tolerant routing (BFTR). The design goal of BFTR is to provide packet routing service with high delivery ratio and low overhead in presence of misbehaving nodes. Instead of judging whether a path is good or bad, i.e., whether it contains any misbehaving node, BFTR evaluates the routing feasibility of a path by its end-to-end performance (e.g. packet delivery ratio and delay). By continuously observing the routing performance, BFTR dynamically routes packets via the most feasible path. BFTR provides an efficient and uniform solution for a broad range of node misbehaviors with very few security assumptions. The BFTR algorithm is evaluated through both analysis and extensive simulations. The results show that BFTR greatly improves the ad hoc routing performance in the presence of misbehaving nodes.     

A ring-based multicast routing topology with QoS support in wireless mesh networks

Wireless mesh networking (WMN) is an emerging technology for future broadband wireless access. The proliferation of the mobile computing devices that are equipped with cameras and ad hoc communication mode creates the possibility of exchanging real-time data between mobile users in wireless mesh networks. In this paper, we argue for a ring-based multicast routing topology with support from infrastructure nodes for group communications in WMNs. We study the performance of multicast communication over a ring routing topology when 802.11 with RTS/CTS scheme is used at the MAC layer to enable reliable multicast services in WMNs. We propose an algorithm to enhance the IP multicast routing on the ring topology. We show that when mesh routers on a ring topology support group communications by employing our proposed algorithms, a significant performance enhancement is realized. We analytically compute the end-to-end delay on a ring multicast routing topology. Our results show that the end-to-end delay is reduced about 33 %, and the capacity of multicast network (i.e., maximum group size that the ring can serve with QoS guarantees) is increased about 50 % as compared to conventional schemes. We also use our analytical results to develop heuristic algorithms for constructing an efficient ring-based multicast routing topology with QoS guarantees. The proposed algorithms take into account all possible traffic interference when constructing the multicast ring topology. Thus, the constructed ring topology provides QoS guarantees for the multicast traffic and minimizes the cost of group communications in WMNs.     

An efficient and intelligent routing strategy for vehicular delay tolerant networks

The vehicular delay-tolerant network is the real-life application based area of Delay tolerant network where communication takes place using vehicular nodes and roadside units. The topology used in vehicular networks is highly dynamic by architecture due to the use of moving vehicular nodes. It operates in such a scenario where a direct path between source and destination remains absent on the most piece of the time. In case of non-existence of connected path vehicular delay-tolerant network works opportunistically and uses the same store, carry, and forward paradigm as Delay Tolerant Network. However, the routing protocols designed for vehicular delay-tolerant network faces crucial challenges like inadequate relay node, incomplete data transfer, a large number of packet drop, and uncertain delivery time. In this research paper, we propose a novel routing strategy for the vehicular delay-tolerant network. The proposed routing strategy selects efficient vehicular relay node for complete packet transfer and intelligently reduces the packet drop for timely packet delivery. We implement the proposed routing strategy in the ONE simulator; the ONE simulator provides an opportunistic environment for nodes. We analyze the performance of the proposed strategy under various simulations results using different parameters. The results show that the proposed strategy outperforms standard routing protocols in terms of considered parameters and provide an efficient solution for the problem of disconnection.

     

基于MAODV无线Mesh网多播路由协议的优化

针对无线Mesh网(WMNs)现有的路由协议不能很好地解决多播视频业务对时延的要求,以Ad hoc网络中多播路由协议MAODV为基础,结合无线网络拓扑的动态变化,在WMN下提出一种基于路径优化的ROMAODV(Routing Optimization-MAODV)路由算法.此算法以很小的优化开销获得延时的大幅度减小,仿...     

High-throughput multicast routing metrics in wireless mesh networks

The stationary nature of nodes in a mesh network has shifted the main design goal of routing protocols from maintaining connectivity between source and destination nodes to finding high-throughput paths between them. Numerous link-quality-based routing metrics have been proposed for choosing high-throughput routing paths in recent years. In this paper, we study routing metrics for high-throughput tree or mesh construction in multicast protocols. We show that there is a fundamental difference between unicast and multicast routing in how data packets are transmitted at the link layer, and accordingly how the routing metrics for unicast routing should be adapted for high-throughput multicast routing. We propose a low-overhead adaptive online algorithm to incorporate link-quality metrics to a representative multicast routing protocol. We then study the performance improvement achieved by using different link-quality-based routing metrics via extensive simulation and experiments on a mesh-network testbed, using ODMRP as a representative multicast protocol.Our extensive simulation studies show that: (1) ODMRP equipped with any of the link-quality-based routing metrics can achieve higher throughput than the original ODMRP. In particular, under a tree topology, on average, ODMRP enhanced with link-quality routing metrics achieve up to 34% higher throughput than the original ODMRP under low multicast sending rate; (2) the improvement reduces to 21% under high multicast sending rate due to higher interference experienced by the data packets from the probe packets; (3) heavily penalizing lossy links is an effective way in the link-quality metric design to avoid low-throughput paths; and (4) the path redundancy from a mesh data dissemination topology in mesh-based multicast protocols provides another degree of robustness to link characteristics and reduces the additional throughput gain achieved by using link-quality-based routing metrics. Finally, our experiments on an eight-node testbed show that on average, ODMRP using SPP and PP achieves 14% and 17% higher throughput over ODMRP, respectively, validating the simulation results.     

Impact of Bloom Filter on Infection Rate in Epidemic Forwarding for ICNs

Mobile ad hoc routing protocols fails in intermittently connected networks (ICN) (i.e. characterized by short-range communication and absence of connected path from source to destination). However, Epidemic routing techniques ensures eventual message delivery from source to destination even where there is never a connected path or when a network partition exists at the origin of message. Epidemic Routing uses random pair-wise messages exchanges between nodes with goals to maximize message delivery rate, minimize message latency, and the total resources consumed in message delivery. Epidemic routing uses summary vector to avoid useless transmission and redundancy. Further,to make summery vector efficient, epidemic routing can use bloom filter to significantly reduce the useless transmissions associated with the summary vector. However, the challenge for epidemic routing remains opens is to optimal design of summary vector size for finite buffer while keeping the benefits of infinite buffer space. This paper proposes an improved scheme of Bloom filter (named it modified bloom filter MBLF), which is tailored according to epidemic routing. We performed simulation to support our clam and observed that delivery ratio of MBLF with epidemic routing is 19 % higher then the traditional bloom filter. In this paper, we have proposed a bloom filter based epidemic forwarding for ICNs.