• The KIPS Transactions:PartC
• /
• v.16C no.5
• /
• pp.605-614
• /
• 2009

Despite its graceful bandwidth saving nature, IP multicast has not been successful in widely spreading and using. Challenging includes policy and technological issues such as inter-domain routing, multicast availability and reachability. Properly detecting and isolating the faults would be the first step to stabilize IP multicast. In this paper, we introduce a scalable multicast monitoring framework. To efficiently cope with multicast network and networking problems, it enlarges its monitoring scopes from collecting delivery statistics to verifying end-to-end multicast availability, reachability and interactivity. We carry out various networking experiments to verify the scalability and feasibility of the proposed framework.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.8 s.350
• /
• pp.15-24
• /
• 2006

We design and implement explicit mobile multicast, named XMIP, by enhancing explicit multicast for a great number of small group multicast communications. XMIP is a straightforward multicast mechanism without maintaining multicast states due to the inheritance from the explicit multicast based on a unicast routing. This research modifies and extends the functionality of each mobility agent of IETF Mobile IP for interworking XMIP XMIP Packets captured by an extended home agent are forwarded to each extended foreign agent through nested tunnels, named X-in-X tunnels, made by the binding table of the extended home agent. X-in-X tunneling mechanism can effectively solve the serious traffic concentration problems of Mobile IP multicast specifications. Finally heterogeneous mobile networks as an XMIP testbed including CDMA2000 1X EV-DO and WLAN are actually established, and a multi-user instant messenger system for small group communications is developed for verifying the feasibility of the proposed protocols.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.10B
• /
• pp.865-875
• /
• 2008

In this paper, we propose a reliable multicast scheme for the tactical wireless ad hoc network where the members share the situation and operation data. Our scheme consists of two phases to guarantee the reliability. During the dissemination phase, we utilizes an epidemic approach similar to gossip-based ad hoc routing. Then the group members interchange the message reception state information periodically so that they are able to recover missing packets from the other members. We evaluate the performance of our scheme through extensive simulations using the network simulator in comparison with other existing reliable multicast schemes in mobile ad hoc network. Our scheme shows higher packet delivery ratio regardless of the mobility and imposes much lower control overhead to the non-group members compared with the existing schemes.

• Convergence Security Journal
• /
• v.17 no.5
• /
• pp.87-92
• /
• 2017

MANET is a network composed itself because mobile nodes are connected wirelessly. It has been applied to various fields for group communication. However, the dynamic topology by the movement of the nodes causes routing failure frequently because it is difficult to maintain the position information of the nodes participating in the group communication. Also, it has a problem that network performance is decreased due to high overhead for managing information of member nodes. In this paper, we propose a multicast technique using location-based 2-tier virtual group that is flexible and reliable in management of member nodes. The network is composed of cellular zones and the virtual group is constructed using the location information of the nodes in the proposed technique. The virtual group management node is selected to minimize the overhead of location information management for member nodes in the virtual group. In order to improve the reliability for management of member nodes and multicast data transmission, it excludes the gateway node with low transfer rate when setting the route after the packet transmission rate of the member nodes is measured. The excellent performance of the proposed technique can be confirmed through comparative experiments with AMroute method and PAST-DM method.

• Journal of Korea Multimedia Society
• /
• v.6 no.7
• /
• pp.1231-1238
• /
• 2003

As the demand on multicast services increases to support the terminal mobility in the midst of the development of wireless mobile communication technology, many new methods have been studied. However, previous methods occur delay and packet loss during re-joining to multicast service group when moving mobile node. In this paper, we will propose a scheme that decreases packet loss using regional registration method. Proposed scheme modified signaling message of previous regional-registration and added caching. In case move to same GFA, we can prevent packet loss by keeping registration to FA until perfectly registration ends. Also, In case move to other GFA, we can reduce packet loss by using cache. Therefore, we can receive efficient multicast service.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.6
• /
• pp.1187-1193
• /
• 2003

The interest for IPv6, which is next generation IP, increases, while the difficulty for adopting it into IT industries also increases too. We also expect that Internet technologies develop on basis of All-IP networks, which include various heterogeneous networks. Therefore, it is necessary for network to support mobility and multicast capability to create applications with wide-variety. In this paper, we propose a new mobile multicasting protocol called Mobile IPv6 Multicast Protocol(MIMP). The proposed scheme satisfies no packet losses from roaming and optimal routing efficiency.

• Journal of KIISE:Information Networking
• /
• v.30 no.4
• /
• pp.513-519
• /
• 2003

In order to deliver multicast traffic efficiently, multicast routing and reliable transmission mechanisms are required. The reliable delivery implies that lost packets must be retransmitted, which in turn requires that transmitted packets be stored in a retransmission buffer. Therefore how to manage a retransmission buffer is important and, in this paper, we try to solve the problem of how many packets should be maintained in the buffer. Our proposed scheme, the timer-based buffer management (TBM), maintains only necessary amount of buffer based on the timer value calculated from the NAKs between the replier and receivers on a multicast tree and can adjust to the dynamic network conditions. By performing simulations, we show that TBM manages the buffer efficiently regardless of the error situation, network size, and so on.

• Journal of Communications and Networks
• /
• v.9 no.4
• /
• pp.383-393
• /
• 2007

We present a new network-layer architecture that provides generalized addressing. The forwarding infrastructure is independent of the addressing architecture, so multiple addressing architectures can be used simultaneously. We compare our solution with the existing Internet protocols for unicast and multicast services, given the address assignment used in the Internet. By means of an extensive simulation study, we determine the range of parameters for which the overhead costs(delay, state, and network load) of our service are comparable to those of the Internet.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.6 s.348
• /
• pp.9-22
• /
• 2006

When the legacy multicast routing protocols are adopted in If-based mobile core networks, there are some problems such as traffic injection from unnecessary sources, traffic overhead by group management and router performance degradation by large amount of multicast session information. In this paper, we propose a stateless multicast mechanism which has no need to maintain multicast information for session status and reduces redundant network overhead for maintaining multicast tree. In addition interworking with IGMPv3 gets rid of traffic from unnecessary sources which have no registration from receivers. The operations of essential components including a gateway node for interworking with the legacy Internet multicast network, a gateway node for transparency to radio access network and a intermediate node in mobile core networks, are definitely defined and the proposed communication architecture is completed. Finally we evaluate and approve the performance of the proposed architecture by means of well-designed network simulation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.3B
• /
• pp.305-313
• /
• 2004

Group multicast refers to the kind of multicast in which every member of a group is allowed to transmit data to the group. The goal of routing algorithms for group multicast is to construct a set of low cost multicast trees including all the group members with QoS (e.g., bandwidth) constraint. There have been several algorithms proposed: source tree and shared tree approaches. However, the latter approach has a low success rate in constructing a shared multicast tree, and the former approach suffers from high control overhead and low scalability as stoup size increases. In this paper, we present a heuristic algorithm which varies the number of multicast trees according to the network load. The simulation results show not only that our algorithm outperforms the shared tree approach in terms of the success rate, but also that it has lower control overhead than the source tree approach while guaranteeing the same success rate.