• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권12호
• /
• pp.3117-3132
• /
• 2012

The tree topology in multicast systems has high transmission efficiency, low latency, but poor resilience to node failures. In our work, some nodes are selected as backbone nodes to construct a tree-like core overlay. Backbone nodes are reliable enough and have strong upload capacity as well, which is helpful to overcome the shortcomings of tree topology. The core overlay is organized into a spanning tree while the whole overlay is of mesh-like topology. This paper focuses on improving the performance of the application-layer multicast overlay by optimizing the core overlay which is periodically adjusted with the proposed optimization algorithm. Our approach is to construct the overlay tree based on the out-degree weighted reliability where the reliability of a node is weighted by its upload bandwidth (out-degree). There is no illegal solution during the evolution which ensures the evolution efficiency. Simulation results show that the proposed approach greatly enhances the reliability of the tree-like core overlay systems and achieves shorter delay simultaneously. Its reliability performance is better than the reliability-first algorithm and its delay is very close to that of the degree-first algorithm. The complexity of the proposed algorithm is acceptable for application. Therefore the proposed approach is efficient for the topology optimization of a real multicast overlay.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2003년도 추계종합학술대회
• /
• pp.912-915
• /
• 2003

최근 대두되는 네트워크 게임이나 인터넷 생방송 둥의 각종 그룹 통신응용을 지원하기 위해선 IP 멀티캐스트가 지원되어야 한다. 하지만 IP 멀티캐스트를 적용하기 위해선 해결되어야 할 문제점들로 인하여 현재의 인터넷에서는 적용되지 못하고 있다. 오버레이 멀티캐스트 기술은 IP 멀티캐스트가 도입되지 않은 현재의 유니캐스트 기반 인터넷 환경에서 그룹 통신을 보다 효율적으로 제공해 줄 수 있는 메커니즘으로, 최근 많은 연구가 진행되고 있다. 본 고에서는 이들 오버레이 멀티캐스트 기술을 보다 체계적으로 분석한다.

• Journal of Communications and Networks
• /
• 제18권3호
• /
• pp.446-459
• /
• 2016

In this paper, we propose virtual direction multicast (VDM) for video multicast applications on peer-to-peer overlay networks. It locates the end hosts relative to each other based on a virtualized orientation scheme using real-time measurements. It builds multicast tree by connecting the nodes, which are estimated to be in the same virtual direction. By using the concept of directionality, we target to use minimal resources in the underlying network while satisfying users' quality expectations. We compare VDM against host multicast tree protocol.We simulated the protocol in a network simulator and implemented in PlanetLab. Results both from simulation and PlanetLab implementation show that our proposed technique exhibits good performance in terms of defined metrics.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권6호
• /
• pp.1586-1605
• /
• 2012

With the prevalence of multimedia applications and the potential commercial usage of Mobile Ad hoc Networks (MANETs) in group communications, Quality of Service (QoS) support became a key requirement. Recently, some researchers studied QoS multicast issues in MANETs. Most of the existing QoS multicast routing protocols are designed with flat topology and small networks in mind. In this paper, we investigate the scalability problem of these routing protocols. In particular, a Position-Based QoS Multicast Routing Protocol (PBQMRP) has been developed. PBQMRP builds a source multicast tree guided by the geographic information of the mobile nodes, which helps in achieving more efficient multicast delivery. This protocol depends on the location information of the multicast members which is obtained using a location service algorithm. A virtual backbone structure has been proposed to perform this location service with minimum overhead and this structure is utilized to provide efficient packet transmissions in a dynamic mobile Ad hoc network environment. The performance of PBQMRP is evaluated by performing both quantitative analysis and extensive simulations. The results show that the used virtual clustering is very useful in improving scalability and outperforms other clustering schemes. Compared to On-Demand Multicast Routing Protocol (ODMRP), PBQMRP achieves competing packet delivery ratio and significantly lower control overhead.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제5권4호
• /
• pp.741-762
• /
• 2011

Recently, multicast routing protocols become increasingly important aspect in Mobile Ad hoc Networks (MANETs), as they effectively manage group communications. Meanwhile, multimedia and real-time applications are becoming essential need for users of MANET. Thus it is necessary to design efficient and effective Quality of Service (QoS) multicast routing strategies. In this paper, we address the scalability problem of multicast routing protocols to support QoS over MANETs. In particular, we introduce a Position-Based QoS Multicast Routing Protocol (PBQMRP). Basically, the protocol based on dividing the network area into virtual hexagonal cells. Then, the location information is exploited to perform efficient and scalable route discovery. In comparison with other existing QoS multicast routing protocols, PBQMRP incurs less control packets by eliminating network flooding behavior. Through simulation, the efficiency and scalability of PBQMRP are evaluated and compared with the well-known On-Demand Multicast Routing Protocol (ODMRP). Simulation results justify that our protocol has better performance, less control overhead and higher scalability.

• Journal of Communications and Networks
• /
• 제12권6호
• /
• pp.577-581
• /
• 2010

We introduce a novel packet retransmission technique which improves the efficiency of automatic retransmission query (ARQ) protocols in the context of satellite broadcast/multicast systems. The proposed coded ARQ technique, similarly to fountain coding, performs transmission of redundant packets, which are made by linear combinations of the packets composing the source block. Differently from fountain codes, the packets for the linear combinations are selected on the basis of the retransmission requests coming from the user terminals. The selection is performed in a way that, at the terminals, the source packets can be recovered iteratively by means of simple back-substitutions. This work aims at providing a simple and efficient alternative to reliable multicast protocols based on erasure correction coding techniques.

• 한국통신학회논문지
• /
• 제29권8A호
• /
• pp.937-941
• /
• 2004

본 논문은 유무선 통합 환경에서 효과적인 멀티캐스트를 위한 라우팅 알고리즘을 제안한다. 새로운 알고리즘은 Agent내에 내장된 두 가지 버퍼(Storage_Buffer 및 Provisional_Buffer)를 이용하여 모바일 노드가 이동할 때 패킷의 손실을 방지할 수 있으며, JoinRequest메시지와 JoinAccept메시지를 이용하여 동적으로 멀티캐스트 트리 구조를 조절할 수 있다. 시뮬레이션 결과 새로운 알고리즘은 가장 절약된 대역폭으로 지연이 비교적 작은 멀티캐스트 트리를 구성할 수 있음을 증명하였다.

• 한국통신학회논문지
• /
• 제22권11호
• /
• pp.2477-2487
• /
• 1997

In this paepr, we propose a dynamic multicast routin algorithm for constructing the delay-constrained minimal spanning tree in the VP-based ATM networks, in which we consider the effiiciency enen in the case wheree the destination dynamically joins/departs the multicast connection. For constructing the delay-constrained spanning tree, we frist generate a reduced network consisting of only VCX nodes from a given ATM network, originally consisting of VPX/VCX nodes. Then, we obtain the delay-constrained spanning tree with a minimal tree cost on the reduced network by using our proposed heuristic algorithm. Through numerical examples, we show that our dynamic multicast routing algorithm can provide an efficient usage of network resources when the membership nodes frequently changes during the lifetime of a multicast connection. We also demonstrate the more cost-saving can be expected in dense networks when applyingour proposed algorithm.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2003년도 추계종합학술대회
• /
• pp.924-927
• /
• 2003

최근 대두되는 네트워크 게임이나 인터넷 생방송 등의 각종 그룹 통신응용을 지원하기 위해선 IP 멀티캐스트가 지원되어야 한다. 하지만 IP 멀티캐스트를 적용하기 위해선 해결되어야 할 문제점들로 인하여 현재의 인터넷에서는 적용되지 못하고 있다. RMCP는 현재의 유니캐스트 기반 인터넷 환경에서 그룹 통신을 보다 효율적으로 제공해 줄 수 있는 메커니즘으로써, IP 멀티캐스트 환경이 구축되지 않더라도 그룹 데이터를 다수의 수신자들에게 효율적으로 전달하는 방법이다. 본 고에서는 RMCP 프로토콜 개요와 구현 및 APAM 환경에서 한-일간 그룹 통신을 통한 검증을 다루도록 한다.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2004년도 봄 학술발표논문집 Vol.31 No.1 (A)
• /
• pp.430-432
• /
• 2004

Multicasting is an efficient means of one to many (or many to many) communications. Due to the frequent and unpredictable topology changes, multicast still remains as challenge and no one-size-fits-all protocol could serve all kinds of needs in ad hoc network. Protocols and approaches currently proposed on this issue could be classified mainly into four categories, tree-based, meshed-based, statelessness and hybrid. In this article, we borrow the concept of Eulerian ring in graph theory and propose a novel ring-based multicast framework--Hierarchical Eulerian Ring-Oriented Multicast Architecture (HEROMA) over wireless mobile Ad hoc network. It is familiar with hybrid protocol based on mesh and tree who concentrates on efficiency and robustness simultaneously. Architecture and recovery algorithm of HEROMA are investigated in details. Simulation result is also presented, which show different level of improvements on end-to-end delay in scenario of small scale.