메뉴 건너뛰기




Volumn 13, Issue 5, 2005, Pages 1146-1159

A scalable approach to the partition of QoS requirements in unicast and multicast

Author keywords

Multicast; Performance dependent costs; Quality of service (QoS) partition; Resource allocation; Routing

Indexed keywords

COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; MULTICASTING; OPTIMIZATION; QUALITY OF SERVICE; RESOURCE ALLOCATION; SET THEORY;

EID: 28044466933     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2005.857122     Document Type: Article
Times cited : (9)

References (10)
  • 1
    • 0003872064 scopus 로고    scopus 로고
    • "An Architecture for Differentiated Services - RFC no. 2475"
    • Internet Engineering Task Force, Dec
    • S. Blake, "An Architecture for Differentiated Services. - RFC no. 2475," Internet Engineering Task Force, Dec. 1998.
    • (1998)
    • Blake, S.1
  • 3
    • 0036476668 scopus 로고    scopus 로고
    • "Optimal partition of QoS requirements on unicast paths and multicast trees"
    • Feb
    • D. H. Lorenz and A. Orda, "Optimal partition of QoS requirements on unicast paths and multicast trees," IEEE/ACM Trans. Netw., vol. 10, no. 1, pp. 102-114, Feb. 2002.
    • (2002) IEEE/ACM Trans. Netw. , vol.10 , Issue.1 , pp. 102-114
    • Lorenz, D.H.1    Orda, A.2
  • 4
    • 0033892679 scopus 로고    scopus 로고
    • "QoS routing with performance-dependent costs"
    • Tel-Aviv, Israel, Mar.-Apr
    • L. Z. F. Ergun and R. Sinha, "QoS routing with performance-dependent costs," in Proc. IEEE INFOCOM, Tel-Aviv, Israel, Mar.-Apr. 2000, pp. 137-146.
    • (2000) Proc. IEEE INFOCOM , pp. 137-146
    • Ergun, L.Z.F.1    Sinha, R.2
  • 5
    • 0029737253 scopus 로고    scopus 로고
    • "Call admission and resource reservation for multicast sessions"
    • San Francisco, CA, Apr
    • V. Firoiu and T. Towsley, "Call admission and resource reservation for multicast sessions," in Proc. IEEE INFOCOM, San Francisco, CA, Apr. 1996, pp. 94-101.
    • (1996) Proc. IEEE INFOCOM , pp. 94-101
    • Firoiu, V.1    Towsley, T.2
  • 6
    • 0032633692 scopus 로고    scopus 로고
    • "Resource allocation in a multicast tree"
    • New York, Mar
    • M. Kodialasi and S. Low, "Resource allocation in a multicast tree," in Proc. IEEE INFOCOM, New York, Mar. 1999, pp. 262-266.
    • (1999) Proc. IEEE INFOCOM , pp. 262-266
    • Kodialasi, M.1    Low, S.2
  • 7
    • 84949939774 scopus 로고    scopus 로고
    • "Efficient QoS partition and routing of unicast and multicast"
    • Pittsburgh, PA, Jun
    • D. Lorenz, A. Orda, D. Raz, and Y. Shavitt, "Efficient QoS partition and routing of unicast and multicast," in Proc. IEEE/IFIP IWQoS, Pittsburgh, PA, Jun. 2000, pp. 75-83.
    • (2000) Proc. IEEE/IFIP IWQoS , pp. 75-83
    • Lorenz, D.1    Orda, A.2    Raz, D.3    Shavitt, Y.4
  • 8
    • 0034461821 scopus 로고    scopus 로고
    • "Optimal partition of QoS requirements with discrete cost functions"
    • Dec
    • D. Raz and Y. Shavitt, "Optimal partition of QoS requirements with discrete cost functions," IEEE J. Sel. Areas Commun., vol. 18, no. 12, pp. 2593-2602, Dec. 2000.
    • (2000) IEEE J. Sel. Areas Commun. , vol.18 , Issue.12 , pp. 2593-2602
    • Raz, D.1    Shavitt, Y.2
  • 9
    • 0036806325 scopus 로고    scopus 로고
    • "Computing shortest paths for any number of hops"
    • Oct
    • R. Guérin and A. Orda, "Computing shortest paths for any number of hops," IEEE/ACM Trans. Netw., vol. 10, no. 5, pp. 613-620, Oct. 2002.
    • (2002) IEEE/ACM Trans. Netw. , vol.10 , Issue.5 , pp. 613-620
    • Guérin, R.1    Orda, A.2
  • 10
    • 0042416646 scopus 로고    scopus 로고
    • "Precomputation schemes for QoS routing"
    • Aug
    • A. Orda and A. Sprintson, "Precomputation schemes for QoS routing," IEEE/ACM Trans. Netw., vol. 11, no. 4, pp. 578-591, Aug. 2003.
    • (2003) IEEE/ACM Trans. Netw. , vol.11 , Issue.4 , pp. 578-591
    • Orda, A.1    Sprintson, A.2


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