WFF: A High Performance Scheduling Algorithm for WDM Star Networks that Minimizes Idle Timeslots

  • Home/
  • WFF: A High Performance Scheduling Algorithm for WDM Star Networks that Minimizes Idle Timeslots

WFF: A High Performance Scheduling Algorithm for WDM Star Networks that Minimizes Idle Timeslots

  • Post by:
  • January 1, 2005
  • Comments off

PG Sarigiannidis, GI Papadimitriou, AS Pomportsis: WFF: A High Performance Scheduling Algorithm for WDM Star Networks that Minimizes Idle Timeslots. Proceedings of IEEE/SCVT (Symposium on Communications and Vehicular Technology, Enschede, the Netherlands, 2005.

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.

Links

BibTeX (Download)

@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}
}
Categories:
Skip to content