메뉴 건너뛰기




Volumn 145, Issue 2, 1998, Pages 87-90

Lower bound for multimedia multicast routing

Author keywords

Lagrangcan relaxation; Lower bounds; Multicast trees; Multimedia communication; Network routing

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER NETWORKS; COMPUTER WORKSTATIONS; CONGESTION CONTROL (COMMUNICATION); HEURISTIC METHODS; TREES (MATHEMATICS);

EID: 0032050826     PISSN: 13502425     EISSN: None     Source Type: Journal    
DOI: 10.1049/ip-com:19981798     Document Type: Article
Times cited : (5)

References (13)
  • 1
    • 0027612181 scopus 로고
    • 'Multicast routing for multimedia communication'
    • KOMPELLA, V.P., PASQUALE, J.C., and POLYZOS, G.G.: 'Multicast routing for multimedia communication', IEEE/ACM Trims. Nein:, 1993, 1, (3), pp. 286-292
    • (1993) IEEE/ACM Trims. Nein , vol.1 , Issue.3 , pp. 286-292
    • Kompella, V.P.1    Pasquale, J.C.2    Polyzos, G.G.3
  • 2
    • 0030165858 scopus 로고    scopus 로고
    • 'Connection optimisation for two types of videoconferences'
    • LEUNG, Y.W., and YUM, T.S.: 'Connection optimisation for two types of videoconferences', IEE Proc. Commun., 1996, 143, (3), pp. 133-140
    • (1996) IEE Proc. Commun. , vol.143 , Issue.3 , pp. 133-140
    • Leung, Y.W.1    Yum, T.S.2
  • 3
    • 0029252010 scopus 로고
    • 'Video bandwidth allocation for multimedia teleconferences'
    • YUM, T.S., CHEN, M.S., and LEUNG, Y.W.: 'Video bandwidth allocation for multimedia teleconferences', IEEE Trans. Commun., 1995, 43, (2), pp. 457-465
    • (1995) IEEE Trans. Commun. , vol.43 , Issue.2 , pp. 457-465
    • Yum, T.S.1    Chen, M.S.2    Leung, Y.W.3
  • 6
    • 0027648958 scopus 로고
    • 'Metascheduling for continuous media'
    • ANDERSON, D.P.: 'Metascheduling for continuous media', ACM Trans. Comput. Syst., 1993, 11, (3), pp. 226-252
    • (1993) ACM Trans. Comput. Syst. , vol.11 , Issue.3 , pp. 226-252
    • Anderson, D.P.1
  • 7
    • 0007459114 scopus 로고
    • 'A source-based algorithm for delay-constrained minimum-cost multicasting
    • ZHU, Q., PARSA, M., and ACEVES, J.J.G.L.: 'A source-based algorithm for delay-constrained minimum-cost multicasting',Proc. IEEE INFOCOM, 1995, pp. 377-385
    • (1995) Proc. IEEE INFOCOM , pp. 377-385
    • Zhu, Q.1    Parsa, M.2    Aceves, J.J.3
  • 8
    • 34250246836 scopus 로고
    • 'A fast algorithm for Steiner trees'
    • KOU, L., MARKOWSKY, G., and HERMAN, L.: 'A fast algorithm for Steiner trees', Acta Inform., 1981, 15, pp. 141-145
    • (1981) Acta Inform. , vol.15 , pp. 141-145
    • Kou, L.1    Markowsky, G.2    Herman, L.3
  • 9
    • 0002554041 scopus 로고
    • 'Lagrangean relaxation for integer programming'
    • GEOFFRION, A.: 'Lagrangean relaxation for integer programming', Math. Program., 1974, 2, pp. 82-114
    • (1974) Math. Program. , vol.2 , pp. 82-114
    • Geoffrion, A.1
  • 11
    • 84987047540 scopus 로고
    • 'A dual algorithm for the constrained shortest path problem'
    • HANDLER, G.Y., and ZANG, I.: 'A dual algorithm for the constrained shortest path problem', Networks, 1980, 10, pp. 293310
    • (1980) Networks , vol.10 , pp. 293310
    • Handler, G.Y.1    Zang, I.2
  • 12
    • 0027886520 scopus 로고
    • 'A test problem generator for the Steiner problem in graphs'
    • KHOURY, B.N., PARDALOS, P.M., and DU, D.Z.: 'A test problem generator for the Steiner problem in graphs', ACM Trans. Math. Softn:, 1993, 19, (4), pp. 509-522
    • (1993) ACM Trans. Math. Softn , vol.19 , Issue.4 , pp. 509-522
    • Khoury, B.N.1    Pardalos, P.M.2    Du, D.Z.3
  • 13
    • 33746011635 scopus 로고    scopus 로고
    • Test problems for multimedia multicast routing
    • Department of Computing Studies, Hong Kong Baptist University
    • LEUNG, Y.W., and YANG, B.T.: 'Test problems for multimedia multicast routing'. Internal Report,' Department of Computing Studies, Hong Kong Baptist University, 1997
    • (1997) Internal Report
    • Leung, Y.W.1    Yang, B.T.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.