On supporting temporal quality of service in WDMA-based star-coupled optical networks

Citation
Hy. Tyan et al., On supporting temporal quality of service in WDMA-based star-coupled optical networks, IEEE COMPUT, 50(3), 2001, pp. 197-214
Citations number
30
Categorie Soggetti
Computer Science & Engineering
Journal title
IEEE TRANSACTIONS ON COMPUTERS
ISSN journal
00189340 → ACNP
Volume
50
Issue
3
Year of publication
2001
Pages
197 - 214
Database
ISI
SICI code
0018-9340(200103)50:3<197:OSTQOS>2.0.ZU;2-F
Abstract
In this paper, we devise a preallocation-based single-hop wavelength divisi on multiple access (WDMA) scheme to support temporal quality of service (Qo S) in star-coupled optical networks. We consider a star-coupled broadcast-a nd-select network architecture in which N stations are connected to a star coupler with W different wavelength channels. Each of the W wavelength chan nels is slotted and shared by the N stations by means of time division mult iplexing. Depending on the tunability characteristics (tunable or fixed tun ed) of the transmitters/receivers, we classify the network architecture as tunable transmitter/fixed tuned receiver (TT-FR), fixed tuned transmitter/t unable receiver (FT-TR), and tunable transmitter/tunable receiver (TT-TR). We first characterize each real-time message stream nl, 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 destinati on station. Under this assumption, no source/destination conflicts may occu r. We propose a preallocation-based slot assignment scheme to preallocate s lots to a set of isochronous message streams, (M-i, = (C-i, D-i) \ 1 less t han or equal to i less than or equal to 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 al located 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 an d propose a binary splitting scheme to assign each message stream sufficien t and well-spaced slots to fulfill its temporal requirement, subject to the source/destination conflict constraints. We rigorously prove the invarianc e properties, and the correctness, of the binary splitting scheme.