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 journalArticlepeer-review


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
Issue number5
Publication statusPublished - May 2004


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

ASJC Scopus subject areas

  • Signal Processing
  • Computer Graphics and Computer-Aided Design
  • Electrical and Electronic Engineering
  • Applied Mathematics


Dive into the research topics of 'P2PMM_router: A two-stage heuristic algorithm to peer-to-peer multicast routing problems in multihome networks'. Together they form a unique fingerprint.

Cite this