Bandwidth sharing: objectives and algorithms
IEEE/ACM Transactions on Networking (TON)
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
End-to-end congestion control schemes: utility functions, random losses and ECN marks
IEEE/ACM Transactions on Networking (TON)
Adaptive control algorithms for decentralized optimal traffic engineering in the internet
IEEE/ACM Transactions on Networking (TON)
A bandwidth sharing theory for a large number of HTTP-like connections
IEEE/ACM Transactions on Networking (TON)
Priority Pricing in Utility Fair Networks
ICNP '05 Proceedings of the 13TH IEEE International Conference on Network Protocols
Equivalent capacity and its application to bandwidth allocation in high-speed networks
IEEE Journal on Selected Areas in Communications
Fundamental design issues for the future Internet
IEEE Journal on Selected Areas in Communications
Nonconvex maximization for communication systems based on particle swarm optimization
Computer Communications
Analysis for market-driven multipath inter-domain routing
IITA'09 Proceedings of the 3rd international conference on Intelligent information technology application
Social distance aware resource allocation in wireless networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Online NetFPGA decision tree statistical traffic classifier
Computer Communications
| Hi-index | 0.24 |
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 on 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.