@article{Dalamagkas2019103,

title = {Dynamic scheduling in TWDM-PONs using game theory},

author = { C. Dalamagkas and P. Sarigiannidis and S. Kapetanakis and I. Moscholios},

url = {https://www.researchgate.net/publication/321881881_Dynamic_scheduling_in_TWDM-PONs_using_game_theory},

doi = {10.1016/j.osn.2017.12.004},

year  = {2019},

date = {2019-01-01},

journal = {Optical Switching and Networking},

volume = {33},

pages = {103-113},

abstract = {Efficient utilization of Passive Optical Networks (PONs) within a broad region of high user numbers, heavy bandwidth demand and large-scale central servicing stations seems a challenging task in explosive high-bandwidth environments. New Generation PONs (NG-PONs) enable multiple channels in both directions and they seem promising towards meeting advanced user applications and services. However, sophisticated bandwidth distribution should be in place to ensure appropriate allocation and efficient management of heavy user demands subject to the available channels. Most of the literature on dynamic bandwidth distribution in NG-PONs usually pertains to heuristic techniques that may be susceptible to expert bias, require substantial knowledge and experience to be applied and their evaluation may focus primarily on minor issues vs. few fundamental major ones. To surpass these limitations game theory can be applied to address efficiently the above heuristic disadvantages and solve the heavy user load-heavy demand over large bandwidth problem in a stochastic way. This work presents the next step forwards using multi-channel multi-stochastic reasoning by utilizing the full channel range to satisfy fairly user requests and high network traffic within a NG-PON2 network. We present the full algorithm as applied to standardized NG-PON2 as well as a series of evaluation experiments to prove its applicability in terms of fairness, goodput and delay. According to the simulation results, the proposed scheme succeeds to provide a fair bandwidth distribution, when triggered, while it is able to a) reduce the experienced delay from 1 to 6 msec and b) double the offered goodput compared to the pure allocation scheme. © 2018 Elsevier B.V.},

keywords = {Game theory, Next-generation passive optical network 2, Scheduling, Time and wavelength division multiplexing},

pubstate = {published},

tppubtype = {article}

}

@article{Kakali2011474,

title = {A novel HMM-based learning framework for improving dynamic wireless push system performance},

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

url = {https://www.researchgate.net/publication/220511276_A_novel_HMM-based_learning_framework_for_improving_dynamic_wireless_push_system_performance},

doi = {10.1016/j.camwa.2011.05.028},

year  = {2011},

date = {2011-01-01},

journal = {Computers and Mathematics with Applications},

volume = {62},

number = {1},

pages = {474-485},

abstract = {A new machine learning framework is introduced in this paper, based on the hidden Markov model (HMM), designed to provide scheduling in dynamic wireless push systems. In realistic wireless systems, the clients' intentions change dynamically, hence a cognitive scheduling scheme is needed to estimate the desirability of the connected clients. The proposed scheduling scheme is enhanced with self-organized HMMs, supporting the network with an estimated expectation of the clients' intentions, since the system's environment characteristics alter dynamically and the base station (server side) has no a priori knowledge of such changes. Compared to the original pure scheme, the proposed machine learning framework succeeds in predicting the clients' information desires and overcomes the limitation of the original static scheme, in terms of mean delay and system efficiency. © 2011 Elsevier Ltd. All rights reserved.},

keywords = {Hidden Markov models, machine learning, Scheduling, wireless networks},

pubstate = {published},

tppubtype = {article}

}

@article{Sarigiannidis201049,

title = {IGFS: A new MAC protocol exploiting heterogeneous propagation delays in the dynamic bandwidth allocation on WDM-EPON},

author = { P.G. Sarigiannidis and S.G. Petridou and G.I. Papadimitriou and M.S. Obaidat},

url = {https://www.researchgate.net/publication/220544845_IGFS_A_new_MAC_protocol_exploiting_heterogeneous_propagation_delays_in_the_dynamic_bandwidth_allocation_on_WDM-EPON},

doi = {10.1109/JSYST.2009.2039886},

year  = {2010},

date = {2010-01-01},

journal = {IEEE Systems Journal},

volume = {4},

number = {1},

pages = {49-56},

abstract = {One of the most challenging issues of the Ethernet passive optical networks' (EPONs) architecture is the bandwidth allocation problem. Various dynamic allocation schemes have been proposed to schedule the subscribers' demands. However, the performance of all these schemes is significantly degraded when the round-trip times (RTTs) of the optical network units (ONUs) are dissimilar, due to the large number of gaps in the transmission schedule. Unfortunately, in real networks, RTTs are usually dissimilar. In this paper a new medium access control (MAC) protocol for multichannel EPONs, namely the Intelligent Gap Filling Strategy (IGFS) is proposed. The IGFS employs two algorithms: the DissimilarityExploitation algorithm, which exploits the RTTs' dissimilarities, and the MinimumLatencyScheduling algorithm, which rearranges the ONUs' service order in order to favor the requests that cause the minimum scheduling latency. © 2010 IEEE.},

keywords = {Passive optical networks, Reservation, Scheduling, WDM-EPONs},

pubstate = {published},

tppubtype = {article}

}

@article{Petridou200942,

title = {A clustering-driven medium access control protocol 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/233835645_A_clustering-driven_medium_access_control_protocol_for_WDM_star_networks},

doi = {10.1016/j.optlastec.2008.04.003},

year  = {2009},

date = {2009-01-01},

journal = {Optics and Laser Technology},

volume = {41},

number = {1},

pages = {42-52},

abstract = {Channel assignment and nodes' service order are two key issues that have to be addressed when designing medium access control (MAC) protocols for WDM star networks. Traditional scheduling techniques consider either channel assignment or nodes' service order issues. Furthermore, they make use of information such as data channels or receivers' availability, without combining it with senders' demands. This paper introduces a novel approach to message scheduling algorithms for WDM star networks, which is driven by clustering techniques. The proposed clustering driven-minimum scheduling latency (CD-MSL) scheme combines all the aforementioned information to create groups of similar source nodes on the basis of the destination nodes of their messages, aiming at rearranging nodes' service order and improving network performance. Extensive simulation results are presented, which indicate that the proposed clustering-driven scheme leads to a significantly higher throughput-delay performance, in comparison to conventional scheduling algorithms. © 2008 Elsevier Ltd. All rights reserved.},

keywords = {Clustering, Scheduling, WDM star networks},

pubstate = {published},

tppubtype = {article}

}

@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}

}

@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}

}

@article{Petridou2008863,

title = {Clustering-based scheduling: A new class of scheduling algorithms for single-hop lightwave networks},

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

url = {https://www.researchgate.net/publication/220548025_Clustering-based_scheduling_A_new_class_of_scheduling_algorithms_for_single-hop_lightwave_networks},

doi = {10.1002/dac.929},

year  = {2008},

date = {2008-01-01},

journal = {International Journal of Communication Systems},

volume = {21},

number = {8},

pages = {863-887},

abstract = {In wavelength division multiplexing (WDM) star networks, the construction of the transmission schedule is a key issue, which essentially affects the network performance. Up to now, classic scheduling techniques consider the nodes' requests in a sequential service order. However, these approaches are static and do not take into account the individual traffic pattern of each node. Owing to this major drawback, they suffer from low performance, especially when operating under asymmetric traffic. In this paper, a new class of scheduling algorithms for WDM star networks, which is based on the use of clustering techniques, is introduced. According to the proposed Clustering-Based Scheduling Algorithm (CBSA), the network's nodes are organized into clusters, based on the number of their requests per channel. Then, their transmission priority is defined beginning from the nodes belonging to clusters with higher demands and ending to the nodes of clusters with fewer requests. The main objective of the proposed scheme is to minimize the length of the schedule by rearranging the nodes' service order. Furthermore, the proposed CBSA scheme adopts a prediction mechanism to minimize the computational complexity of the scheduling algorithm. Extensive simulation results are presented, which clearly indicate that the proposed approach leads to a significantly higher throughput-delay performance when compared with conventional scheduling algorithms. We believe that the proposed clustering-based approach can be the base of a new generation of high-performance scheduling algorithms for WDM star networks.},

keywords = {Clustering, prediction, Reservation, Scheduling, WDM star networks},

pubstate = {published},

tppubtype = {article}

}