• Journal of Industrial Technology
• /
• v.24 no.B
• /
• pp.177-186
• /
• 2004

The main bottleneck for a VOD system is bandwidth of storage or network I/O due to the high bandwidth requirements and long-lived nature of digital video. Patching is one of the most efficient techniques to overcome the bottleneck of the VOD system through the use of multicast scheme. In this paper, we propose a new patching scheme, P2P proxy patching, for improving the typical patching technique by jointly using the proxy prefix caching scheme and the P2P proxy. In our proposed scheme, each client play a role in a proxy for multicasting a regular stream to other clients that request the same stream. Due the use of the P2P proxy and the prefix caching, the server bandwidth is required significantly less than that of the typical patching technique. In the performance study, we show that our patching scheme can reduce the server bandwidth requirements compared with the existing patching techniques.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.1
• /
• pp.1-8
• /
• 1997

A wide class of networking application services, such as video teleconferencing, VOD, LAN bridging, and distributed data processing require multipoint communications. The essential component inteh network to achieve this is a multicast packet switch which is capable of packet replication and switching. In this paper, we propose an efficient mukticast addressing scheme using the smallest number of routing bits which is deterministic lower bound. The new scheme performs all point-to-multipoint connection in radix-2 tree ATM switch like banyan network. Also, we provide a simple radix-2 switch block diagram for achieving our algorithm. And we investigate several addressing schemes for implementing multicasting in radix-r tree ATM switch and evaluate several performance factors, such as complexity of the additional header bits, requirement of the internal speedup and complexity of the major hardware.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.1B
• /
• pp.39-45
• /
• 2006

In this paper, existing technology that uses broadcasting and multicasting IP addrsses at the wireless access network, based on Internet as a core network, is upgraded. By employing broadcasting service request by receivers, convergence of multicasting and broadcasting, and lower level filtering of broadcast data, the load and traffic of network, server, base station, and receiver is substantially reduced. The technology proposed in this paper could be useful for general broadcasting services, and especially optimum for LBS and Telematics services.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.1
• /
• pp.81-94
• /
• 1995

By intergrating technologies for protable computers, radio communications, and computer networking, the Land Mobile Computer Network(LMCN) is supposed to overcome the time and space limitation of present computer communication network. However, because the MHs(mobile hosts) do move any time, the network connectivity is often changed causing temporarily duplicated lost, or out-of-sequenced message delivery as well as frequent communications for maintainning the network connectivity. Previous works solved the problems through message flooding, used also in multicasting, resulting in high communication cost(i.e., number of communication messages). In this paper, new protocols for efficient mobility management and multicasting are proposed. The protocols define location update, handover, and multicasting procedure of a MH over a hierarchical LMCN architecture. The protocol specification is presented, and it is shown that the communication cost of the new protocols is superior to the existing ones in terms of the communication cost.

• 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 KIISE:Computing Practices and Letters
• /
• v.8 no.5
• /
• pp.598-606
• /
• 2002

We suggest a distributed communication and management methodology using PC to PC Query multicasting strategy for efficient management of medical images produced by DICOM(Digital Imaging and Communications in Medicine) Modalities. It is absolutely necessary to reduce strict degradation of PACS system due to large sire of medical images and their very high transport rates. DICOM PC to PC Component is composed of a Service Manager to execute requested queries, a Communication Manager to take charge of file transmission, and a DICOM Manager to manage stored data and system behavior Each Manager itself is a component to search for requested file by interaction or to transmit the file to other PCs. Distributed management and transformation of medical information based on PC to PC Query multicasting methodology will enhance performance of central server and network capacity, reducing overload on both. We organize three major components for system operation. Each component is implemented as Agent. Communication between agents uses XML encoded Agent Communication Language.

• Management Science and Financial Engineering
• /
• v.12 no.2
• /
• pp.63-69
• /
• 2006

To generate a multicast routing tree guaranteeing the quality of service (QoS), we consider the hop constrained Steiner tree problem and propose a new mathematical formulation for it, which contains fewer constraints than a known formulation. An efficient procedure is also proposed to solve the problem. Preliminary tests show that the procedure reduces the computing time significantly.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 1998.05a
• /
• pp.138-143
• /
• 1998

이동 컴퓨팅 환경은 휴대용 컴퓨터가 다른 곳으로 이동하여도 무선 전송 링크를 통하여 공간 제약이 없이 네트워크 접속을 유지할 수 있는 새로운 컴퓨팅 모델이다. 본 논문에서는 이동 컴퓨팅 환경에서 멀티캐스트 그룹에 속한 이동 호스트들에게 호스트의 위치에 관계없이 효율적으로 패킷을 전송하는 이동 멀티캐스팅 기법을 제시한다 이 기법은 기존의 Mobile IP에 근거한 알고리즘과는 달리 멀티캐스트 그룹에 속한 이동 호스트들은 멀티캐스트 주소로 구별이 되며, 멀티캐스트 그룹에 속한 호스트가 이동을 하면 멀티캐스트 분배 트리를 재구성한다. 이동 호스트로의 패킷 전송은 멀티캐스트 분배 트리에 속한 멀티캐스트 라우터로 분배되어 이동 호스트로 전달되게 된다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2006.05a
• /
• pp.1037-1040
• /
• 2006

This paper presents an efficient overlay multicast routing protocol (ROMP) and its architecture. ROMP using GPS and region map stands on the basis of scalable 2-tiered multicast architecture and maintains a global overlay multicast tree through reactive fashion. With this approach, the coarse-grain location-awareness for an efficient overlay multicasting and the determination of hot-spot area for efficient data delivery are feasible. The simulation results show that the localized control packets of ROMP prevent the overlay control packets from squandering the physical network resources.

• Journal of Institute of Control, Robotics and Systems
• /
• v.6 no.8
• /
• pp.623-628
• /
• 2000

Video-on-demand system in which users can request any video through the network at any time is made possible by rapid increase in network bandwidth and capacity of the media server. However true video-on-demand system cannot support all requests since bandwidth requirement is still too demanding. Therefore efficient bandwidth reduction algorithm is necessary. both the piggybacking method and the batching method are novel solutions that can provide more logical number of streams than the physical system can support. Of course each of them has its pros and cons. hence piggybacking with batching-by-size can take advantage of both the schemes. Some parameters such as the size of batch and the size of the catch-up window should be adjusted and order to maximize the bandwidth reduction for piggybacking with batching-by-size method. One of the most important parameters is decided optimally in this paper. Simulation shows that the optimized parameter can achieve considerable reductionand consequently remarkable enhancement in performance.