The Experts below are selected from a list of 2895 Experts worldwide ranked by ideXlab platform
Gordana Gardasevic - One of the best experts on this subject based on the ideXlab platform.
-
Performance analysis of crosspoint queued crossbar switch with weighted Round Robin Scheduling algorithm under unbalanced bursty traffic
2013 IEEE Symposium on Computers and Communications (ISCC), 2013Co-Authors: Oko Divanovic, Ilutin Radonjic, Gor Radusinovic, Gordana GardasevicAbstract:The possibility of enabling Quality of Service (QoS) in crosspoint-queued packet switches has been presented in this paper. For this purpose, the weighted Round Robin algorithm was simulated and analyzed. The packet delay represents one of the most important parameters in modern networks. Therefore, besides the throughput, we have been investigating the delay that crosspoint queued switch introduce, under bursty unbalanced traffic. Along with the average delay, the truncated maximum cell delay is analyzed. Results show that the weighted Round Robin Scheduling algorithm achieves throughput similar to output-queued switch, under unbalanced bursty traffic, while maintaining low cell delay.
-
ISCC - Performance analysis of crosspoint queued crossbar switch with weighted Round Robin Scheduling algorithm under unbalanced bursty traffic
2013 IEEE Symposium on Computers and Communications (ISCC), 2013Co-Authors: Oko Divanovic, Ilutin Radonjic, Gor Radusinovic, Gordana GardasevicAbstract:The possibility of enabling Quality of Service (QoS) in crosspoint-queued packet switches has been presented in this paper. For this purpose, the weighted Round Robin algorithm was simulated and analyzed. The packet delay represents one of the most important parameters in modern networks. Therefore, besides the throughput, we have been investigating the delay that crosspoint queued switch introduce, under bursty unbalanced traffic. Along with the average delay, the truncated maximum cell delay is analyzed. Results show that the weighted Round Robin Scheduling algorithm achieves throughput similar to output-queued switch, under unbalanced bursty traffic, while maintaining low cell delay.
M. Hamdi - One of the best experts on this subject based on the ideXlab platform.
-
ISCC - Distributed parallel Scheduling algorithms for high-speed virtual output queuing switches
2009 IEEE Symposium on Computers and Communications, 2009Co-Authors: Lotfi Mhamdi, M. HamdiAbstract:This paper presents a novel scalable switching architecture for input queued switches with its proper arbitration algorithms. In contrast to traditional switching architectures where the scheduler is implemented by one single centralized Scheduling device, the proposed architecture connects several single Scheduling devices in series and a distributed Scheduling algorithm is run sequentially on them, whereby the inputs of each single Scheduling device build connections to a group of outputs, considering both their local transmission requests as well as global outputs availability information. We show that a pipeline pattern can be used to increase the efficiency of the Scheduling scheme with Scheduling algorithms running in parallel on all the separate Scheduling devices. We first introduce a distributed parallel Round Robin Scheduling algorithm (DPRR) for the proposed architecture. Through the analysis of simulation results on various admissible traffics, it is shown that the performance of DPRR is much better than, or very close to the performance of, other Round Robin Scheduling algorithms. We also prove that under Bernoulli i.i.d. uniform traffic DPRR achieves 100%throughput. Secondly, we introduce a distributed parallel Round Robin Scheduling algorithm with memory (DPRRM) as an improved version of DPRR to make it stable under any admissible traffic.
-
Scalable Scheduling architectures for high-performance crossbar-based switches
2004 Workshop on High Performance Switching and Routing 2004. HPSR., 2004Co-Authors: M. Hamdi, Qingsheng Hu, Chi Ying TsuiAbstract:This paper presents a novel scalable Scheduling architecture for high-performance crossbar-based switches with virtual output queuing (VOQ) scheme. In contrast to traditional switching architectures where the scheduler is implemented by one single centralized Scheduling device, the proposed Scheduling architecture connects several small Scheduling devices in series and the arbitration algorithm is executed in parallel. Thereby the inputs of each single Scheduling device establish connections to a group of outputs, by considering both their local transmission requests as well as global output availability information. The advantage of this architecture lies in its ability to implement large schedulers (> 64) with several small Scheduling devices as well as in its capability to achieve high-performance Scheduling. We first introduce a distributed parallel Round Robin Scheduling algorithm (DPRR) for the proposed architecture. Through the analysis of simulation results on various admissible traffics, it is shown that the performance of DPRR is much better than the performance of other Round Robin Scheduling algorithms commonly used on centralized schedulers. We also prove that under Bernoulli i.i.d. uniform traffic, DPRR achieves 100% throughput. Moreover, we introduce a distributed parallel Round Robin Scheduling algorithm with memory (DPRRM) as an improved version of DPRR to make it stable under any admissible traffic.
-
Hot Interconnects - Stable Round-Robin Scheduling algorithms for high-performance input queued switches
Proceedings 10th Symposium on High Performance Interconnects, 2002Co-Authors: M. Hamdi, Chi Ying TsuiAbstract:High-performance input-queued switches require high-speed Scheduling algorithms while maintaining good performance. Various Round-Robin Scheduling algorithms for virtual output queuing (VOQ) crossbar-based packet switch architectures have been proposed. It has been demonstrated that they can operate at high speed (e.g., OC192), and are relatively simple to implement in hardware. In particular, a group of fully desynchronized Round-Robin Scheduling algorithms, named SRR (static Round Robin matching), achieve pretty good delay performance while easy to implement. The main problem with these arbitration algorithms is that they are not stable under non-uniform traffic. In this paper, based on the concept of both randomized algorithms and SRR, we propose a new Scheduling algorithm, termed DRDSRR (derandomized rotating double static Round-Robin), which is shown to be stable under all Bernoulli i.i.d. admissible traffic and performs better than SRR.. In addition, we also propose a novel pipelining scheme for the hardware implementation of these Scheduling algorithms which can achieve one more iteration within each cycle time, and hence better performance, when compared with the pipelining schemes used in conventional designs.
-
Stable Round-Robin Scheduling algorithms for high-performance input queued switches
Proceedings 10th Symposium on High Performance Interconnects, 2002Co-Authors: M. Hamdi, Chi Ying TsuiAbstract:High-performance input-queued switches require high-speed Scheduling algorithms while maintaining good performance. Various Round-Robin Scheduling algorithms for virtual output queuing (VOQ) crossbar-based packet switch architectures have been proposed. It has been demonstrated that they can operate at high speed (e.g., OC192), and are relatively simple to implement in hardware. In particular, a group of fully desynchronized Round-Robin Scheduling algorithms, named SRR (static Round Robin matching), achieve pretty good delay performance while easy to implement. The main problem with these arbitration algorithms is that they are not stable under non-uniform traffic. In this paper, based on the concept of both randomized algorithms and SRR, we propose a new Scheduling algorithm, termed DRDSRR (derandomized rotating double static Round-Robin), which is shown to be stable under all Bernoulli i.i.d. admissible traffic and performs better than SRR.. In addition, we also propose a novel pipelining scheme for the hardware implementation of these Scheduling algorithms which can achieve one more iteration within each cycle time, and hence better performance, when compared with the pipelining schemes used in conventional designs.
Zhen Yang - One of the best experts on this subject based on the ideXlab platform.
-
GLOBECOM - Secrecy Outage Probability of Hybrid Satellite-Terrestrial Relay Networks
GLOBECOM 2017 - 2017 IEEE Global Communications Conference, 2017Co-Authors: Zhen YangAbstract:In this paper, we consider a hybrid satellite- terrestrial relay network (HSTRN) composed of a geostationary satellite, a terrestrial destination and multiple terrestrial relays in the presence of an eavesdropper, where the satellite transmits its data to the terrestrial destination via decode-and- forward (DF) relays while the secure transmission from relay to destination may leak to the eavesdropper. We explore the physical-layer security against eavesdropping attacks in HSTRN and propose the optimal relay selection scheme for improving the transmission security. Additionally, the classic Round-Robin Scheduling is also considered to a benchmark scheme. Furthermore, the closed-form expressions of secrecy outage probability for both the Round-Robin Scheduling and optimal relay selection schemes are derived. Finally, numerical results show that our proposed scheme generally outperforms the Round-Robin Scheduling in terms of the secrecy outage probability.
-
Joint source-relay selection for improving wireless physical-layer security
2016 IEEE Global Communications Conference, GLOBECOM 2016 - Proceedings, 2017Co-Authors: Weifeng Cao, Yu Long Zou, Zhen YangAbstract:Abstract-We explore the physical-layer security for a multisource multi-relay wireless network in the presence of an eavesdropper, in which one of multiple sources is scheduled to send its message to a destination with the assistance of multiple decode-and-forward (DF) relays. One eavesdropper is considered at the receiver side, and assumed to be capable of overhearing the transmission from relays to destination. In this paper, the Round-Robin Scheduling and the joint source-relay selection schemes are presented to improve the physical-layer security of the multi-source multi-relay system, and their closedform intercept probability expressions are derived over Rayleigh fadingchannels.Numericalresultsdemonstratethattheproposed joint source-relay selection scheme achieves a better performance than the traditional Round-Robin Scheduling in terms of the intercept probability.
-
GLOBECOM - Joint Source-Relay Selection for Improving Wireless Physical-Layer Security
2016 IEEE Global Communications Conference (GLOBECOM), 2016Co-Authors: Zhen YangAbstract:Abstract-We explore the physical-layer security for a multisource multi-relay wireless network in the presence of an eavesdropper, in which one of multiple sources is scheduled to send its message to a destination with the assistance of multiple decode-and-forward (DF) relays. One eavesdropper is considered at the receiver side, and assumed to be capable of overhearing the transmission from relays to destination. In this paper, the Round-Robin Scheduling and the joint source-relay selection schemes are presented to improve the physical-layer security of the multi-source multi-relay system, and their closedform intercept probability expressions are derived over Rayleigh fadingchannels.Numericalresultsdemonstratethattheproposed joint source-relay selection scheme achieves a better performance than the traditional Round-Robin Scheduling in terms of the intercept probability.
Chi Ying Tsui - One of the best experts on this subject based on the ideXlab platform.
-
Scalable Scheduling architectures for high-performance crossbar-based switches
2004 Workshop on High Performance Switching and Routing 2004. HPSR., 2004Co-Authors: M. Hamdi, Qingsheng Hu, Chi Ying TsuiAbstract:This paper presents a novel scalable Scheduling architecture for high-performance crossbar-based switches with virtual output queuing (VOQ) scheme. In contrast to traditional switching architectures where the scheduler is implemented by one single centralized Scheduling device, the proposed Scheduling architecture connects several small Scheduling devices in series and the arbitration algorithm is executed in parallel. Thereby the inputs of each single Scheduling device establish connections to a group of outputs, by considering both their local transmission requests as well as global output availability information. The advantage of this architecture lies in its ability to implement large schedulers (> 64) with several small Scheduling devices as well as in its capability to achieve high-performance Scheduling. We first introduce a distributed parallel Round Robin Scheduling algorithm (DPRR) for the proposed architecture. Through the analysis of simulation results on various admissible traffics, it is shown that the performance of DPRR is much better than the performance of other Round Robin Scheduling algorithms commonly used on centralized schedulers. We also prove that under Bernoulli i.i.d. uniform traffic, DPRR achieves 100% throughput. Moreover, we introduce a distributed parallel Round Robin Scheduling algorithm with memory (DPRRM) as an improved version of DPRR to make it stable under any admissible traffic.
-
Hot Interconnects - Stable Round-Robin Scheduling algorithms for high-performance input queued switches
Proceedings 10th Symposium on High Performance Interconnects, 2002Co-Authors: M. Hamdi, Chi Ying TsuiAbstract:High-performance input-queued switches require high-speed Scheduling algorithms while maintaining good performance. Various Round-Robin Scheduling algorithms for virtual output queuing (VOQ) crossbar-based packet switch architectures have been proposed. It has been demonstrated that they can operate at high speed (e.g., OC192), and are relatively simple to implement in hardware. In particular, a group of fully desynchronized Round-Robin Scheduling algorithms, named SRR (static Round Robin matching), achieve pretty good delay performance while easy to implement. The main problem with these arbitration algorithms is that they are not stable under non-uniform traffic. In this paper, based on the concept of both randomized algorithms and SRR, we propose a new Scheduling algorithm, termed DRDSRR (derandomized rotating double static Round-Robin), which is shown to be stable under all Bernoulli i.i.d. admissible traffic and performs better than SRR.. In addition, we also propose a novel pipelining scheme for the hardware implementation of these Scheduling algorithms which can achieve one more iteration within each cycle time, and hence better performance, when compared with the pipelining schemes used in conventional designs.
-
Stable Round-Robin Scheduling algorithms for high-performance input queued switches
Proceedings 10th Symposium on High Performance Interconnects, 2002Co-Authors: M. Hamdi, Chi Ying TsuiAbstract:High-performance input-queued switches require high-speed Scheduling algorithms while maintaining good performance. Various Round-Robin Scheduling algorithms for virtual output queuing (VOQ) crossbar-based packet switch architectures have been proposed. It has been demonstrated that they can operate at high speed (e.g., OC192), and are relatively simple to implement in hardware. In particular, a group of fully desynchronized Round-Robin Scheduling algorithms, named SRR (static Round Robin matching), achieve pretty good delay performance while easy to implement. The main problem with these arbitration algorithms is that they are not stable under non-uniform traffic. In this paper, based on the concept of both randomized algorithms and SRR, we propose a new Scheduling algorithm, termed DRDSRR (derandomized rotating double static Round-Robin), which is shown to be stable under all Bernoulli i.i.d. admissible traffic and performs better than SRR.. In addition, we also propose a novel pipelining scheme for the hardware implementation of these Scheduling algorithms which can achieve one more iteration within each cycle time, and hence better performance, when compared with the pipelining schemes used in conventional designs.
Oko Divanovic - One of the best experts on this subject based on the ideXlab platform.
-
Performance analysis of crosspoint queued crossbar switch with weighted Round Robin Scheduling algorithm under unbalanced bursty traffic
2013 IEEE Symposium on Computers and Communications (ISCC), 2013Co-Authors: Oko Divanovic, Ilutin Radonjic, Gor Radusinovic, Gordana GardasevicAbstract:The possibility of enabling Quality of Service (QoS) in crosspoint-queued packet switches has been presented in this paper. For this purpose, the weighted Round Robin algorithm was simulated and analyzed. The packet delay represents one of the most important parameters in modern networks. Therefore, besides the throughput, we have been investigating the delay that crosspoint queued switch introduce, under bursty unbalanced traffic. Along with the average delay, the truncated maximum cell delay is analyzed. Results show that the weighted Round Robin Scheduling algorithm achieves throughput similar to output-queued switch, under unbalanced bursty traffic, while maintaining low cell delay.
-
ISCC - Performance analysis of crosspoint queued crossbar switch with weighted Round Robin Scheduling algorithm under unbalanced bursty traffic
2013 IEEE Symposium on Computers and Communications (ISCC), 2013Co-Authors: Oko Divanovic, Ilutin Radonjic, Gor Radusinovic, Gordana GardasevicAbstract:The possibility of enabling Quality of Service (QoS) in crosspoint-queued packet switches has been presented in this paper. For this purpose, the weighted Round Robin algorithm was simulated and analyzed. The packet delay represents one of the most important parameters in modern networks. Therefore, besides the throughput, we have been investigating the delay that crosspoint queued switch introduce, under bursty unbalanced traffic. Along with the average delay, the truncated maximum cell delay is analyzed. Results show that the weighted Round Robin Scheduling algorithm achieves throughput similar to output-queued switch, under unbalanced bursty traffic, while maintaining low cell delay.
