Timeslot-sharing algorithm with a dynamic grouping for WDM broadcast-and-select star networks

A quality of service scheduling technique for optical LANs

“…It is obvious that the complexity of IPOSS algorithm, using the ls-ee strategy, is less than the complexity of OIS algorithm which is in O(nw 2 k) time, where k is the maximum value of D h + D l matrix. For example, let us suppose that during a transmission frame three requests, namely the D l (2, 3), D l (3, 1) and D l (3,3) have the same value of 5 data packets. In that case, IOSS would randomly select one among the aforementioned requests.…”

“…Timeslots l 1 l 2 l 3 l 4 l 5 l 6 l 7 l 8 λ 1 u 2 u 3 u 3 u 3 λ 2 u 3 u 3 u 3 u 2 u 2 u 2 u 2 u 2 Finally, the requests d l (1, 1), d l (2, 1), d l (3,2) and d l (1,2) are processed following the same logic and the final scheduling matrix are formed as follows:…”

“…Up to now, a large number of MAC protocols has been proposed in order to handle the nodes' transmission requests in an optical WDM star network [3]- [6]. However, if we focus on a network, in which each node is equipped with a tunable transmitter and a fixed receiver (TT-FR), without any control channel, then we can observe that there is a lack of MAC protocols, supporting QoS.…”