Network utility maximization for triple-play services

被引:34
作者
Shi, Lei [1 ]
Liu, Changbin [1 ]
Liu, Bin [1 ]
机构
[1] Tsinghua Univ, Dept Comp Sci & Technol, Beijing 100084, Peoples R China
关键词
network utility maximization; triple-play services; next generation network; bandwidth allocation;
D O I
10.1016/j.comcom.2008.02.016
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
It is well known that Next-Generation Network (NGN) will inevitably carry triple-play services (i.e. voice, video and data) simultaneously. However, the traditional strict-priority based scheduling algorithm intensively used in current Internet cannot maximize the overall network utility for NGN, instead brings significant global welfare loss. In this paper, we study how to achieve Network Utility Maximization (NUM) in NGN running triple-play services. By investigating the characteristics of most of its traffic classes, we explicitly present their utilities as the function of allocated bandwidth. We further formulate the NUM objective as a nonlinear programming problem with both inequality and equality constraints. A solution using Lagrange Multiplier is given on the simplified problem with only equality constraints, which indicates the major distinction from strict-priority based scheduling, the existence of a turning point for IPTV users. Simulations are also carried out using LINGO on the original complicated problem. Several useful results are presented oil the new features of the NUM-based scheduling. We also discuss the methods to alleviate the impact of turning point and the consequent unstable bandwidth allocation. (C) 2008 Elsevier B.V. All rights reserved.
引用
收藏
页码:2257 / 2269
页数:13
相关论文
共 17 条
[1]  
[Anonymous], CHAOS MATH INTRO
[2]   Utility max-min: An application-oriented bandwidth allocation scheme [J].
Cao, ZR ;
Zegura, EW .
IEEE INFOCOM '99 - THE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-3, PROCEEDINGS: THE FUTURE IS NOW, 1999, :793-801
[3]   A bandwidth sharing theory for a large number of HTTP-like connections [J].
Chang, CS ;
Zhen, L .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2004, 12 (05) :952-962
[4]   A heuristic for dynamic bandwidth allocation with preemption and degradation for prioritized requests [J].
Dharwadkar, P ;
Siegel, HJ ;
Chong, EKP .
21ST INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS, PROCEEDINGS, 2001, :547-556
[5]   EQUIVALENT CAPACITY AND ITS APPLICATION TO BANDWIDTH ALLOCATION IN HIGH-SPEED NETWORKS [J].
GUERIN, R ;
AHMADI, H ;
NAGHSHINEH, M .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 1991, 9 (07) :968-981
[6]  
Harks T., 2005, P 13 IEEE INT C NETW, P311
[7]   Charging and rate control for elastic traffic [J].
Kelly, F .
EUROPEAN TRANSACTIONS ON TELECOMMUNICATIONS, 1997, 8 (01) :33-37
[8]  
Kelly FP, 1998, J OPER RES SOC, V49, P237, DOI 10.1038/sj.jors.2600523
[9]   End-to-end congestion control schemes: Utility functions, random losses. and ECN marks [J].
Kunniyur, S ;
Srikant, R .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2003, 11 (05) :689-702
[10]   Adaptive control algorithms for decentralized optimal traffic engineering in the Internet [J].
Lagoa, CM ;
Che, H ;
Movsichoff, BA .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2004, 12 (03) :415-428