Performance Evaluation - Special issue on performance modeling of high speed telecommunication systems
Analysis and optimization of transmission schedules for single-hop WDM networks
IEEE/ACM Transactions on Networking (TON)
Scheduling MPEG-compressed video streams with firm deadline constraints
Proceedings of the third ACM international conference on Multimedia
Scheduling variable-length messages in a single-hop multichannel local lightwave network
IEEE/ACM Transactions on Networking (TON)
On Slot Allocation for Time-Constrained Messages in Dual-Bus Networks
IEEE Transactions on Computers
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Guaranteeing Synchronous Message Deadlines with the Timed Token Medium Access Control Protocol
IEEE Transactions on Computers
A better polynomial-time schedulability test for real-time fixed-priority scheduling algorithms
RTSS '97 Proceedings of the 18th IEEE Real-Time Systems Symposium
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1
A distributed adaptive protocol providing real-time services on WDM-based LANs
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
Journal of High Speed Networks
Agile bandwidth management techniques in slotted all-optical packet switched networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 14.98 |
In this paper, we devise a preallocation-based single-hop wavelength division multiple access (WDMA) scheme to support temporal quality of service (QoS) in star-coupled optical networks. We consider a star-coupled broadcast-and-select network architecture in which $N$ stations are connected to a star coupler with $W$ different wavelength channels. Each of the $W$ wavelength channels is slotted and shared by the $N$ stations by means of time division multiplexing. Depending on the tunability characteristics (tunable or fixed tuned) of the transmitters/receivers, we classify the network architecture as tunable transmitter/fixed tuned receiver (TT-FR), fixed tuned transmitter/tunable receiver (FT-TR), and tunable transmitter/tunable receiver (TT-TR). We first characterize each real-time message stream $M_i$ with two parameters, the relative message deadline $D_i$ and the maximum (total) message size $C_i$ that can arrive within any time interval of length $D_i$. We then discuss a restricted case in a TT-FR (or FT-TR) system in which the message streams from a source station are assumed to be all destined for the same destination station. Under this assumption, no source/destination conflicts may occur. We propose a preallocation-based slot assignment scheme to preallocate slots to a set of isochronous message streams, $\{M_i=(C_i,D_i) \mid 1 \leq i \leq n\}$ in such a way that, in any time window of size $D_i$ slots, at least $C_i$ slots on a wavelength channel are allocated to $M_i$ for all $i$. With the solution derived in the restricted case as a basis, we then consider slot assignment in a (general) TT-TR system and propose a binary splitting scheme to assign each message stream sufficient and well-spaced slots to fulfill its temporal requirement, subject to the source/destination conflict constraints. We rigorously prove the invariance properties, and the correctness, of the binary splitting scheme.