2019
M. Al-Saadi; B.V. Ghita; S. Shiaeles; P. Sarigiannidis
A novel approach for performance-based clustering and anagement of network traffic flows Conference
2019.
Περίληψη | BibTeX | Ετικέτες: Clustering, Network performance, SDN, Unsupervised algorithm | Σύνδεσμοι:
@conference{Al-Saadi20192025,
title = {A novel approach for performance-based clustering and anagement of network traffic flows},
author = { M. Al-Saadi and B.V. Ghita and S. Shiaeles and P. Sarigiannidis},
url = {https://www.researchgate.net/publication/334634109_A_novel_approach_for_performance-based_clustering_and_anagement_of_network_traffic_flows},
doi = {10.1109/IWCMC.2019.8766728},
year = {2019},
date = {2019-01-01},
journal = {2019 15th International Wireless Communications and Mobile Computing Conference, IWCMC 2019},
pages = {2025-2030},
abstract = {Management of network performance comprises numerous functions such as measuring, modelling, planning and optimising networks to ensure that they transmit traffic with the speed, capacity and reliability expected by the applications, each with different requirements for bandwidth and delay. Overall, the objective of this paper is to propose a novel mechanism to optimise the network resource allocation through supporting the routing of individual flows, by clustering them based on performance and integrating the respective clusters with an SDN scheme. In this paper we have employed a particular set of traffic features then applied data reduction and unsupervised machine learning techniques, to derive an Internet traffic performance-based clustering model. Finally, the resulting data clusters are integrated within a unified SDN architectural solution, which improves network management by finding nearly optimal flow routing, to be evaluated against a number of traffic data sources. © 2019 IEEE.},
keywords = {Clustering, Network performance, SDN, Unsupervised algorithm},
pubstate = {published},
tppubtype = {conference}
}
Management of network performance comprises numerous functions such as measuring, modelling, planning and optimising networks to ensure that they transmit traffic with the speed, capacity and reliability expected by the applications, each with different requirements for bandwidth and delay. Overall, the objective of this paper is to propose a novel mechanism to optimise the network resource allocation through supporting the routing of individual flows, by clustering them based on performance and integrating the respective clusters with an SDN scheme. In this paper we have employed a particular set of traffic features then applied data reduction and unsupervised machine learning techniques, to derive an Internet traffic performance-based clustering model. Finally, the resulting data clusters are integrated within a unified SDN architectural solution, which improves network management by finding nearly optimal flow routing, to be evaluated against a number of traffic data sources. © 2019 IEEE.
2009
S.G. Petridou; P.G. Sarigiannidis; G.I. Papadimitriou; A.S. Pomportsis
A clustering-driven medium access control protocol for WDM star networks Journal Article
In: Optics and Laser Technology, vol. 41, no. 1, pp. 42-52, 2009.
Περίληψη | BibTeX | Ετικέτες: Clustering, Scheduling, WDM star networks | Σύνδεσμοι:
@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}
}
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.
2008
S.G. Petridou; P.G. Sarigiannidis; G.I. Papadimitriou; A.S. Pomportsis
A high performance clustering-driven MAC protocol for single-hop lightwave networks Conference
2008.
Περίληψη | BibTeX | Ετικέτες: Clustering, Scheduling, WDM star networks | Σύνδεσμοι:
@conference{Petridou2008222,
title = {A high performance clustering-driven MAC protocol 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/4368600_A_high_performance_clustering-driven_MAC_protocol_for_single-hop_lightwave_networks},
doi = {10.1109/MELCON.2008.4618438},
year = {2008},
date = {2008-01-01},
journal = {Proceedings of the Mediterranean Electrotechnical Conference - MELECON},
pages = {222-227},
abstract = {A Medium Access Control (MAC) protocol for Wavelength Division Multiplexing (WDM) star networks has to handle two key issues: channel assignment and nodes' service order. Traditional scheduling techniques define the nodes transmissions and receptions, by considering either channel assignment or nodes' service order issue. Furthermore, they take into account data channels or receivers' availability, but they ignore the similarity between nodes' demands which affect the scheduling length. In this paper a novel, clustering-driven scheduling approach is introduced. The proposed Clustering Driven - Minimum Scheduling Latency (CD-MSL) scheme combines all the aforementioned information and creates groups of source nodes which present similar demands on the basis of their message destination nodes. Based on the obtained clusters, CD-MSL improves network performance by rearranging the nodes' service order. Simulation results indicate that the proposed clustering-driven scheme leads to a significantly higher throughput-delay performance, in comparison to conventional scheduling algorithms. © 2008 IEEE.},
keywords = {Clustering, Scheduling, WDM star networks},
pubstate = {published},
tppubtype = {conference}
}
A Medium Access Control (MAC) protocol for Wavelength Division Multiplexing (WDM) star networks has to handle two key issues: channel assignment and nodes' service order. Traditional scheduling techniques define the nodes transmissions and receptions, by considering either channel assignment or nodes' service order issue. Furthermore, they take into account data channels or receivers' availability, but they ignore the similarity between nodes' demands which affect the scheduling length. In this paper a novel, clustering-driven scheduling approach is introduced. The proposed Clustering Driven - Minimum Scheduling Latency (CD-MSL) scheme combines all the aforementioned information and creates groups of source nodes which present similar demands on the basis of their message destination nodes. Based on the obtained clusters, CD-MSL improves network performance by rearranging the nodes' service order. Simulation results indicate that the proposed clustering-driven scheme leads to a significantly higher throughput-delay performance, in comparison to conventional scheduling algorithms. © 2008 IEEE.
S.G. Petridou; P.G. Sarigiannidis; G.I. Papadimitriou; A.S. Pomportsis
Nodes' clustering in WDM star networks with real-time traffic Conference
2008.
Περίληψη | BibTeX | Ετικέτες: Clustering, Packet priority, Real-time traffic, Scheduling, WDM star networks | Σύνδεσμοι:
@conference{Petridou2008252,
title = {Nodes' clustering in WDM star networks with real-time traffic},
author = { S.G. Petridou and P.G. Sarigiannidis and G.I. Papadimitriou and A.S. Pomportsis},
url = {https://www.researchgate.net/publication/4368607_Nodes%27_clustering_in_WDM_star_networks_with_real-time_traffic?_sg=49FeKpOhf_KQ-DjyqVqurGYS9oknXmSMnVaXKNKptTUl_QQNCmDNMuteoEPx_3tqcDKDNKFz_LUrt0Q},
doi = {10.1109/MELCON.2008.4618443},
year = {2008},
date = {2008-01-01},
journal = {Proceedings of the Mediterranean Electrotechnical Conference - MELECON},
pages = {252-257},
abstract = {This paper proposes a novel scheduling scheme, namely Node Clustering with Prioritized Scheduling (NOC-PS), which is designed to handle real-time traffic in Wavelength Division Multiplexing (WDM) star networks. NOC-PS is based on clustering techniques, while it takes into account the priority information of data packets. The clustering process aims at organizing the network nodes into groups in terms of their packets' requests per channel. Then, NOC-PS rearranges the nodes' service order beginning from the cluster with long-length requests and ending to the cluster with short-length requests. The novelty of NOC-PS is that it applies separate clustering to nodes with high and low priority packets, while it also differentiates their scheduling, since high-priority packets have the privilege of being scheduled prior to low-priority ones. The simulation results indicate that the proposed scheme leads to a significantly higher throughput-delay performance for realtime traffic, without sacrificing the performance of non-real-time traffic. © 2008 IEEE.},
keywords = {Clustering, Packet priority, Real-time traffic, Scheduling, WDM star networks},
pubstate = {published},
tppubtype = {conference}
}
This paper proposes a novel scheduling scheme, namely Node Clustering with Prioritized Scheduling (NOC-PS), which is designed to handle real-time traffic in Wavelength Division Multiplexing (WDM) star networks. NOC-PS is based on clustering techniques, while it takes into account the priority information of data packets. The clustering process aims at organizing the network nodes into groups in terms of their packets' requests per channel. Then, NOC-PS rearranges the nodes' service order beginning from the cluster with long-length requests and ending to the cluster with short-length requests. The novelty of NOC-PS is that it applies separate clustering to nodes with high and low priority packets, while it also differentiates their scheduling, since high-priority packets have the privilege of being scheduled prior to low-priority ones. The simulation results indicate that the proposed scheme leads to a significantly higher throughput-delay performance for realtime traffic, without sacrificing the performance of non-real-time traffic. © 2008 IEEE.
S.G. Petridou; P.G. Sarigiannidis; G.I. Papadimitriou; A.S. Pomportsis
Clustering-based scheduling: A new class of scheduling algorithms for single-hop lightwave networks Journal Article
In: International Journal of Communication Systems, vol. 21, no. 8, pp. 863-887, 2008.
Περίληψη | BibTeX | Ετικέτες: Clustering, prediction, Reservation, Scheduling, WDM star networks | Σύνδεσμοι:
@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}
}
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.
S.G. Petridou; P.G. Sarigiannidis; G.I. Papadimitriou; A.S. Pomportsis
On the use of clustering algorithms for message scheduling in WDM star networks Journal Article
In: Journal of Lightwave Technology, vol. 26, no. 17, pp. 2999-3010, 2008.
Περίληψη | BibTeX | Ετικέτες: Clustering, Optical wavelength division multiplexing (WDM) networks, Reservation, Scheduling | Σύνδεσμοι:
@article{Petridou20082999,
title = {On the use of clustering algorithms for message scheduling in 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/224367225_On_the_Use_of_Clustering_Algorithms_for_Message_Scheduling_in_WDM_Star_Networks},
doi = {10.1109/JLT.2008.926913},
year = {2008},
date = {2008-01-01},
journal = {Journal of Lightwave Technology},
volume = {26},
number = {17},
pages = {2999-3010},
abstract = {Scheduling algorithms in wavelength division multiplexing (WDM) single-hop networks aim at producing an effective schedule in order to improve the networks' performance. Apart from channel assignment, the message sequencing is an important issue that have to be addressed when designing media access control (MAC) protocols for WDM networks. Up until now, popular approaches have not extensively addressed the order in which the messages are scheduled even though the messages' service order can considerably contribute to the advance of network performance. This paper introduces a new approach to the design of message scheduling algorithms for WDM star networks, which is based on the use of clustering techniques. The proposed clustering oriented - earliest available time scheduling (CO-EATS) creates groups of nodes whose messages are destined to common nodes. The goal of the proposed CO-EATS scheme is to decrease the probability of scheduling messages to the same destination at successive order. The simulation results have shown that the proposed scheme improves channel utilization and as a result it leads to higher network throughput while it keeps mean packet delay at low levels in comparison with conventional scheduling algorithms. © 2008 IEEE.},
keywords = {Clustering, Optical wavelength division multiplexing (WDM) networks, Reservation, Scheduling},
pubstate = {published},
tppubtype = {article}
}
Scheduling algorithms in wavelength division multiplexing (WDM) single-hop networks aim at producing an effective schedule in order to improve the networks' performance. Apart from channel assignment, the message sequencing is an important issue that have to be addressed when designing media access control (MAC) protocols for WDM networks. Up until now, popular approaches have not extensively addressed the order in which the messages are scheduled even though the messages' service order can considerably contribute to the advance of network performance. This paper introduces a new approach to the design of message scheduling algorithms for WDM star networks, which is based on the use of clustering techniques. The proposed clustering oriented - earliest available time scheduling (CO-EATS) creates groups of nodes whose messages are destined to common nodes. The goal of the proposed CO-EATS scheme is to decrease the probability of scheduling messages to the same destination at successive order. The simulation results have shown that the proposed scheme improves channel utilization and as a result it leads to higher network throughput while it keeps mean packet delay at low levels in comparison with conventional scheduling algorithms. © 2008 IEEE.
Διεύθυνση
Internet of Things and Applications Lab
Department of Electrical and Computer Engineering
University of Western Macedonia Campus
ZEP Area, Kozani 50100
Greece
Πληροφορίες Επικοινωνίας
tel: +30 2461 056527
Email: ithaca@uowm.gr
