메뉴 건너뛰기




Volumn 31, Issue 10, 2008, Pages 2257-2269

Network utility maximization for triple-play services

Author keywords

Bandwidth allocation; Network utility maximization; Next generation network; Triple play services

Indexed keywords

ALGORITHMS; FREQUENCY ALLOCATION; OPTIMIZATION; SCHEDULING;

EID: 44549085349     PISSN: 01403664     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comcom.2008.02.016     Document Type: Article
Times cited : (48)

References (17)
  • 1
    • 44549084639 scopus 로고    scopus 로고
    • AN-2000™ IP-DSLAM for Triple Play, White Paper, UTStarcom Inc., 2004.
    • AN-2000™ IP-DSLAM for Triple Play, White Paper, UTStarcom Inc., 2004.
  • 2
    • 44549086083 scopus 로고    scopus 로고
    • How much bandwidth would be used by online gaming, Available from: .
    • How much bandwidth would be used by online gaming, Available from: .
  • 3
    • 44549087972 scopus 로고    scopus 로고
    • Optimizing the Broadband Aggregation Network for Triple Play Services, Strategic White Paper, Alcatel, 2005.
    • Optimizing the Broadband Aggregation Network for Triple Play Services, Strategic White Paper, Alcatel, 2005.
  • 4
    • 44549086553 scopus 로고    scopus 로고
    • QoS Technology Guide for Gamers, Available from: .
    • QoS Technology Guide for Gamers, Available from: .
  • 6
    • 0032661701 scopus 로고    scopus 로고
    • Z. Cao, E. Zegura, Utility max-min: an application-oriented bandwidth allocation scheme, in: Proc. IEEE INFOCOM, 1999, pp. 793-801.
    • Z. Cao, E. Zegura, Utility max-min: an application-oriented bandwidth allocation scheme, in: Proc. IEEE INFOCOM, 1999, pp. 793-801.
  • 7
    • 7244262069 scopus 로고    scopus 로고
    • A bandwidth sharing theory for a large number of HTTP-like connections
    • Chang C.S., and Liu Z. A bandwidth sharing theory for a large number of HTTP-like connections. IEEE/ACM Transactions on Networking 12 5 (2004) 952-962
    • (2004) IEEE/ACM Transactions on Networking , vol.12 , Issue.5 , pp. 952-962
    • Chang, C.S.1    Liu, Z.2
  • 8
    • 0034997268 scopus 로고    scopus 로고
    • P. Dharwadkar, H.J. Siegel et al., A Heuristic for dynamic bandwidth allocation with preemption and degradation for prioritized requests, in: Proc. ICDCS, 2001, pp. 547-556.
    • P. Dharwadkar, H.J. Siegel et al., A Heuristic for dynamic bandwidth allocation with preemption and degradation for prioritized requests, in: Proc. ICDCS, 2001, pp. 547-556.
  • 9
    • 0026225346 scopus 로고
    • Equivalent capacity and its application to bandwidth allocation in high-speed networks
    • Guerin R., Ahmadi H., et al. Equivalent capacity and its application to bandwidth allocation in high-speed networks. IEEE Journal on Selected Areas in Communications 9 7 (1991) 968-981
    • (1991) IEEE Journal on Selected Areas in Communications , vol.9 , Issue.7 , pp. 968-981
    • Guerin, R.1    Ahmadi, H.2
  • 10
    • 33750957964 scopus 로고    scopus 로고
    • T. Harks, T. Poschwatta, Priority pricing in utility fair networks, in: Proc. IEEE ICNP, 2005, pp. 311-320.
    • T. Harks, T. Poschwatta, Priority pricing in utility fair networks, in: Proc. IEEE ICNP, 2005, pp. 311-320.
  • 12
    • 0032027247 scopus 로고    scopus 로고
    • Rate control in communication networks: shadow prices, proportional fairness and stability
    • Kelly F.P. Rate control in communication networks: shadow prices, proportional fairness and stability. Journal of the Operational Research Society 49 (1998) 237-252
    • (1998) Journal of the Operational Research Society , vol.49 , pp. 237-252
    • Kelly, F.P.1
  • 13
    • 0242302646 scopus 로고    scopus 로고
    • End-to-End congestion control schemes: utility functions, random losses and ECN marks
    • Kunniyur S., and Srikant R. End-to-End congestion control schemes: utility functions, random losses and ECN marks. IEEE/ACM Transactions on Networking 11 5 (2003) 689-702
    • (2003) IEEE/ACM Transactions on Networking , vol.11 , Issue.5 , pp. 689-702
    • Kunniyur, S.1    Srikant, R.2
  • 14
    • 4344571007 scopus 로고    scopus 로고
    • Adaptive control algorithms for decentralized optimal traffic engineering in the internet
    • Lagoa C.M., Che H., et al. Adaptive control algorithms for decentralized optimal traffic engineering in the internet. IEEE/ACM Transactions on Networking 12 3 (2004) 415-428
    • (2004) IEEE/ACM Transactions on Networking , vol.12 , Issue.3 , pp. 415-428
    • Lagoa, C.M.1    Che, H.2
  • 17
    • 0036279632 scopus 로고    scopus 로고
    • S. Zimmermann, U. Killat, Resource marking and fair rate allocation, in Proc. IEEE ICC, 2002, pp. 1310-1314.
    • S. Zimmermann, U. Killat, Resource marking and fair rate allocation, in Proc. IEEE ICC, 2002, pp. 1310-1314.


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