P2PMM_router: A two-stage heuristic algorithm to peer-to-peer multicast routing problems in multihome networks

Nobuo Funabiki, Jun Kawashima, Shoji Yoshida, Kiyohiko Okayama, Toru Nakanishi, Teruo Higashino

Research output: Contribution to journalArticle

Abstract

A variety of real-time multicast applications such as video conferences, remote lectures, and video-on-demand have become in commonplace with the expansion of broadband Internet services. Due to non-trivial problems in the IP multicast technology, the peer-to-peer multi-cast technology (P2P-multicast) has emerged as a practical implementation, although its network resource utilization is less efficient. A multihome network has the potential of alleviating this inefficiency by providing flexibility in communication path selections for each host with multiple gateways to the Internet. This paper has first formulated the P2Pmulticast routing problem in the multihome network, and has proved the NP-completeness of its decision problem. Then, a two-stage heuristic algorithm called P2PMM_router has been presented for this P2P Multicast Multihome-network routing problem. The first stage constructs an initial multicast routing tree from an optimum spanning tree by Prim algorithm, through satisfying the constraints. The second stage improves the tree by repeating partial modifications and constraint satisfactions. The extensive simulation results using random network instances support the effectiveness of our P2PMM_router.

Original languageEnglish
Pages (from-to)1070-1076
Number of pages7
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
VolumeE87-A
Issue number5
Publication statusPublished - May 2004

Fingerprint

Multicast Routing
Routing Problem
Heuristic algorithms
Peer to Peer
Router
Multicast
Routers
Heuristic algorithm
Internet
Video on demand
Network routing
Gateways (computer networks)
Communication
Video on Demand
NP-completeness
Constraint Satisfaction
Random Networks
Gateway
Spanning tree
Decision problem

Keywords

  • Heuristic algorithm
  • Multihome network
  • NP-complete
  • Peer-to-peer multicast
  • Real-time communication

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Hardware and Architecture
  • Information Systems

Cite this

P2PMM_router : A two-stage heuristic algorithm to peer-to-peer multicast routing problems in multihome networks. / Funabiki, Nobuo; Kawashima, Jun; Yoshida, Shoji; Okayama, Kiyohiko; Nakanishi, Toru; Higashino, Teruo.

In: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E87-A, No. 5, 05.2004, p. 1070-1076.

Research output: Contribution to journalArticle

@article{94b73a2502a747ee8c29b77476eef733,
title = "P2PMM_router: A two-stage heuristic algorithm to peer-to-peer multicast routing problems in multihome networks",
abstract = "A variety of real-time multicast applications such as video conferences, remote lectures, and video-on-demand have become in commonplace with the expansion of broadband Internet services. Due to non-trivial problems in the IP multicast technology, the peer-to-peer multi-cast technology (P2P-multicast) has emerged as a practical implementation, although its network resource utilization is less efficient. A multihome network has the potential of alleviating this inefficiency by providing flexibility in communication path selections for each host with multiple gateways to the Internet. This paper has first formulated the P2Pmulticast routing problem in the multihome network, and has proved the NP-completeness of its decision problem. Then, a two-stage heuristic algorithm called P2PMM_router has been presented for this P2P Multicast Multihome-network routing problem. The first stage constructs an initial multicast routing tree from an optimum spanning tree by Prim algorithm, through satisfying the constraints. The second stage improves the tree by repeating partial modifications and constraint satisfactions. The extensive simulation results using random network instances support the effectiveness of our P2PMM_router.",
keywords = "Heuristic algorithm, Multihome network, NP-complete, Peer-to-peer multicast, Real-time communication",
author = "Nobuo Funabiki and Jun Kawashima and Shoji Yoshida and Kiyohiko Okayama and Toru Nakanishi and Teruo Higashino",
year = "2004",
month = "5",
language = "English",
volume = "E87-A",
pages = "1070--1076",
journal = "IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences",
issn = "0916-8508",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "5",

}

TY - JOUR

T1 - P2PMM_router

T2 - A two-stage heuristic algorithm to peer-to-peer multicast routing problems in multihome networks

AU - Funabiki, Nobuo

AU - Kawashima, Jun

AU - Yoshida, Shoji

AU - Okayama, Kiyohiko

AU - Nakanishi, Toru

AU - Higashino, Teruo

PY - 2004/5

Y1 - 2004/5

N2 - A variety of real-time multicast applications such as video conferences, remote lectures, and video-on-demand have become in commonplace with the expansion of broadband Internet services. Due to non-trivial problems in the IP multicast technology, the peer-to-peer multi-cast technology (P2P-multicast) has emerged as a practical implementation, although its network resource utilization is less efficient. A multihome network has the potential of alleviating this inefficiency by providing flexibility in communication path selections for each host with multiple gateways to the Internet. This paper has first formulated the P2Pmulticast routing problem in the multihome network, and has proved the NP-completeness of its decision problem. Then, a two-stage heuristic algorithm called P2PMM_router has been presented for this P2P Multicast Multihome-network routing problem. The first stage constructs an initial multicast routing tree from an optimum spanning tree by Prim algorithm, through satisfying the constraints. The second stage improves the tree by repeating partial modifications and constraint satisfactions. The extensive simulation results using random network instances support the effectiveness of our P2PMM_router.

AB - A variety of real-time multicast applications such as video conferences, remote lectures, and video-on-demand have become in commonplace with the expansion of broadband Internet services. Due to non-trivial problems in the IP multicast technology, the peer-to-peer multi-cast technology (P2P-multicast) has emerged as a practical implementation, although its network resource utilization is less efficient. A multihome network has the potential of alleviating this inefficiency by providing flexibility in communication path selections for each host with multiple gateways to the Internet. This paper has first formulated the P2Pmulticast routing problem in the multihome network, and has proved the NP-completeness of its decision problem. Then, a two-stage heuristic algorithm called P2PMM_router has been presented for this P2P Multicast Multihome-network routing problem. The first stage constructs an initial multicast routing tree from an optimum spanning tree by Prim algorithm, through satisfying the constraints. The second stage improves the tree by repeating partial modifications and constraint satisfactions. The extensive simulation results using random network instances support the effectiveness of our P2PMM_router.

KW - Heuristic algorithm

KW - Multihome network

KW - NP-complete

KW - Peer-to-peer multicast

KW - Real-time communication

UR - http://www.scopus.com/inward/record.url?scp=2642533685&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=2642533685&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:2642533685

VL - E87-A

SP - 1070

EP - 1076

JO - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

JF - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

SN - 0916-8508

IS - 5

ER -