Article

Free access

A labeling algorithm for just-in-time scheduling in TDMA networks

Authors:

Charles G. Boncelet, Jr.,

David L. MillsAuthors Info & Claims

SIGCOMM '92: Conference proceedings on Communications architectures & protocols

Pages 170 - 175

https://doi.org/10.1145/144179.144269

Published: 01 October 1992 Publication History

PDF eReader

Abstract

This paper describes a scheduling algorithm for high speed, TDMA communication networks. The problem is to find a route and determine switch schedules so that a burst of information can traverse the network from source to destination. We show that this problem is difficult, i.e., that several simple variations are NP-complete. We present an algorithm that finds schedules, and within a simplifying assumption, is guaranteed to find a route if one exists. Simulations indicate that this algorithm runs quickly in practice and overall scheduling efficiencies of 80-90% can be achieved. We also describe a variation in which the problem is to find a repeating schedule and we show how to adapt the basic algorithm for this variation.

References

[1]

A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass., 1974.

Digital Library

Google Scholar

[2]

D. L. Mills, C. G. Boncelet Jr., J. G. Elias, P. A. Schragger, and A. W. Jackson. Highball: a high speed, reserved-access wide area network. Technical Report 90-9-3, University of Delaware, Department of Electrical Engineering, September 1990.

Google Scholar

[3]

C. Papadimitriou and K. Steiglitz. Combinatorial Optimization: Algorithms and Complezity. Prentice-Hall, Englewood Cliffs, NJ, 1982.

Digital Library

Google Scholar

[4]

P. Schragger. Scheduling algorithms for burst reservations on wide area high speed networks. In Proceedings of the IEEE INFOCOM '91, pages 6B.2.1- 6B.2.8, April 1991.

Google Scholar

Cited By

View all

Rodrigues JFreire M(2008)Performance Assessment of Enhanced Just-in-Time Protocol in OBS Networks Taking into Account Control Packet Processing and Optical Switch Configuration TimesProceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops10.1109/WAINA.2008.16(434-439)Online publication date: 25-Mar-2008
https://dl.acm.org/doi/10.1109/WAINA.2008.16
Rodrigues JFreire MLorenz P(2006)Performance Implications of Control Packet Processing and Optical Switch Configuration Times for Optical Burst Switched Mesh Networks with Degree-Four Topologies2006 International Symposium on Computer Networks10.1109/ISCN.2006.1662528(1-6)Online publication date: 2006
https://doi.org/10.1109/ISCN.2006.1662528
Hudek GMuder D(1995)Signaling analysis for a multi-switch all-optical networkProceedings IEEE International Conference on Communications ICC '9510.1109/ICC.1995.524292(1206-1210)Online publication date: 1995
https://doi.org/10.1109/ICC.1995.524292
Show More Cited By

Index Terms

A labeling algorithm for just-in-time scheduling in TDMA networks

Recommendations

A labeling algorithm for just-in-time scheduling in TDMA networks

This paper describes a scheduling algorithm for high speed, TDMA communication networks. The problem is to find a route and determine switch schedules so that a burst of information can traverse the network from source to destination. We show that this ...
Delay-aware TDMA Scheduling for Multi-Hop Wireless Networks
ICDCN '15: Proceedings of the 16th International Conference on Distributed Computing and Networking

Time Division Multiple Access (TDMA)-based medium access control (MAC) protocols can be used to provide guaranteed quality of service (QoS). Since nodes follow a fixed schedule to transmit data, the schedule plays a major role in determining QoS in ...
Non-approximability of just-in-time scheduling

We consider the following single machine just-in-time scheduling problem with earliness and tardiness costs: Given n jobs with processing times, due dates and job weights, the task is to schedule these jobs without preemption on a single machine such ...

Comments

Information & Contributors

Information

Published In

SIGCOMM '92: Conference proceedings on Communications architectures & protocols

October 1992

326 pages

ISBN:0897915259

DOI:10.1145/144179

Chairman:
Deepinder P. Sidhu
Univ. of Maryland, Baltimore
,
Editor:
David Oran
Digital Equipment Corporation, Littleton, MA

ACM SIGCOMM Computer Communication Review Volume 22, Issue 4
Oct. 1992
308 pages
ISSN:0146-4833
DOI:10.1145/144191
Editors:
David Oran
Digital Equipment Corporation, Littleton, MA
,
Deepinder P. Sidhu
Univ. of Maryland, Baltimore
Issue’s Table of Contents

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 October 1992

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SIGCOMM92

Sponsor:

SIGCOMM

SIGCOMM92: SIGCOMM Symposium, Communication, Architectures and Protocols

August 17 - 20, 1992

Maryland, Baltimore, USA

Acceptance Rates

Overall Acceptance Rate 462 of 3,389 submissions, 14%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
467
Total Downloads

Downloads (Last 12 months)50
Downloads (Last 6 weeks)15

Reflects downloads up to 18 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Rodrigues JFreire M(2008)Performance Assessment of Enhanced Just-in-Time Protocol in OBS Networks Taking into Account Control Packet Processing and Optical Switch Configuration TimesProceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops10.1109/WAINA.2008.16(434-439)Online publication date: 25-Mar-2008
https://dl.acm.org/doi/10.1109/WAINA.2008.16
Rodrigues JFreire MLorenz P(2006)Performance Implications of Control Packet Processing and Optical Switch Configuration Times for Optical Burst Switched Mesh Networks with Degree-Four Topologies2006 International Symposium on Computer Networks10.1109/ISCN.2006.1662528(1-6)Online publication date: 2006
https://doi.org/10.1109/ISCN.2006.1662528
Hudek GMuder D(1995)Signaling analysis for a multi-switch all-optical networkProceedings IEEE International Conference on Communications ICC '9510.1109/ICC.1995.524292(1206-1210)Online publication date: 1995
https://doi.org/10.1109/ICC.1995.524292
(1992)Bibliography of recent publications on computer communicationACM SIGCOMM Computer Communication Review10.1145/141809.14181722:5(86-94)Online publication date: 2-Oct-1992
https://doi.org/10.1145/141809.141817

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

A labeling algorithm for just-in-time scheduling in TDMA networks

Delay-aware TDMA Scheduling for Multi-Hop Wireless Networks

Non-approximability of just-in-time scheduling