메뉴 건너뛰기




Volumn , Issue , 2001, Pages 117-128

Constructing end-to-end paths for playing media objects

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER ARCHITECTURE;

EID: 84962183186     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/OPNARC.2001.916844     Document Type: Conference Paper
Times cited : (16)

References (15)
  • 1
    • 84962164262 scopus 로고    scopus 로고
    • Computer Science Division, University of California, Berkeley
    • Ninja Project. Computer Science Division, University of California, Berkeley, http://ninja.cs.berkeley.edu/.
  • 2
    • 0032178368 scopus 로고    scopus 로고
    • An Active Service Framework and its Application to Real-time Multimedia Transcoding
    • August-September
    • E. Amir, S. McCanne, and R. Katz. An Active Service Framework and its Application to Real-time Multimedia Transcoding. In Proceedings of the ACM SIGCOMM '98 Conference, pages 178-189, August-September 1998.
    • (1998) Proceedings of the ACM SIGCOMM '98 Conference , pp. 178-189
    • Amir, E.1    McCanne, S.2    Katz, R.3
  • 4
    • 0032206931 scopus 로고    scopus 로고
    • An Overview of Quality-of-Service Routing for the Next Generation High-Speed Networks; Problems and Solutions
    • November-December
    • S. Chen and K. Nahrstedt. An Overview of Quality-of-Service Routing for the Next Generation High-Speed Networks; Problems and Solutions. IEEE Network Magazine, Special Issue on Transmission and Distribution of Digital Video, 12(6):64-79, November-December 1998.
    • (1998) IEEE Network Magazine, Special Issue on Transmission and Distribution of Digital Video , vol.12 , Issue.6 , pp. 64-79
    • Chen, S.1    Nahrstedt, K.2
  • 7
    • 0007963366 scopus 로고    scopus 로고
    • University of Cambridge
    • A. Hopper. Sentient Computing. University of Cambridge and AT&T Laboratories Cambridge Ltd. http://www.uk.research.att.com/abstracts.html.
    • Sentient Computing
    • Hopper, A.1
  • 9
    • 0032684907 scopus 로고    scopus 로고
    • A k-Best Paths Algorithm for Highly Reliable Communication Networks
    • April
    • S.-W. Lee and C.-S. Wu. A k-Best Paths Algorithm for Highly Reliable Communication Networks. IEICE Transactions on Communications, E82-B(4):586-590, April 1999.
    • (1999) IEICE Transactions on Communications , vol.E82-B , Issue.4 , pp. 586-590
    • Lee, S.-W.1    Wu, C.-S.2
  • 12


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