@article{Sarigiannidis200776,

title = {A high performance scheduling priority scheme for WDM star networks},

author = { P. Sarigiannidis and G. Papadimitriou and A. Pomportsis},

url = {https://www.researchgate.net/publication/3417936_A_high_performance_scheduling_priority_scheme_for_WDM_star_networks},

doi = {10.1109/LCOMM.2007.060824},

year  = {2007},

date = {2007-01-01},

journal = {IEEE Communications Letters},

volume = {11},

number = {1},

pages = {76-78},

abstract = {A novel scheduling scheme for local area wavelength division multiplexing (WDM) single hop networks is introduced. The proposed protocol provides pre-transmission coordination schedule without collisions. It is based on a broadcast and select star architecture and uses a timeslot based access protocol. The proposed scheme incorporates a prediction based system, in order to reduce the amount of time spend in computing the schedule by predicting traffic requests. A series of simulation results is presented which indicates that when a specific schedule order is followed, starting from the node with the greatest demand, and completing to the node with the least demand (in transmission time) then a better network performance is achieved. Furthermore, the network throughput is higher, while the mean time packet delay at the waiting queues seems to be lower. © 2007 IEEE.},

keywords = {Optical WDM networks, Reservation, Scheduling, Traffic prediction},

pubstate = {published},

tppubtype = {article}

}

@article{Sarigiannidis2006211,

title = {CS-POSA: A high performance scheduling algorithm for WDM star networks},

author = { P.G. Sarigiannidis and G.I. Papadimitriou and A.S. Pomportsis},

url = {https://www.researchgate.net/publication/225152613_CS-POSA_A_high_performance_scheduling_algorithm_for_WDM_star_networks},

doi = {10.1007/s11107-005-6024-x},

year  = {2006},

date = {2006-01-01},

journal = {Photonic Network Communications},

volume = {11},

number = {2},

pages = {211-227},

abstract = {In this paper a new packet scheduling algorithm for WDM star networks is introduced. The protocol adopted is pre-transmission coordination-based and packet collisions have been eliminated due to predetermination of the timeslots each node transmits in a demand matrix. The requests of the transmitted packets are predicted through Markov chains in order to reduce the calculation time of the final scheduling matrix. This is accomplished by pipelining the schedule computation. The innovation that this algorithm introduces is to modify the service sequence of the node. The proposed algorithm is studied via extensive simulation results and it is proved that changing the sequence that nodes transmit, from the node with the largest number of requests to the node with the fewest requests, that there is an increase in the throughput of the network, with a minimum (almost zero) cost in mean time delay and in delay variance. © Springer Science + Business Media, Inc. 2006.},

keywords = {Optical WDM networks, Reservation, Scheduling, Star topology, Traffic prediction},

pubstate = {published},

tppubtype = {article}

}

@article{Sarigiannidis20064811,

title = {A high-throughput scheduling technique, with idle timeslot elimination mechanism},

author = { P.G. Sarigiannidis and G.I. Papadimitriou and A.S. Pomportsis},

url = {https://www.researchgate.net/publication/3243752_A_High-Throughput_Scheduling_Technique_With_Idle_Timeslot_Elimination_Mechanism},

doi = {10.1109/JLT.2006.884992},

year  = {2006},

date = {2006-01-01},

journal = {Journal of Lightwave Technology},

volume = {24},

number = {12},

pages = {4811-4827},

abstract = {A new media-access-control protocol is introduced in this paper. The authors consider a wavelength-division-multiplexing (WDM) network with star topology. A single-hop WDM system is considered, so that there is a full connectivity between every node-pair in just one hop. The protocol adopted is pretransmission coordination-based, so the protocol coordinates nodes before the actual transmission. The coordination is achieved with one demand (or traffic) matrix, which saves the predetermination of the timeslots each node transmits. Each transmission frame (or cycle) has two phases: the control phase and the data phase. In order to eliminate the possible delay added by the schedule computation between the two phases of each frame, they consider a traffic prediction scheme, which is based upon the hidden Markov chain model. The control phase functions as a learning period in which the predictor is trained. The training is based on the traffic of the network. During the data phase, each station transmits its packets based on the predicted reservations, which are the predictor's output. In the same frame, the predictor computes the reservations for the next frame. They show that their protocol, although suffering from small packet delay loss, introduces a new method of computing the reservations of the demand matrix and brings some performance improvement in terms of channel utilization and results in higher network throughput, which is proven by extensive simulations. © 2006 IEEE.},

keywords = {Demand matrix, Optical wavelength-division-multiplexing (WDM) networks, Reservation, Scheduling, Traffic prediction},

pubstate = {published},

tppubtype = {article}

}