Scheduling bursts in time-domain wavelength interleaved networks

Ross, Kevin; Bambos, Nicholas; Kumaran, K.; Saniee, Iraj; Widjaja, Indra

doi:10.1109/jsac.2003.818230

Cited by 62 publications

(54 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We also demonstrate that the impact of infrequent knowledge of channel states is substantially different from that of infrequent knowledge of queue lengths. While infrequent knowledge of queue lengths does not alter the maximum achievable throughput region (as shown by several previous results in different settings [1], [2], [20], [21], [22], [23], [24], [25], [26], [27]), we show in this paper that infrequent knowledge of service rates substantially reduces the maximum achievable throughput region.…”

Section: Related Worksupporting

confidence: 74%

“…LetΛ T denote the stability region in this case. The following result can be easily shown, and has been observed in the existing literature in different contexts [21], [23], [24], [25], [26], [27]:…”

Section: A Characterization Of the Stability Regionsupporting

confidence: 55%

“…There is a rich body of literature on the subject of throughput-optimal scheduling in a wide variety of queueing networks [1], [2], [6], [7], [15], [19], [20], [21], [22], [23], [24], [25], [26], [29], [31], [30]. These papers either assume that the service rates of the queues do not vary with time, or if the service rates vary, the schedulers know the service rates of the queues before each scheduling decision.…”

Section: Related Workmentioning

confidence: 99%

See 2 more Smart Citations

Throughput-Optimal Scheduling in Multichannel Access Point Networks Under Infrequent Channel Measurements

Kar

Luo

Sarkar

2007

IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications

View full text Add to dashboard Cite

We consider the problem of uplink/downlink scheduling in a multichannel wireless access point network where channel states differ across channels as well as users, vary with time, and can be measured only infrequently. We demonstrate that, unlike infrequent measurement of queue lengths, infrequent measurement of channel states reduce the maximum attainable throughput.We then prove that in frequency division multiplexed systems, a dynamic scheduling policy that depends on both the channel rates (averaged over the measurement interval) and the queue lengths, is throughput optimal. We also generalize the scheduling policy to solve the joint power allocation and scheduling problem. In addition, we provide simulation studies that demonstrate the impact of the frequency of channel and queue state measurements on the average delay and attained throughput. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the University of Pennsylvania's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to pubs-permissions@ieee.org. By choosing to view this document, you agree to all provisions of the copyright laws protecting it. Abstract-We consider the problem of uplink/downlink scheduling in a multichannel wireless access point network where channel states differ across channels as well as users, vary with time, and can be measured only infrequently. We demonstrate that, unlike infrequent measurement of queue lengths, infrequent measurement of channel states reduce the maximum attainable throughput. We then prove that in frequency division multiplexed systems, a dynamic scheduling policy that depends on both the channel rates (averaged over the measurement interval) and the queue lengths, is throughput optimal. We also generalize the scheduling policy to solve the joint power allocation and scheduling problem. In addition, we provide simulation studies that demonstrate the impact of the frequency of channel and queue state measurements on the average delay and attained throughput.Index Terms-Infrequent channel measurements, multichannel access point networks, throughput-optimal scheduling.

show abstract

Section: Related Worksupporting

confidence: 74%

Section: A Characterization Of the Stability Regionsupporting

confidence: 55%

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Throughput-Optimal Scheduling in Multichannel Access Point Networks Under Infrequent Channel Measurements

Kar

Luo

Sarkar

2007

IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications

View full text Add to dashboard Cite

show abstract

“…Compared with the two existing minimum delay scheduling algorithms MIN and -SCALE, QLEF dramatically cuts down the required speedup bound with the same time complexity of . Although QLEF is presented based on optical switch scheduling, it may find wide applications in similar scheduling problems, such as those in Sattelite Switched Time-Division Multiple Access (SS/TDMA) [15], [20], [24], Time-Wavelength Interleaved Networds (TWIN) [25] and sensor surveillance networks [26].…”

Section: Discussionmentioning

confidence: 99%

Minimum Delay Scheduling for Performance Guaranteed Switches With Optical Fabrics

Wu¹,

Yeung²,

et al. 2009

J. Lightwave Technol.

View full text Add to dashboard Cite

Abstract-We consider traffic scheduling in performance guaranteed switches with optical fabrics to ensure 100% throughput and bounded packet delay. Each switch reconfiguration consumes a constant period of time called reconfiguration overhead, during which no packet can be transmitted across the switch. To minimize the packet delay bound for an arbitrary traffic matrix, the number of switch configurations in the schedule should be no larger than the switch size . This is called minimum delay scheduling, where the ideal minimum packet delay bound is determined solely by the total overhead of the switch reconfigurations. A speedup in the switch determines the actual packet delay bound, which decreases toward the ideal bound as the speedup increases. Our objective is to minimize the required speedup schedule under a given actual packet delay bound. We propose a novel minimum delay scheduling algorithm quasi largest-entry-first (QLEF) to solve this problem. Compared with the existing minimum delay scheduling algorithms MIN and -SCALE, QLEF dramatically cuts down the required schedule bound. For example, QLEF only requires schedule = 17 89 for = 450, whereas MIN and -SCALE require schedule = 37 13 and 27.82, respectively. This gives a significant performance gain of 52% over MIN and 36% over -SCALE.

show abstract

“…Note that ADAPT and SRF are based on a generic matrix decomposition approach proposed in this paper. This matrix decomposition technique may also find applications in other networks, such as SS/TDMA [16], [17], TWIN [18] and wireless sensor networks [19]. It can also be applied to unconstrained switches [6] (e.g., electronic switches) to reduce the number of configurations in the schedule (compared to Birkhoff-von Neumann decomposition) [14].…”

mentioning

confidence: 99%

Minimizing Internal Speedup for Performance Guaranteed Switches With Optical Fabrics

Yeung

Hamdi

et al. 2009

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

Abstract-We consider traffic scheduling in an packet switch with an optical switch fabric, where the fabric requires a reconfiguration overhead to change its switch configurations. To provide 100% throughput with bounded packet delay, a speedup in the switch fabric is necessary to compensate for both the reconfiguration overhead and the inefficiency of the scheduling algorithm. In order to reduce the implementation cost of the switch, we aim at minimizing the required speedup for a given packet delay bound. Conventional Birkhoff-von Neumann traffic matrix decomposition requires 2 2 + 2 configurations in the schedule, which lead to a very large packet delay bound. The existing DOUBLE algorithm requires a fixed number of only 2 configurations, but it cannot adjust its schedule according to different switch parameters. In this paper, we first design a generic approach to decompose a traffic matrix into an arbitrary number of ( 2 2 + 2 ) configurations.Then, by taking the reconfiguration overhead into account, we formulate a speedup function. Minimizing the speedup function results in an efficient scheduling algorithm ADAPT. We further observe that the algorithmic efficiency of ADAPT can be improved by better utilizing the switch bandwidth. This leads to a more efficient algorithm SRF (Scheduling Residue First). ADAPT and SRF can automatically adjust the number of configurations in a schedule according to different switch parameters. We show that both algorithms outperform the existing DOUBLE algorithm.

show abstract

Scheduling bursts in time-domain wavelength interleaved networks

Cited by 62 publications

References 14 publications

Throughput-Optimal Scheduling in Multichannel Access Point Networks Under Infrequent Channel Measurements

Throughput-Optimal Scheduling in Multichannel Access Point Networks Under Infrequent Channel Measurements

Minimum Delay Scheduling for Performance Guaranteed Switches With Optical Fabrics

Minimizing Internal Speedup for Performance Guaranteed Switches With Optical Fabrics

Contact Info

Product

Resources

About