• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.9
• /
• pp.2415-2421
• /
• 1996

This paper describes implementation and performance evaluation of XTP(Xpress Transport Protocol) onthe Windows NT for multicasting in high-speed communication networks. We designed the protocol byan event-driven method and implemented it in form of network driver in a kernel for performace enhancement. Various applications program are used for its functional test and comparison with the TCP protocol.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.2
• /
• pp.283-288
• /
• 2005

Packet transmission and independent addressing in the mobile environments are very similar to the ones in the multicasting environment. So, in this paper, we propose a new scheme about how to manage the multicasting group and to set the communication path in the mobile environment by applying two-level addressing mode, which is similar to mobile If, for location-independent address setting. And we propose the smooth handoff scheme that minimizes the handoff delay for mobile multimedia services. To check the performance of our proposed scheme, we modified the NS-2 network simulator and as a result, we showed that our proposed scheme is better than other techniques in terms of handoff delay and transmitted packets' throughput.

• International journal of advanced smart convergence
• /
• v.1 no.2
• /
• pp.1-11
• /
• 2012

IP-based Wireless Sensor Networks (IP-WSNs) are gaining importance for their broad range of applications in health care, home automation, environmental monitoring, industrial control, vehicle telematics, and agricultural monitoring. In all these applications, a fundamental issue is the mobility in the sensor network, particularly with regards to energy efficiency. Because of the energy inefficiency of network-based mobility management protocols, they can be supported via IP-WSNs. In this paper, we propose a network-based mobility-supported IP-WSN protocol called mSFP, or the mSFP: "Multicasting-supported Inter-Domain Mobility Management Scheme in Sensor-based Fast Proxy Mobile IPv6 Networks". Based on [8,20], we present its network architecture and evaluate its performance by considering the signaling and mobility cost. Our analysis shows that the proposed scheme reduces the signaling cost, total cost, and mobility cost. With respect to the number of IP-WSN nodes, the proposed scheme reduces the signaling cost by 7% and the total cost by 3%. With respect to the number of hops, the proposed scheme reduces the signaling cost by 6.9%, the total cost by 2.5%, and the mobility cost by 1.5%. With respect to the number of IP-WSN nodes, the proposed scheme reduces the mobility cost by 1.6%.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.403-407
• /
• 1999

In this paper we present an architecture, implementation, and performance evaluation of an adaptive communication system (ACS) for wide-area ATM clusters. Our approach capitalizes on thread-based programming model to overlap computation and communication and develop a dynamic message-passing environment with separate data and control paths. This leads to a flexible and adaptive message-passing environment that can support multiple flow control, error control, and multicasting algorithms. We show the performance of ACS applications and compare them with p4, PVM, and MPI applications.

• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.6
• /
• pp.265-278
• /
• 2013

With the recent advancements in various wireless communication technologies, the importance of mobile multicasting is coming to the fore, in an effort to use network resources more efficiently. In the past, when various mobile IP-based multicast techniques were proposed, the focus was put on the costs needed for network delivery for providing multicast services, as well as on minimizing the multicast handover delay. For techniques using MIPv6 (Mobile IPv6), a host-based mobility management protocol, however, it is fundamentally difficult to resolve the problems of handover delay and tunnel convergence. To resolve these problems, a network-based mobility management protocol called PMIPv6 (Proxy Mobile IPv6) was standardized. Although performance is improved in PMIPv6 over MIPv6, it still suffers from the problems of handover delay and tunnel convergence. In this paper, to overcome these limitations, a technique called LFH (Low-cost and Fast Handoff) is proposed for fast and low-cost mobility management with multicasting support in PMIPv6 networks. To reduce the interactions between the complex multicast routing protocol and the multicast messages, a simplified proxy method called MLD (Multicast Listener Discovery) is implemented and modified. Furthermore, a TCR (Tunnel Combination and Reconstruction) algorithm was used in the multicast handover procedure within the LMA (Local Mobility Anchor) domain, as well as in the multicast handover procedure between domains, in order to overcome the problem of tunnel convergence. As a result, it was found that LFH has reduced multicast delay compared to other types of multicast techniques, and that it requires lower costs as well.

• Journal of KIISE:Databases
• /
• v.29 no.6
• /
• pp.502-512
• /
• 2002

Most of previous replication schemes assume lazy schemes, which asynchronously propagate replica updates to other nodes after the updating transaction commits. While lazy schemes are novel in the sense that they can resolve high deadlock frequencies of eager schemes, they suffer from the fact that users should be responsible for the data consistency. Recently replication schemes based on the messaging order of group communication have been studied. They can reduce the deadlock frequencies using the messaging order, but they have another problem of increasing execution overhead of aborted transactions at high degree of concurrency. This is because the sender node validates global serializability after multicasting replica update messages to other nodes. In this paper, we propose an efficient eager replication scheme for reducing the number of messaging and overhead of aborted transactions significantly. The proposed scheme validates any conflicts before multicasting and does not multicast when there is any conflict; hence, it can exploit performance improvement by alleviating the message traffic for replica update or by reducing the number of disk accesses and locking delay due to aborted transactions.

• Journal of KIISE:Databases
• /
• v.29 no.6
• /
• pp.500-500
• /
• 2002

Most of previous replication schemes assume lazy schemes, which asynchronously propagate replica updates to other nodes after the updating transaction commits. While lazy schemes are novel in the sense that they can resolve high deadlock frequencies of eager schemes, they suffer from the fact that users should be responsible for the data consistency. Recently replication schemes based on the messaging order of group communication have been studied. They can reduce the deadlock frequencies using the messaging order, but they have another problem of increasing execution overhead of aborted transactions at high degree of concurrency. This is because the sender node validates global serializability after multicasting replica update messages to other nodes. In this paper, we propose an efficient eager replication scheme for reducing the number of messaging and overhead of aborted transactions significantly. The proposed scheme validates any conflicts before multicasting and does not multicast when there is any conflict; hence, it can exploit performance improvement by alleviating the message traffic for replica update or by reducing the number of disk accesses and locking delay due to aborted transactions.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.10
• /
• pp.55-63
• /
• 2007

Multicast is an efficient transport mechanism for community communications and MANET is recently regarded as a promising solution for support ubiquitous computing as an underlying network technology. However, it is hard to deploy multicast mechanism into MANET owing to scarce resources in wireless networks and unpredictable changes in network topology. Several multicast mechanisms have been proposed in the literature to overcome the limitations. Especially, overlay multicasting schemes present several advantages over network based multicasting schemes. Yet, the overlay multicasting schemes still introduce redundant data transmissions that waste network bandwidth and battery of relay nodes. As a result the performance of the network is degraded. To reduce the redundancy, we propose an efficient way to construct an overlay structure as a multicast data delivery tree that utilizes a branch node which belongs to the tree. By using network simulation, we show that the proposed scheme presents higher packet delivery ratio and lower transmission cost than previously proposed schemes.

• KIPS Transactions on Computer and Communication Systems
• /
• v.1 no.2
• /
• pp.87-98
• /
• 2012

In recent years, there are many data and multimedia services that are supported by WiFi-enabled mobile devices. As a result, the demand for the ability to connect to the Internet anywhere is rapidly increasing and network infrastructure is becoming increasingly important. The design of cost-efficient network mobility (NEMO) protocol is intended to reduce the demand for limited wired/wireless network bandwidth at the signaling of mobility support and packet delivery operations. In this paper, we propose a cost-effective inter-LMA domain mobility management scheme which provides fast handover with multicasting support in NEMO environments. And our Fast PR-NEMO scheme is compared with N-PMIPv6, rNEMO, and PR-NEMO. In conclusion, our proposed scheme shows the best performance in terms of location updating cost, and packet tunneling cost.

• Journal of Internet Computing and Services
• /
• v.5 no.2
• /
• pp.75-84
• /
• 2004

Geocasting, a variant of the conventional multicasting problem, is one of communication type in which the data packets are delivered to a group of all nodes within a specified geographical region (i.e., the geocasting region) and is called location-based multicasting(LBM)(l). An Ad-hoc network is a dynamically reconfigurable and temporary wireless network where all mobile devices using batteries as energy resources cooperatively maintain network connectivity without central administration or the assistance of base stations. Consequently, the technique to efficiently consume the limited amounts of energy resources is an important problem so that the system lifetime is maximized. In this paper, we propose a LBPA(Location-Based Power Aware) geocasting algorithm that selects energy-aware neighbor to route a packet towards the target region In Ad-hoc network environments. The method Is such that the energy consumption is balanced among the nodes in proportion to their energy reserves. Through the simulations, the proposed LBPA algorithm shows better results, that is, as good as 40% on the average over the conventional LBM algorithm in terms of the network lifetime.