Minimizing the Number of Switchings in an SS/TDMA System

Gopal, I.; Wong, Carmen

doi:10.1109/tcom.1985.1096336

Cited by 135 publications

(86 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…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%

“…Constraints (18) and (19) define each configuration as a permutation matrix. Constraints (20) and (21) (22) ensures that all the entries in are properly covered by the configurations. Note that the ILP formulated in (17)- (22) allows configuration overlaps in the schedule.…”

Section: Appendix a Ilp Formulationmentioning

confidence: 99%

“…Minimum delay scheduling in this paper differs from those works by ensuring , with the objective of minimizing speedup under a given packet delay bound. We also notice that algorithm GOPAL [20] ensures , but it is designed for average performance instead of worst-case performance guarantee.…”

mentioning

confidence: 99%

See 2 more Smart Citations

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

Section: Discussionmentioning

confidence: 99%

Section: Appendix a Ilp Formulationmentioning

confidence: 99%

See 1 more Smart Citation

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

show abstract

“…Theorem 2: The problem ILJD is NP hard. Several flavors of matrix decomposition problems have been studied extensively in the TDMA scheduling literature [20], [21], [22], [23]. As in our case, the two most important considerations in TDMA scheduling (especially for satellite scheduling) are to minimize the number of matrices in the decomposition and the total bandwidth needed to support the decomposition.…”

Section: B the Low Jitter Decompositionmentioning

confidence: 99%

On guaranteed smooth scheduling for input-queued switches

Keslassy

Kodialam²,

Lakshman³

et al. 2005

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

Abstract-Input-queued switches are used extensively in the design of high-speed routers. As switch speeds and sizes increase, the design of the switch scheduler becomes a primary challenge, because the time interval for the matching computations needed for determining switch configurations becomes very small. Possible alternatives in scheduler design include increasing the scheduling interval by using envelopes [1], and using a framebased scheduler that guarantees fixed rates between input-output pairs. However, both these alternatives have significant jitter drawbacks: the jitter increases with the envelope size in the first alternative, and previously-known methods do not guarantee tight jitter bounds in the second.In this paper, we propose a hybrid approach to switch scheduling. Traffic with tight jitter constraints is first scheduled using a frame-based scheduler that achieves low jitter bounds. Jitter-insensitive traffic is later scheduled using an envelope-based scheduler. The main contribution of this paper is a scheduler design for generating low-jitter schedules. The scheduler uses a rate matrix decomposition designed for low jitter and different from the minimum-bandwidth Birkhoff-Von Neumann (BV) decomposition. In addition to generating low-jitter schedules, this decomposition yields fewer switch configuration matrices (O(n)) than the BV decomposition (O(n 2 )), and so uses far less high-speed switch memory. We develop an efficient algorithm for decomposing the rate matrix and for scheduling the permutation matrices. We prove that our low-jitter algorithm has an O(log n) factor bound on its bandwidth consumption in comparison to the minimum-bandwidth BV decomposition. Experimentally, we find that the bandwidth increase in practice is much lower than the theoretical bound. We also prove several related performance bounds for our scheduler. Finally, we propose a practical bandwidth-guaranteed algorithm, and show how our findings could even be extended to systems with large tuning time.

show abstract

“…Gopal and Wong [1985] and Rendl [19851 have shown that the problem of constructing a shortest decomposition into at most n matrices is NP-complete. Thus, it makes sense to look for heuristics.…”

Section: K=1mentioning

confidence: 99%

Symposium on Applied Mathematical Programming and Modeling (APMOD93) Held in Budapest, Hungary on January 6-8, 1993. Volume of Extended Abstracts

Maros¹

1993

View full text Add to dashboard Cite

Minimizing the Number of Switchings in an SS/TDMA System

Cited by 135 publications

References 5 publications

Minimum Delay Scheduling for Performance Guaranteed Switches With Optical Fabrics

Minimum Delay Scheduling for Performance Guaranteed Switches With Optical Fabrics

On guaranteed smooth scheduling for input-queued switches

Symposium on Applied Mathematical Programming and Modeling (APMOD93) Held in Budapest, Hungary on January 6-8, 1993. Volume of Extended Abstracts

Contact Info

Product

Resources

About