Optimal transmission schedules in TWDM optical passive star networks

Lee, Sang‐Kyu; Oh, Am-Suk; Choi, Hyeong‐Ah

doi:10.1016/s0166-218x(96)00081-9

Cited by 12 publications

(1 citation statement)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The problem considered in this paper is formulated as the virtual topology embedding problem: Given a virtual topology G, we want to embed G in the network and find a transmission schedule in such a way that the time slots are arranged into repeating cycles of minimum length and each node in G transmits once to each of its neighboring nodes. This problem was discussed in our earlier works [6, 7, 81 under the condition that a = / 3 = 1: the optimal schedule length is shown to be max{ q , N -1 + kS} when G is a complete graph with N nodes [6], and max{ F, n + b6} when G is an n-dimensional hypercube with N = 2n and k = 2b for an integer b [7, 81. In [12] an all-to-all broadcasting model for single transmitter and single receiver per node (i.e. a = P = 1) was proposed where each transmitter has N packets to be sent to N receivers; thus, N2 transmissions need to be done.…”

Section: Department Of Computer Sciencementioning

confidence: 99%

Optimal transmission schedules in WDM broadcast-and-select networks with multiple transmitters and receivers

Lee

Oh²,

Choi³

Proceedings of Massively Parallel Processing Using Optical Interconnections

View full text Add to dashboard Cite

I n this paper, we study the problem of optimal transmission schedules f o r embedding complete graphs in WDM broadcast-and-select networks. A n optimal transmission schedule is defined to be the one that schedules transmissions such that each node transmits once to every other node within a repeating cycle of minimum length. Our model assumes that the network has N nodes with k wavelength channels, and each node is equipped with multiple tunable transmztters and multiple fixed-tuned receivers. Given a and p (1 5 a , p 5 k ) , we first obtain an optimal transmission schedule with schedule length max{*, P(N -1) + kd} such that each node transmits to each of zts nezghboring nodes exactly cup times withzn this time period assuming that each node has a single transmitter and a single receiver. Using this result, we next show that there exists an optzmal transmisszon schedule with average schedule length max{ , + $8) when each node has a transmitters and P receivers. W e then discuss an O(1og k) algorithm to compute optimal numbers of transmitters and recezvers t o minimize the overall cost of transmitters and receivers in the network while meeting a given bound of schedule length. 0-8186-7591-8/96 $5.00 0 1996 IEEE Proceedings of MPPOI '96

show abstract

Section: Department Of Computer Sciencementioning

confidence: 99%