An Algorithm of Constructing Multiple Tree for Group Multicast with Bandwidth Constraint |
구봉규
(KT 기술연구소 네트워크 서비스 개발팀)
박태근 (포항공과대학교 컴퓨터공학과 네트워크 및 분산시스템 연구실) 김치하 (포항공과대학교 컴퓨터공학과 네트워크 및 분산시스템 연구실) |
1 |
A fast algorithm for Steiner trees
/
DOI |
2 |
/
|
3 |
An aproximate solution for the Steiner problem in graphs
/
|
4 |
A group multicast routing algorithm by using multip minumum Steiner trees
/
DOI ScienceOn |
5 |
Core based trees(CBT version 2) multicast routing : protocol specification
/
|
6 |
Multicast Communication on Network Computers
/
|
7 |
On finding feasible solutions to the group multicast routing problem
/
|
8 |
An efficient algorithm for group multicast routing with bandwidth reservation
/
|
9 |
An efficient Delay-Constrained Multicast Routing Algorithm
/
|
10 |
Constructing shared-tree for group multicast with QoS constraints
/
|
11 |
Multicast routing and its QoS extensions: problems, algorithms and protocols
/
DOI ScienceOn |
12 |
Routing of multipoint connections
/
DOI ScienceOn |
13 |
How bad is naive multicast routing
/
|
14 |
Steiner tree problems
/
DOI |