Fig 1 - uploaded by George Xylomenos
Content may be subject to copyright.
Datagrams from the Mobile Host (MH) are delivered directly to its Correspondent Host (CH), but datagrams from the CH to the MH must first go to the Home Agent (HA) which forwards them to the Foreign Agent (FA).
Source publication
We present alternative designs for efficiently supporting multicast for mobile hosts on the Internet. Methods for separately supporting multicasting and mobility along with their possible interactions are briefly described, and then various solutions to the combined problem are explored. We examine three different multicast delivery mechanisms and...
Context in source publication
Context 1
... these mechanisms, communication with the MH can proceed uninterrupted despite its mobility, using the MH's home address. Tunneling however results in suboptimal trian- gle routing (see Figure 1), because datagrams to the MH are delivered via its HA. Since the MH may move outside the FA's area at any time, there is no de-registration procedure. ...
Similar publications
In this short paper we present some applications of isometric transformation called rotation in the support software GeoGebra. Our goal is simple-on the separated examples of the geometry construction tasks to show how will be changed the count of their different solutions.
Citations
... As a result, a new development boom for IP mobile multicast based on PMIPv6 has been launched. At the same time, the mobile multicast technology generally focuses on the multicast receiver mobility [12] and the Internet community has made great efforts to support mobile receivers in multicast sessions [7]. Comparing with the multicast receiver mobility, there is less interest in mobile multicast senders. ...
Proxy Mobile IPv6 (PMIPv6) is proposed as a promising network-based mobility management protocol, which does not need any participation of mobile nodes. PMIPv6 does not support the multicast well and most of the current research concentrates on the mobile multicast receiver. However, the mobile multicast sender is also very important and challenging, which has not been addressed well. Therefore, in this paper we propose two efficient PMIPv6 based mobile multicast sender support schemes which are PMIP bidirectional tunneling (PMIP-BT) and PMIP direct routing (PMIP-DR). In the PMIP-BT, the multicast traffic can be delivered through the PMIPv6 bidirectional tunnel, while, in the PMIP-DR, the multicast data can be transmitted via an optimized direct multicast routing. Both of them can support the multicast sender mobility transparently enabled in the PMIPv6 networks. We evaluate the performance of the proposed schemes by theoretical analysis, and the numerical results show that the proposed schemes have a better performance in terms of the signaling cost than the current schemes. Meanwhile, the proposed schemes are also implemented on the test bed, and the experimental results not only verify the validity and feasibility of our proposed schemes, but also conclude the different scenarios to which they are applicable.
... Various solutions have been proposed which were either built on top of multicast routers, or conjointly managed by mobility anchors. Over the years, not any one of these dedicated multicast mobility management schemes was adopted in standardization work nor in practical deploymentexcept for the elementary approach of bidirectional tunneling of multicast traffic via the Home Agent [9]. Reasons for this disappointment must be considered twofold, first in the hesitant adoption of MIPv6, which is an end-node-centric operatoragnostic protocol. ...
Proxy Mobile IPv6 (PMIPv6) and its multicast extensions have been designed by the IETF as a deployment friendly mobility scheme. Although easy to implement, the basic multicast proxy solution suffers from unwanted delay and jitter due to suboptimal traffic flows. In this paper, we recap recent IETF work on peering extensions for multicast proxies and make the following two contributions. First we introduce the design and implementation of a highly flexible, open proxy that allows for dynamic reconfiguration at runtime. In particular, the system can support a variety of functional extensions including peering. Second we report on extensive performance measurements of proxy peering in LTE and UMTS type networks. Our findings indicate that a transparent deployment of the peering option significantly smoothes handovers and chokes delay variations throughout the access network.
... These protocols explain the two methods which offer services of multicasting to mobile nodes. One of those is a foreign agent based multicasting referred as remote-subscription and the other is a bidirectional tunneling which is a home agent-based multicast (Xylomenos and Polyzos, 1997; Chikarmane et al., 1998). As regards to MIPv6 an ordinary change has been made to focus mainly on multicast deliverance. ...
Problem statement: In the previous researches, steps were taken to resolve the problems of multicasting, after several discussions. Actually these issues were raised, while multicasting packets from Internet Protocol (IP) to Mobile Nodes (MN). On the other hand, there is very little concern about the problem of packet loss reduction. Sometimes the occurrence of multicast service chaos is ignored during handovers. Therefore in this study it has been tried to explain the optimal multicast technique for Mobile IPv6 (MIPv6) to diminish the required amendment to the existing fast handover. Approach: An alternate method is suggested in Fast handover for MIPv6 (FMIPv6) to lessen the packet losses during handovers, before tunneling. Based on the qualities of the multicast subscription techniques for the Mobile IPv6 (MIPv6), multicast upholds method for FMIPv6. MIPv6 in general comprise two types of multicasting techniques, which are related to Home Agent (HA) and Foreign Agent (FA). These techniques help the MN to obtain the packets in roaming location referred as Foreign Network (FN), which is being forwarded by the Core Network (CN). But due to the handover latency problem MN have to experience packet loss while switching between any two Access Routers (AR). A protocol has been designed to conquer the issue of packet loss in MIPv6. Results and Conclusion: This protocol can be used during joining process in MIPv6 before tunneling to eliminate the IP connectivity time. This implementation allows a mobile node to be connected more quickly at a fresh point of connection, when that mobile node moves with less packet losses.
... Seamless support for mobile multicast senders requires efforts significantly exceeding unicast mobility management schemes. The MIPv6 standard proposes bi-directional tunneling through the home agent as a generally applicable, minimal multicast support for mobile senders and listeners as introduced by [36]. In this approach, the mobile multicast source (MS) always uses its Home Address (HoA) for multicast operations. ...
Mobility is considered a key technology of the next generation Internet and has been standardized within the IETF. Rapidly emerging multimedia group applications such as IPTV, MMORPGs and video conferencing increase the demand for mobile group communication, but a standard design of mobile multicast is still awaited. The open problem poses significant operational and security challenges to the Internet infrastructure. This paper introduces a protocol framework for authenticating multicast sources and securing their mobility handovers. Its contribution is twofold: At first, the current mobile multicast problem and solution spaces are summarized from the security perspective. At second, a solution to the mobile source authentication problem is presented that complies to IPv6 mobility signaling standards. Using an autonomously verifiable one-way authentication based on cryptographically generated addresses, a common design is derived to jointly comply with the mobile any source and source specific multicast protocols that are currently proposed. This light-weight scheme smoothly extends the unicast enhanced route optimization for mobile IPv6 and adds only little overhead to multicast packets and protocol operations.
... Statically Rooted Distribution Trees The MIPv6 standard proposes bi-directional tunneling through the home agent as a minimal multicast support for mobile senders and listeners as introduced by [21]. In this approach, the mobile multicast source (MS) always uses its Home Address (HoA) for multicast operations. ...
Mobility is considered a key technology of the next generation Internet and has been standardized within the IETF. Rapidly emerging multimedia group applications such as IPTV, MMORPGs and video conferencing increase the demand for mobile group communication, but a standard design of mobile multicast is still awaited. The traditional Internet approach of Any Source Multicast (ASM) routing remains hesitant to spread beyond walled gardens, while the simpler and more selective Source Specific Multicast (SSM) is expected to globally disseminate to many users and services. However, mobility support for Source Specific Multicast is still known to be a major open problem. In this paper we introduce the Enhanced Tree Morphing (ETM), an optimized multicast routing protocol for transforming (morphing) source specific distribution trees into optimal trees rooted at a relocated source. Following up on previous results for the initial Tree Morphing, we present enhancements that lead to a simpler protocol with significantly optimized performance values in both, forwarding performance and protocol robustness. Extensive evaluations based on real-world topology data are part of this work. Full Text at Springer, may require registration or fee
... MIPv6 standard proposes bi-directional tunneling through the home agent as a minimal multicast support for mobile senders and listeners as introduced by [31]. In this approach, the mobile multicast source (MS) always uses its Home Address (HoA) for multicast operations. ...
Multimedia group communication emerges to focal interest at mobile devices, enriching voice or video conferencing and complex collaborative environments. The Internet uniquely provides the benefit of scalable, dynamic group communication services, vitally aiding commonly limited mobile terminals. The traditional Internet approach of Any Source Multicast (ASM) routing, though, remains hesitant to spread beyond limited, controlled environments. It is widely believed that simpler and more selective mechanisms for group distribution in Source Specific Multicast (SSM) will globally disseminate to many users of multicast infrastructure and services. Mobility management for the recent SSM standard is under debate -- SSM group session initiation up until now remains unsupported by the Session Initiation Protocol (SIP). In this paper we present straightforward extensions to SIP for negotiating SSM sessions. SIP protocol spec- ifications and semantic are compatibly extended without adding new SIP methods. We will introduce a multimedia communication software with distributed architecture as implementation reference. Furthermore mobility management of the underlying routing layer is discussed and evaluated on grounds of real-world Internet topologies.
... Statically rooted distribution trees. The MIPv6 standard proposes bi-directional tunneling through the home agent as a minimal multicast support for mobile senders and listeners as introduced by Xylomenos and Polyzos [39]. In this approach, the mobile multicast source (MS) always uses its Home Address (HoA) for multicast operations. ...
Source Specific Multicast (SSM) promises a wider dissemination of group distribution services than Any Source Multicast, as it relies on simpler routing strategies with reduced demands on the infrastructure. However, SSM is designed for á priori known and changeless addresses of multicast sources and thus withstands any easy extension to mobility. Up until now only few approaches arose from the Internet research community, leaving SSM source mobility as a major open problem. The purpose of this paper is twofold. At first we analyze characteristic properties of multicast shortest path trees evolving under source mobility. Analytically and by stochastic simulations we derive measures on the complexity of SSM routing under source mobility.
At second we introduce a straightforward extension to multicast routing for transforming (morphing) source specific delivery trees into optimal trees rooted at a relocated source. All packet forwarding is done free of tunneling. Multicast service disruption and signaling overhead for the algorithms remain close to minimal. Further on we evaluate the proposed scheme using both, analytical estimates and stochastic simulations based on a variety of real-world Internet topology data. Detailed comparisons are drawn to bi-directional tunneling, as well as to proposals on concurrent distribution trees.
... 114 Many researches are now being conducted in this area [7]. 115 Xylomenos and Polyzos [8] [12] have proposed a retransmission method, using a given 147 middle node, that integrates negative-acknowledgment (NACK) 148 requests from multiple hosts, selects the packets for retransmis-149 sion, and repeats both of these. The method gradually reduces 150 the number of undelivered packets. ...
A number of mobile hosts (MHs) might be densely grouped in an area caused by traffic congestion. In such a situation, the greater part of the MHs will require useful data, such as traffic information, parking information, and other driving-related information. Simultaneous data-transmission broadcasts using a common link are regarded as a suitable medium to distribute this location-dependent information. However, there is no guarantee that MHs can finish receiving the information completely within a limited time. In this paper, we propose a reliable multicast system that consists of a multicast-group-management method called "Advanced-Join (AJ) system", a data-retransmission method, and a data-recovery-processing method. A "base station (BS) multicast group" is defined as the set of BSs in a certain area to which MHs belonging to the same multicast group connect. The AJ system allows a BS that is a member of a BS multicast group to make consolidated join requests to a multicast group on behalf of its MHs. The data-retransmission method determines and processes retransmission data by coordinating retransmission requests from two or more MHs that are members of the same multicast group. The data-recovery-processing method performs interactive data recovery between BSs belonging to the same BS multicast group. By controlling the members of the BS multicast group according to the movement of MHs and deciding the retransmission packets, it is expected that message traffic for the multicast-group management will be reduced, and packet loss during an MHs' movement between BSs will be eliminated. Evaluation results show that about 86.8% of MHs complete data reception with the proposed system, while only two MHs complete reception with the simple broadcast system. In addition, the proposed system with the data-retransmission method needs only two-thirds of BSs compared with that without retransmissions.
... In case of multicast protocols that utilizes a packets' source such as DVMRP, MOSPF, or PIM-SM (with shortest path tree mode), multicast packets will be discarded on the IP forwarding engine in a multicast router since a MN's multicasts are expected from the link used to reach its CoA i , but when the MN moves to a new network, its datagrams will arrive on many routers via unexpected links. This problem is called Reverse Path Forwarding (RPF) Problem [9], [26] In the proposed scheme, packets sent from the MN do not suffer from RPF problem. Packets sent from CoA i+1 will travel to PRs that locates en route from AR i+1 and AR i according to the (AR i+1 , G) multicast tree, then travel to receivers over the (AR i , G) multicast tree. ...
To support multicast over mobile IP networks, the IETF proposed two schemes, namely bi-directional tunneling (MIP-BT) and remote subscription (MIP-RS). MIP-BT provides mobility by establishing bi-directional tunnel from home agent to mobile node's care-of address. Although it does not require multicast tree reconstruction, it suffers from redundant routing that causes packet delivery delay and network bandwidth consumption. On the other hand, MIP-RS provides mobility by reconstructing multicast tree when mobile node enters a foreign network. Although MIP-RS provides shortest multicast routing path, it requires the reconstruction of entire multicast tree in case of source mobility and causes service disruption during the process of handover. To cope with those problems, we propose new source mobility scheme that enjoys the advantages of MIP-RS and provides seamless handover with the help of proxy router, which assists handover by swapping network addresses and conducting packet forwarding. We examine the deployment issues of the proposed scheme over the Internet and evaluate the proposed scheme from the viewpoint of routing distance and network bandwidth consumption through simulation experiments with various parameters, and then clarify the effectiveness and efficiency of the proposed scheme
... El-Gendy et al. [14] present a model based on the two-tiered approach for providing group communication. The multicast problem for mobile hosts has been studied in [28], [1]. ...
This paper presents several distributed algorithms that cause a token to continually circulate through all the nodes of a mobile ad hoc network. An important application of such algorithms is to ensure total order of message, delivery in a group communication service. Some of the proposed algorithms are aware of, and adapt to changes in the ad hoc network topology. When using a token circulation algorithm, a round is said to complete when every node has been visited at least once. Criteria for comparing the algorithms include the average time, required to complete a round, number of bytes sent per round, and number of nodes visited per round. Comparison between the proposed algorithms is performed using simulation results obtained from a detailed simulation model (with ns-2 simulator). We also give a rigorous worst-case analysis of the proposed LR algorithm, which gives the best overall performance in the simulation.
