Optimization flow control—I: basic algorithm and convergence
IEEE/ACM Transactions on Networking (TON)
A framework for opportunistic scheduling in wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Non-convex optimization and rate control for multi-class services in the Internet
IEEE/ACM Transactions on Networking (TON)
End-to-end fair rate optimization in wired-cum-wireless networks
Ad Hoc Networks
Downlink scheduling and resource allocation for OFDM systems
IEEE Transactions on Wireless Communications
Utility-based end-to-end flow control for services with time-varying rate requirements
CCNC'09 Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference
Opportunistic power scheduling for dynamic multi-server wireless systems
IEEE Transactions on Wireless Communications
Hi-index | 0.00 |
In this paper, we study a cross-layer optimization problem for a network that consists of one wireline core network and multiple wireless access networks. We consider four layers among five layers in the network layering architecture: application characteristics through the utility function and quality of service requirements in the application layer; end-to-end flow control in the transport layer; opportunistic scheduling in the data link layer; adaptive modulation and coding in the physical layer. We formulate a stochastic optimization problem considering above four layers and both wireline and wireless parts of the network jointly that results in a utility-based joint end-to-end flow control and opportunistic scheduling problem for the integrated wireless and wireline network. We solve the problem by using a dual approach and a stochastic sub-gradient algorithm. The developed algorithm can be implemented in a distributed way: vertically among four layers and horizontally among all entities in the network, clearly showing what should be done in each layer and each entity and what parameters should be exchanged between layers vertically and between network entities horizontally.