2007
C. Papazoglou; P.G. Sarigiannidis; G.I. Papadimitriou; A.S. Pomportsis
A new priority scheme for WDM star networks Conference
2007.
Abstract | BibTeX | Tags: | Links:
@conference{Papazoglou2007,
title = {A new priority scheme for WDM star networks},
author = { C. Papazoglou and P.G. Sarigiannidis and G.I. Papadimitriou and A.S. Pomportsis},
url = {https://www.researchgate.net/publication/4312889_A_new_priority_scheme_for_WDM_star_networks},
doi = {10.1109/SCVT.2007.4436234},
year = {2007},
date = {2007-01-01},
journal = {2007 14th IEEE Symposium on Communications and Vehicular Technology in the Benelux, SCVT},
abstract = {This paper presents a new scheduling protocol for WDM star networks. The new protocol (Priority Scheme Earliest Available Time Scheduling - PS-EATS) is based on the previously proposed EATS protocol which assigns the earliest available data channel to each node that has a message to transmit. PS-EATS modifies the order in which the nodes' requests are processed and allows long messages to be processed ahead of shorter ones. Simulation results show that PS-EATS improves network performance in terms of throughput and also marginally reduces the mean packet delay. ©2007 IEEE.},
keywords = {},
pubstate = {published},
tppubtype = {conference}
}
This paper presents a new scheduling protocol for WDM star networks. The new protocol (Priority Scheme Earliest Available Time Scheduling - PS-EATS) is based on the previously proposed EATS protocol which assigns the earliest available data channel to each node that has a message to transmit. PS-EATS modifies the order in which the nodes' requests are processed and allows long messages to be processed ahead of shorter ones. Simulation results show that PS-EATS improves network performance in terms of throughput and also marginally reduces the mean packet delay. ©2007 IEEE.
S.G. Petridou; P.G. Sarigiannidis; G.I. Papadimitriou; A.S. Pomportsis
2007.
Abstract | BibTeX | Tags: | Links:
@conference{Petridou2007b,
title = {Clustering based scheduling: A new approach to the design of scheduling algorithms for WDM star networks},
author = { S.G. Petridou and P.G. Sarigiannidis and G.I. Papadimitriou and A.S. Pomportsis},
url = {https://www.researchgate.net/publication/4312904_Clustering_Based_Scheduling_A_New_Approach_to_the_Design_of_Scheduling_Algorithms_for_WDM_Star_Networks},
doi = {10.1109/SCVT.2007.4436255},
year = {2007},
date = {2007-01-01},
journal = {2007 14th IEEE Symposium on Communications and Vehicular Technology in the Benelux, SCVT},
abstract = {Scheduling algorithms in Wavelength Division Multiplexing (WDM) single hope networks aim at producing an effective schedule in order to improve the networks' performance. Up to now, popular approaches schedule network traffic based on nodes' requests which are considered in a sequential service order. This paper presents a novel packet scheduling scheme for WDM star networks based on clustering techniques. Our Clustering Based Scheduling Algorithm (CBSA) organizes the nodes of a network into groups (i.e. clusters) according to the number of their requests per channel and then it defines their transmission priority beginning from the nodes belonging to the cluster with greater demands and ending to the nodes of cluster with fewer requests. The simulation results have shown that the proposed approach improves network performance since it results in higher network throughput keeping mean packet delay at low levels in comparison with conventional scheduling algorithms. ©2007 IEEE.},
keywords = {},
pubstate = {published},
tppubtype = {conference}
}
Scheduling algorithms in Wavelength Division Multiplexing (WDM) single hope networks aim at producing an effective schedule in order to improve the networks' performance. Up to now, popular approaches schedule network traffic based on nodes' requests which are considered in a sequential service order. This paper presents a novel packet scheduling scheme for WDM star networks based on clustering techniques. Our Clustering Based Scheduling Algorithm (CBSA) organizes the nodes of a network into groups (i.e. clusters) according to the number of their requests per channel and then it defines their transmission priority beginning from the nodes belonging to the cluster with greater demands and ending to the nodes of cluster with fewer requests. The simulation results have shown that the proposed approach improves network performance since it results in higher network throughput keeping mean packet delay at low levels in comparison with conventional scheduling algorithms. ©2007 IEEE.
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
A high performance channel sorting scheduling algorithm based on largest packet Conference
Patras, Greece, 2006.
Abstract | BibTeX | Tags: | Links:
@conference{Sarigiannidis2006628,
title = {A high performance channel sorting scheduling algorithm based on largest packet},
author = { P.G. Sarigiannidis and G.I. Papadimitriou and A.S. Pomportsis},
url = {https://www.researchgate.net/publication/233835671_A_High_Performance_Channel_Sorting_Scheduling_Algorithm_Based_On_Largest_Packet},
year = {2006},
date = {2006-01-01},
journal = {Proceedings of CSNDSP (Communication Systems, Networks and Digital Signal Processing)},
address = {Patras, Greece},
abstract = {We present a new scheduling algorithm, which is a synthesis of all the remarkable features of pretransmission coordination-based protocols for broadcast and select star networks. The new algorithm follows a novel policy for switching, in order to improve the efficiency of the network. It is based on all notable elements of a specific family of protocols and tries to accommodate the different ways of scheduling. The protocol manages to bring some improvement, in terms of channel utilization and network throughput, which is proven by simulation results. © 2006 IEEE.},
keywords = {},
pubstate = {published},
tppubtype = {conference}
}
We present a new scheduling algorithm, which is a synthesis of all the remarkable features of pretransmission coordination-based protocols for broadcast and select star networks. The new algorithm follows a novel policy for switching, in order to improve the efficiency of the network. It is based on all notable elements of a specific family of protocols and tries to accommodate the different ways of scheduling. The protocol manages to bring some improvement, in terms of channel utilization and network throughput, which is proven by simulation results. © 2006 IEEE.
P.G. Sarigiannidis; G.I. Papadimitriou; A.S. Pomportsis
SASA: A synthesis scheduling algorithm with prediction and sorting features Conference
2006.
Abstract | BibTeX | Tags: | Links:
@conference{Sarigiannidis2006628b,
title = {SASA: A synthesis scheduling algorithm with prediction and sorting features},
author = { P.G. Sarigiannidis and G.I. Papadimitriou and A.S. Pomportsis},
url = {https://www.researchgate.net/publication/221505696_SASA_A_Synthesis_Scheduling_Algorithm_with_Prediction_and_Sorting_Features},
doi = {10.1109/ISCC.2006.140},
year = {2006},
date = {2006-01-01},
journal = {Proceedings - International Symposium on Computers and Communications},
pages = {628-633},
abstract = {We present a new scheduling algorithm, which is a synthesis of all the remarkable features of pretransmission coordination-based protocols for broadcast and select star networks. The new algorithm follows a novel policy for switching, in order to improve the efficiency of the network. It is based on all notable elements of a specific family of protocols and tries to accommodate the different ways of scheduling. The protocol manages to bring some improvement, in terms of channel utilization and network throughput, which is proven by simulation results. © 2006 IEEE.},
keywords = {},
pubstate = {published},
tppubtype = {conference}
}
We present a new scheduling algorithm, which is a synthesis of all the remarkable features of pretransmission coordination-based protocols for broadcast and select star networks. The new algorithm follows a novel policy for switching, in order to improve the efficiency of the network. It is based on all notable elements of a specific family of protocols and tries to accommodate the different ways of scheduling. The protocol manages to bring some improvement, in terms of channel utilization and network throughput, which is proven by simulation results. © 2006 IEEE.
P.G. Sarigiannidis; G.I. Papadimitriou; A.S. Pomportsis
A new channel priority scheduling technique for WDM star networks Conference
Patras, Greece, 2006.
Abstract | BibTeX | Tags: | Links:
@conference{Sarigiannidis2006628c,
title = {A new channel priority scheduling technique for WDM star networks},
author = { P.G. Sarigiannidis and G.I. Papadimitriou and A.S. Pomportsis},
url = {https://www.researchgate.net/publication/233835667_A_New_Channel_Priority_Scheduling_Technique_for_WDM_Star_Networks},
year = {2006},
date = {2006-01-01},
journal = {Proceedings of CSNDSP (Communication Systems, Networks and Digital Signal Processing)},
address = {Patras, Greece},
abstract = {We present a new scheduling algorithm, which is a synthesis of all the remarkable features of pretransmission coordination-based protocols for broadcast and select star networks. The new algorithm follows a novel policy for switching, in order to improve the efficiency of the network. It is based on all notable elements of a specific family of protocols and tries to accommodate the different ways of scheduling. The protocol manages to bring some improvement, in terms of channel utilization and network throughput, which is proven by simulation results. © 2006 IEEE.},
keywords = {},
pubstate = {published},
tppubtype = {conference}
}
We present a new scheduling algorithm, which is a synthesis of all the remarkable features of pretransmission coordination-based protocols for broadcast and select star networks. The new algorithm follows a novel policy for switching, in order to improve the efficiency of the network. It is based on all notable elements of a specific family of protocols and tries to accommodate the different ways of scheduling. The protocol manages to bring some improvement, in terms of channel utilization and network throughput, which is proven by simulation results. © 2006 IEEE.
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.
P.G. Sarigiannidis; G.I. Papadimitriou; A.S. Pomportsis
A high-throughput scheduling technique, with idle timeslot elimination mechanism Journal Article
In: Journal of Lightwave Technology, vol. 24, no. 12, pp. 4811-4827, 2006.
Abstract | BibTeX | Tags: Demand matrix, Optical wavelength-division-multiplexing (WDM) networks, Reservation, Scheduling, Traffic prediction | Links:
@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}
}
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.
2005
PG Sarigiannidis; GI Papadimitriou; AS Pomportsis
WFF: A High Performance Scheduling Algorithm for WDM Star Networks that Minimizes Idle Timeslots Conference
Proceedings of IEEE/SCVT (Symposium on Communications and Vehicular Technology, Enschede, the Netherlands, 2005.
Abstract | BibTeX | Tags: | Links:
@conference{Sarigiannidis2005a,
title = {WFF: A High Performance Scheduling Algorithm for WDM Star Networks that Minimizes Idle Timeslots},
author = { PG Sarigiannidis and GI Papadimitriou and AS Pomportsis},
editor = { Proceedings of IEEE/SCVT (Symposium on Communications and Vehicular Technology)},
url = {https://www.researchgate.net/publication/233835661_WFF_A_High_Performance_Scheduling_Algorithm_for_WDM_Star_Networks_that_Minimizes_Idle_Timeslots},
year = {2005},
date = {2005-01-01},
booktitle = {Proceedings of IEEE/SCVT (Symposium on Communications and Vehicular Technology},
address = {Enschede, the Netherlands},
abstract = {This paper introduces a new packet scheduling algorithm for WDM star networks, named CS-POSA. This algorithm utilizes Markov chains in order to predict the transmission requests of the network nodes and thus reduce the calculation time of the final scheduling matrix. The resulting protocol is pre-transmission coordination-based without packet collisions. The proposed algorithm pipelines the schedule computation process and introduces a new order in which nodes’ requests are processed. This innovative feature is shown to increase network throughput with negligible impact on the mean delay and the delay variance.},
keywords = {},
pubstate = {published},
tppubtype = {conference}
}
This paper introduces a new packet scheduling algorithm for WDM star networks, named CS-POSA. This algorithm utilizes Markov chains in order to predict the transmission requests of the network nodes and thus reduce the calculation time of the final scheduling matrix. The resulting protocol is pre-transmission coordination-based without packet collisions. The proposed algorithm pipelines the schedule computation process and introduces a new order in which nodes’ requests are processed. This innovative feature is shown to increase network throughput with negligible impact on the mean delay and the delay variance.
PG Sarigiannidis; GI Papadimitriou; AS Pomportsis
A New Prediction and Channel Sorting Based Scheduling Algorithm for WDM Star Networks Conference
Proceedings of IEEE/SCVT (Symposium on Communications and Vehicular Technology), Enschede, the Netherlands, 2005.
Abstract | BibTeX | Tags: | Links:
@conference{Sarigiannidis2005b,
title = {A New Prediction and Channel Sorting Based Scheduling Algorithm for WDM Star Networks},
author = { PG Sarigiannidis and GI Papadimitriou and AS Pomportsis},
editor = { Proceedings of IEEE/SCVT (Symposium on Communications and Vehicular Technology)},
url = {https://www.researchgate.net/publication/233835660_A_New_Prediction_and_Channel_Sorting_Based_Scheduling_Algorithm_for_WDM_Star_Networks},
year = {2005},
date = {2005-01-01},
booktitle = {Proceedings of IEEE/SCVT (Symposium on Communications and Vehicular Technology)},
address = {Enschede, the Netherlands},
abstract = {This paper introduces a new packet scheduling algorithm for WDM star networks, named CS-POSA. This algorithm utilizes Markov chains in order to predict the transmission requests of the network nodes and thus reduce the calculation time of the final scheduling matrix. The resulting protocol is pre-transmission coordination-based without packet collisions. The proposed algorithm pipelines the schedule computation process and introduces a new order in which nodes’ requests are processed. This innovative feature is shown to increase network throughput with negligible impact on the mean delay and the delay variance.},
keywords = {},
pubstate = {published},
tppubtype = {conference}
}
This paper introduces a new packet scheduling algorithm for WDM star networks, named CS-POSA. This algorithm utilizes Markov chains in order to predict the transmission requests of the network nodes and thus reduce the calculation time of the final scheduling matrix. The resulting protocol is pre-transmission coordination-based without packet collisions. The proposed algorithm pipelines the schedule computation process and introduces a new order in which nodes’ requests are processed. This innovative feature is shown to increase network throughput with negligible impact on the mean delay and the delay variance.
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
