메뉴 건너뛰기




Volumn , Issue , 2003, Pages 467-472

DCMC - Delay-constrained multipoint communication with multiple sources

Author keywords

[No Author keywords available]

Indexed keywords

DELAY CONSTRAINTS; DESIGN ISSUES; MULTIPLE SOURCE; MULTIPOINT COMMUNICATIONS; MULTIPOINT PATH; PERFORMANCE ANALYSIS; SIMULTANEOUS TRANSMISSION; SOLUTION SPACE;

EID: 84869747270     PISSN: 15301346     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISCC.2003.1214162     Document Type: Conference Paper
Times cited : (14)

References (9)
  • 3
    • 0003037529 scopus 로고
    • Reducibility among combinatorial problems
    • Editors: R. Miller and J. Thatcher, New York, Plenum Press
    • Karp, R., Reducibility among Combinatorial Problems, Complexity of Computer Computations, Editors: R. Miller and J. Thatcher, New York, Plenum Press, pp. 85. 103, 1972
    • (1972) Complexity of Computer Computations , pp. 85-103
    • Karp, R.1
  • 5
    • 0032139255 scopus 로고    scopus 로고
    • An iterative algorithm for delay-constrained minimum-cost multicasting
    • August
    • Parsa, M., Zhu, Q. and Garcia-Luna-Acevez, J. J., An Iterative Algorithm for Delay-Constrained Minimum-Cost Multicasting, IEEE/ACM Transactions on Networking, Vol. 6, No. 4, pp. 461. 473, August 1998
    • (1998) IEEE/ACM Transactions on Networking , vol.6 , Issue.4 , pp. 461-473
    • Parsa, M.1    Zhu, Q.2    Garcia-Luna-Acevez, J.J.3
  • 9
    • 84883876255 scopus 로고    scopus 로고
    • An evaluation of multicast trees with multiple active cores
    • July
    • Zappala, D. and Fabbri, A., An Evaluation of Multicast Trees with Multiple Active Cores, Proceedings of ICN 2001, July 2001.
    • (2001) Proceedings of ICN , vol.2001
    • Zappala, D.1    Fabbri, A.2


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