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.
Abstract | BibTeX | Tags: Clustering, Scheduling, WDM star networks | Links:
@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.
Abstract | BibTeX | Tags: Clustering, Packet priority, Real-time traffic, Scheduling, WDM star networks | Links:
@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.
V Kakali; P Sarigiannidis; G Papadimitriou; A Pomportsis
A prediction-based scheme for wireless push systems, using a statistical Hidden Markov Model Conference
Proceeding of IEEE/SCVT (Symposium on Communications and Vehicular Technology), Antwerpen, Belgium, 2008.
BibTeX | Tags: | Links:
@conference{Kakali2008,
title = {A prediction-based scheme for wireless push systems, using a statistical Hidden Markov Model},
author = { V Kakali and P Sarigiannidis and G Papadimitriou and A Pomportsis},
editor = { Proceeding of IEEE/SCVT (Symposium on Communications and Vehicular Technology)},
url = {https://www.researchgate.net/publication/233835722_A_prediction-based_scheme_for_wireless_push_systems_using_a_statistical_Hidden_Markov_Model},
year = {2008},
date = {2008-01-01},
booktitle = {Proceeding of IEEE/SCVT (Symposium on Communications and Vehicular Technology)},
address = {Antwerpen, Belgium},
keywords = {},
pubstate = {published},
tppubtype = {conference}
}
V Kakali; P Sarigiannidis; G Papadimitriou; A Pomportsis
DIAS: An adaptive Push System, based on Distributed Learning Automata Conference
Proceeding of IEEE/SCVT (Symposium on Communications and Vehicular Technology), Antwerpen, Belgium, 2008.
BibTeX | Tags: | Links:
@conference{Kakali2008a,
title = {DIAS: An adaptive Push System, based on Distributed Learning Automata},
author = { V Kakali and P Sarigiannidis and G Papadimitriou and A Pomportsis},
editor = { Proceeding of IEEE/SCVT (Symposium on Communications and Vehicular Technology)},
url = {https://www.researchgate.net/publication/233835719_DIAS_An_Adaptive_Push_System_based_on_Distributed_Learning_Automata},
year = {2008},
date = {2008-01-01},
booktitle = {Proceeding of IEEE/SCVT (Symposium on Communications and Vehicular Technology)},
address = {Antwerpen, Belgium},
keywords = {},
pubstate = {published},
tppubtype = {conference}
}
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.
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.
Abstract | BibTeX | Tags: Clustering, prediction, Reservation, Scheduling, WDM star networks | Links:
@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.
P.G. Sarigiannidis; S.G. Petridou; G.I. Papadimitriou; M.S. Obaidat; A.S. Pomportsis
Supporting quality-of-service scheduling in a TT-FR WDM system Journal Article
In: IEEE Systems Journal, vol. 2, no. 4, pp. 525-535, 2008.
Abstract | BibTeX | Tags: Quality-of-service (QoS), Reservation, Scheduling, Wavelength division multiplexing (WDM) star networks | Links:
@article{Sarigiannidis2008525,
title = {Supporting quality-of-service scheduling in a TT-FR WDM system},
author = { P.G. Sarigiannidis and S.G. Petridou and G.I. Papadimitriou and M.S. Obaidat and A.S. Pomportsis},
url = {https://www.researchgate.net/publication/224358108_Supporting_quality-of-service_scheduling_in_a_TT-FR_WDM_system},
doi = {10.1109/JSYST.2008.2009207},
year = {2008},
date = {2008-01-01},
journal = {IEEE Systems Journal},
volume = {2},
number = {4},
pages = {525-535},
abstract = {In this paper, our recent work interval-based orderly scheduling strategy (IOSS) [1] is extended by adding quality-of-service (QoS) provisioning. A revised medium access control (MAC) protocol is introduced, which supports priority-based QoS in wavelength division multiplexing (WDM) networks with star topology. The proposed interval-based prioritized orderly scheduling strategy (IPOSS) operates in a distributed manner, and has the capability of handling channel collision and destinations conflicts in order to provide a collision-free scheduling scheme. Each node in the network is equipped with a tunable transmitter and a fixed receiver, assuring that the scheme is scalable with respect to the number of nodes and channels. Also, each node may accept high- and low-priority packet arrivals. IPOSS favors high-priority packets, without regarding packets' length or packets' destination. Moreover, the proposed scheme differentiates the packet's schedule order by prioritizing the long-length over the short-length packets. It is found that the adopted access control scheme achieves a critically high throughput-delay performance for real-time traffic. Furthermore, IPOSS presents a little bit improved throughput performance than IOSS scheme, since it handles in a different way the case in which two or more requests demand the same amount of transmission time. The traffic involved in the simulation results follows Bernoulli and Poisson distribution, regarding the arrival of the requests. © 2008 IEEE.},
keywords = {Quality-of-service (QoS), Reservation, Scheduling, Wavelength division multiplexing (WDM) star networks},
pubstate = {published},
tppubtype = {article}
}
In this paper, our recent work interval-based orderly scheduling strategy (IOSS) [1] is extended by adding quality-of-service (QoS) provisioning. A revised medium access control (MAC) protocol is introduced, which supports priority-based QoS in wavelength division multiplexing (WDM) networks with star topology. The proposed interval-based prioritized orderly scheduling strategy (IPOSS) operates in a distributed manner, and has the capability of handling channel collision and destinations conflicts in order to provide a collision-free scheduling scheme. Each node in the network is equipped with a tunable transmitter and a fixed receiver, assuring that the scheme is scalable with respect to the number of nodes and channels. Also, each node may accept high- and low-priority packet arrivals. IPOSS favors high-priority packets, without regarding packets' length or packets' destination. Moreover, the proposed scheme differentiates the packet's schedule order by prioritizing the long-length over the short-length packets. It is found that the adopted access control scheme achieves a critically high throughput-delay performance for real-time traffic. Furthermore, IPOSS presents a little bit improved throughput performance than IOSS scheme, since it handles in a different way the case in which two or more requests demand the same amount of transmission time. The traffic involved in the simulation results follows Bernoulli and Poisson distribution, regarding the arrival of the requests. © 2008 IEEE.
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.
Abstract | BibTeX | Tags: Clustering, Optical wavelength division multiplexing (WDM) networks, Reservation, Scheduling | Links:
@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.
2007
S. G. Petridou; P. G. Sarigiannidis; G. I. Papadimitriou; A. S. Pomportsis
An Efficient Clustering Oriented Algorithm for Message Scheduling on WDM Star Networks Conference
2007 14th IEEE Symposium on Communications and Vehicular Technology in the Benelux, IEEE, 2007.
Abstract | BibTeX | Tags: | Links:
@conference{Petridou2007,
title = {An Efficient Clustering Oriented Algorithm for Message Scheduling on 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/4312906_An_Efficient_Clustering_Oriented_Algorithm_for_Message_Scheduling_on_WDM_Star_Networks},
doi = {10.1109/SCVT.2007.4436252},
year = {2007},
date = {2007-11-01},
booktitle = {2007 14th IEEE Symposium on Communications and Vehicular Technology in the Benelux},
journal = {2007 14th IEEE Symposium on Communications and Vehicular Technology in the Benelux, SCVT},
publisher = {IEEE},
abstract = {Message sequencing and channel assignment are two important issues that have to be addressed when designing MAC protocols for optical Wavelength Division Multiplexing (WDM) networks. Up to now, popular approaches deal with channel assignment without however addressing the order in which the messages are scheduled. This paper presents a new reservation-based message scheduling algorithm for WDM star networks which is based on clustering techniques. The proposed Clustering Oriented - Earliest Available Time Scheduling (CO-EATS) creates groups of nodes whose messages are destined to common destination nodes. The goal of CO-EATS is to prevent consecutive messages from being destined to the same node. 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. ©2007 IEEE.},
keywords = {},
pubstate = {published},
tppubtype = {conference}
}
Message sequencing and channel assignment are two important issues that have to be addressed when designing MAC protocols for optical Wavelength Division Multiplexing (WDM) networks. Up to now, popular approaches deal with channel assignment without however addressing the order in which the messages are scheduled. This paper presents a new reservation-based message scheduling algorithm for WDM star networks which is based on clustering techniques. The proposed Clustering Oriented - Earliest Available Time Scheduling (CO-EATS) creates groups of nodes whose messages are destined to common destination nodes. The goal of CO-EATS is to prevent consecutive messages from being destined to the same node. 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. ©2007 IEEE.
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
