2008
P.G. Sarigiannidis; G.I. Papadimitriou; A.S. Pomportsis
A novel medium access control protocol for optical local networks based on data request ordering Journal Article
In: Optics and Laser Technology, vol. 40, no. 1, pp. 175-193, 2008.
Abstract | BibTeX | Tags: Optical WDM networks, Scheduling, Service sequence | Links:
@article{Sarigiannidis2008175,
title = {A novel medium access control protocol for optical local networks based on data request ordering},
author = { P.G. Sarigiannidis and G.I. Papadimitriou and A.S. Pomportsis},
url = {https://www.researchgate.net/publication/223600886_A_novel_medium_access_control_protocol_for_optical_local_networks_based_on_data_request_ordering},
doi = {10.1016/j.optlastec.2007.02.004},
year = {2008},
date = {2008-01-01},
journal = {Optics and Laser Technology},
volume = {40},
number = {1},
pages = {175-193},
abstract = {The basic aim of the scheduling algorithms in wavelength division multiplexing (WDM) single-hop optical networks is to construct a short schedule, in order to support quick communication between the nodes of the network. A design of medium access control (MAC) protocol without collisions is introduced for scheduling variable-length data packets based on a broadcast and select architecture. The system includes only data channels and the coordination of the transmissions is achieved via control packets, functioning before the beginning of actual transmissions. The proposed scheme adopts a prediction mechanism in order to eliminate the possible delay introduced by the scheduling computation between the control and data phases of each cycle of transmission. The two common scheduling strategies suggested try to reorder the service sequence of the nodes, by prioritizing the nodes with long data packets, compared with the nodes with short data packets. The final schedule, formed by a scheduling matrix, seems to be much shorter and leads to an increase, in terms of channel utilization. The extensive simulation results show that the novel scheduling techniques offer more free time space for schedule and allow more data to travel on the medium for the same amount of time. Also, the mean packet delay on the queues is reduced and the relation throughput-delay is much better. © 2007 Elsevier Ltd. All rights reserved.},
keywords = {Optical WDM networks, Scheduling, Service sequence},
pubstate = {published},
tppubtype = {article}
}
The basic aim of the scheduling algorithms in wavelength division multiplexing (WDM) single-hop optical networks is to construct a short schedule, in order to support quick communication between the nodes of the network. A design of medium access control (MAC) protocol without collisions is introduced for scheduling variable-length data packets based on a broadcast and select architecture. The system includes only data channels and the coordination of the transmissions is achieved via control packets, functioning before the beginning of actual transmissions. The proposed scheme adopts a prediction mechanism in order to eliminate the possible delay introduced by the scheduling computation between the control and data phases of each cycle of transmission. The two common scheduling strategies suggested try to reorder the service sequence of the nodes, by prioritizing the nodes with long data packets, compared with the nodes with short data packets. The final schedule, formed by a scheduling matrix, seems to be much shorter and leads to an increase, in terms of channel utilization. The extensive simulation results show that the novel scheduling techniques offer more free time space for schedule and allow more data to travel on the medium for the same amount of time. Also, the mean packet delay on the queues is reduced and the relation throughput-delay is much better. © 2007 Elsevier Ltd. All rights reserved.
P.G. Sarigiannidis; G.I. Papadimitriou; A.S. Pomportsis
LENA: An efficient channel eclectic algorithm for WDM optical networks Journal Article
In: Optics and Laser Technology, vol. 40, no. 1, pp. 39-51, 2008.
Abstract | BibTeX | Tags: Optical WDM networks, Scheduling, Service sequence | Links:
@article{Sarigiannidis200839,
title = {LENA: An efficient channel eclectic algorithm for WDM optical networks},
author = { P.G. Sarigiannidis and G.I. Papadimitriou and A.S. Pomportsis},
url = {https://www.researchgate.net/publication/233835639_LENA_An_efficient_channel_eclectic_algorithm_for_WDM_optical_networks},
doi = {10.1016/j.optlastec.2007.04.001},
year = {2008},
date = {2008-01-01},
journal = {Optics and Laser Technology},
volume = {40},
number = {1},
pages = {39-51},
abstract = {Media access control (MAC) protocols are methods and ways of accessing the optical fibers, in order to support communication to the nodes of the network. One of the important themes on the design of high-efficient optical networks is the time duration of the schedule process. A good protocol supports effective scheduling methods, without significant time cost. In this work, the performance of a new pre-transmission coordination based protocol on a wavelength division multiplexing (WDM) broadcast and select optical network is studied. A novel scheduling algorithm is proposed, which maintains a prediction scheme and concurrently constructs the pre-transmission scheduling form, based on the demanded traffic of each available channel. Also, this work includes the presentation of the new algorithm, the comparison of the new algorithm with two prior predicted scheduling schemes, along with the presentation and the description of a series of graphs, which plot the results of our simulation. According to simulation results, it is realized that the proposed algorithm not only improves the output of the network but also reduces the average time delay of the packets in the buffer memories of each node. © 2007 Elsevier Ltd. All rights reserved.},
keywords = {Optical WDM networks, Scheduling, Service sequence},
pubstate = {published},
tppubtype = {article}
}
Media access control (MAC) protocols are methods and ways of accessing the optical fibers, in order to support communication to the nodes of the network. One of the important themes on the design of high-efficient optical networks is the time duration of the schedule process. A good protocol supports effective scheduling methods, without significant time cost. In this work, the performance of a new pre-transmission coordination based protocol on a wavelength division multiplexing (WDM) broadcast and select optical network is studied. A novel scheduling algorithm is proposed, which maintains a prediction scheme and concurrently constructs the pre-transmission scheduling form, based on the demanded traffic of each available channel. Also, this work includes the presentation of the new algorithm, the comparison of the new algorithm with two prior predicted scheduling schemes, along with the presentation and the description of a series of graphs, which plot the results of our simulation. According to simulation results, it is realized that the proposed algorithm not only improves the output of the network but also reduces the average time delay of the packets in the buffer memories of each node. © 2007 Elsevier Ltd. All rights reserved.
2007
P. Sarigiannidis; G. Papadimitriou; A. Pomportsis
A high performance scheduling priority scheme for WDM star networks Journal Article
In: IEEE Communications Letters, vol. 11, no. 1, pp. 76-78, 2007.
Abstract | BibTeX | Tags: Optical WDM networks, Reservation, Scheduling, Traffic prediction | Links:
@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}
}
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.
2006
P.G. Sarigiannidis; G.I. Papadimitriou; A.S. Pomportsis
CS-POSA: A high performance scheduling algorithm for WDM star networks Journal Article
In: Photonic Network Communications, vol. 11, no. 2, pp. 211-227, 2006.
Abstract | BibTeX | Tags: Optical WDM networks, Reservation, Scheduling, Star topology, Traffic prediction | Links:
@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}
}
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.
Address
Internet of Things and Applications Lab
Department of Electrical and Computer Engineering
University of Western Macedonia Campus
ZEP Area, Kozani 50100
Greece
Contact Information
tel: +30 2461 056527
Email: ithaca@uowm.gr
