Name
Abstract | ||
|---|---|---|
In this paper, we consider the problem for maximizing the throughput of a discrete-time wireless network, where only certain sets of links can transmit simultaneously. It is well known that each set of such links can be represented by a configuration vector and the convex hull of the configuration vectors determines the capacity region of the wireless network. In the literature, packet scheduling polices that stabilize any admissible traffic in the capacity region are mostly related to the maximum weighted matching algorithm (MWM) that identifies the most suitable configuration vector in every time slot. Unlike the MWM algorithm, we propose a dynamic frame sizing (DFS) algorithm that also stabilizes any admissible traffic in the capacity region. The DFS algorithm, as an extension of our previous work for wired networks, also does not have a fixed frame size. To determine the frame size, an optimization problem needs to be solved at the beginning of each frame. Once the frame size is determined, a hierarchical smooth schedule is devised to determine both the schedule for configuration vectors and the schedule for multicast traffic flows in each link. Under the assumption of Bernoulli arrival processes with admissible rates, we show that the number of packets of each multicast traffic flow inside the wireless network is bounded above by a constant and thus one only requires to implement a finite internal buffer in each link in such a wireless network. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1109/INFCOM.2011.5935053 | INFOCOM |
Keywords | Field | DocType |
discrete-time wireless network,mwm algorithm,packet scheduling policy,multicast traffic flow,finite internal buffer,convex hull,configuration vector,queueing theory,dfs algorithm,flow queueing,dynamic frame sizing algorithm,radio networks,hierarchical smooth schedule,bernoulli arrival process,maximum weighted matching algorithm,traffic flow,wireless networks,mathematical model,optimization problem,scheduling algorithm,upper bound,schedules,heuristic algorithm,discrete time,wireless network | Wireless network,Mathematical optimization,Scheduling (computing),Computer science,Network packet,Computer network,Schedule,Throughput,Multicast,Optimization problem,Blossom algorithm,Distributed computing | Conference |
ISSN | ISBN | Citations |
0743-166X | 978-1-4244-9919-9 | 1 |
PageRank | References | Authors |
0.36 | 8 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ching-Ming Lien | 1 | 176 | 14.94 |
| Cheng-Shang Chang | 2 | 2392 | 246.97 |
| Jay Cheng | 3 | 153 | 14.40 |
| Duan-Shin Lee | 4 | 670 | 71.00 |