Pub Date : 2017-07-05DOI: 10.1109/HPSR.2017.7968681
A. Shakeri, Xue Wang, M. Razo, A. Fumagalli, Miquel Garrich Alabarce, E. Oki, N. Yamanaka
Optical networks are well suited to support massive data exchanges between data centers. Elephant traffic flows can be routed over provisioned and dedicated lightpaths (optical flows) while other (mice) flows, which are routed by electronic switches, are unaffected. In some solutions, Wavelength-Selective Switches (WSSs) are employed in the optical nodes to individually route the lightpath towards its destination. WSSs take time to be switched and delay the lightpath setup time. In this paper, the authors compare three service policies for WSS devices aiming to reduce the lightpath setup and tear down times. The conventional service policy assumes that each setup (tear down) request is handled individually. Two other service policies assume that groups of setup (tear down) requests are handled together by the WSS. These policies are implemented in a discrete event simulator, which is used to estimate the end-to-end lightpath setup and tear down time across an arbitrary mesh network. Simulation results show that group service policies outperform the conventional policy at high loads. The grouping policies are useful to reduce the lightpath setup time especially in the presence of lightpaths that are frequently set up and have relatively short holding time (short duration of elephant-optical flows).
{"title":"Estimating the effect of Wavelength Selective Switch latency on optical flow switching performance","authors":"A. Shakeri, Xue Wang, M. Razo, A. Fumagalli, Miquel Garrich Alabarce, E. Oki, N. Yamanaka","doi":"10.1109/HPSR.2017.7968681","DOIUrl":"https://doi.org/10.1109/HPSR.2017.7968681","url":null,"abstract":"Optical networks are well suited to support massive data exchanges between data centers. Elephant traffic flows can be routed over provisioned and dedicated lightpaths (optical flows) while other (mice) flows, which are routed by electronic switches, are unaffected. In some solutions, Wavelength-Selective Switches (WSSs) are employed in the optical nodes to individually route the lightpath towards its destination. WSSs take time to be switched and delay the lightpath setup time. In this paper, the authors compare three service policies for WSS devices aiming to reduce the lightpath setup and tear down times. The conventional service policy assumes that each setup (tear down) request is handled individually. Two other service policies assume that groups of setup (tear down) requests are handled together by the WSS. These policies are implemented in a discrete event simulator, which is used to estimate the end-to-end lightpath setup and tear down time across an arbitrary mesh network. Simulation results show that group service policies outperform the conventional policy at high loads. The grouping policies are useful to reduce the lightpath setup time especially in the presence of lightpaths that are frequently set up and have relatively short holding time (short duration of elephant-optical flows).","PeriodicalId":169489,"journal":{"name":"2017 IEEE 18th International Conference on High Performance Switching and Routing (HPSR)","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114065041","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-06-18DOI: 10.1109/HPSR.2017.7968677
Zifan Zhou, Ying Yan, S. Ruepp, M. Berger
A standard priority-queuing system is capable of arranging packets with different traffic classes to guarantee a relatively low latency for the high priority traffic. However, in practical cases, severe delay may be caused by starting a large, low-priority frame ahead of a time-critical frame. In this paper, interspersed express traffic is evaluated, which enables preemption of non-time-critical transmission, in particular, the preemptive queuing system allows the cut-through transmission for critical traffic and minimizes the jitter. We analyse the performance of packet preemption through a system level simulation in Riverbed Modeler. The simulation is complemented by numerical analysis which provides the average queuing delay for both types of traffic (preemptable and express). Furthermore, the paper describes an approach to implement the packet preemption solution on an FPGA in VHDL, which illustrates the complexity of hardware implementation.
{"title":"Analysis and implementation of packet preemption for Time Sensitive Networks","authors":"Zifan Zhou, Ying Yan, S. Ruepp, M. Berger","doi":"10.1109/HPSR.2017.7968677","DOIUrl":"https://doi.org/10.1109/HPSR.2017.7968677","url":null,"abstract":"A standard priority-queuing system is capable of arranging packets with different traffic classes to guarantee a relatively low latency for the high priority traffic. However, in practical cases, severe delay may be caused by starting a large, low-priority frame ahead of a time-critical frame. In this paper, interspersed express traffic is evaluated, which enables preemption of non-time-critical transmission, in particular, the preemptive queuing system allows the cut-through transmission for critical traffic and minimizes the jitter. We analyse the performance of packet preemption through a system level simulation in Riverbed Modeler. The simulation is complemented by numerical analysis which provides the average queuing delay for both types of traffic (preemptable and express). Furthermore, the paper describes an approach to implement the packet preemption solution on an FPGA in VHDL, which illustrates the complexity of hardware implementation.","PeriodicalId":169489,"journal":{"name":"2017 IEEE 18th International Conference on High Performance Switching and Routing (HPSR)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123296629","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-06-18DOI: 10.1109/HPSR.2017.7968674
N. Jara, G. Rubino, Reinaldo Vallejos Campos
This paper proposes a new method to compute alternate routes for multiple fault tolerance on Dynamic WDM Optical Networks. The method allows to obtain all the paths that replace the primary routes affected by one or several failures. Additional paths, called secondary routes, are used to keep each user connected to the network, including cases where multiple simultaneous link failures occur. The method also allows to obtain the number of wavelengths in each link of the network, computed such that the blocking probability of each connection is less than a pre-defined threshold (which is a network design parameter), in spite of the occurrence of k simultaneous link failures, with k ≥ 1. The solution obtained by the new algorithm is significantly more efficient than the result of applying current methods, its implementation is notably simple and its on-line operation is very fast.
{"title":"Alternate paths for multiple fault tolerance on Dynamic WDM Optical Networks","authors":"N. Jara, G. Rubino, Reinaldo Vallejos Campos","doi":"10.1109/HPSR.2017.7968674","DOIUrl":"https://doi.org/10.1109/HPSR.2017.7968674","url":null,"abstract":"This paper proposes a new method to compute alternate routes for multiple fault tolerance on Dynamic WDM Optical Networks. The method allows to obtain all the paths that replace the primary routes affected by one or several failures. Additional paths, called secondary routes, are used to keep each user connected to the network, including cases where multiple simultaneous link failures occur. The method also allows to obtain the number of wavelengths in each link of the network, computed such that the blocking probability of each connection is less than a pre-defined threshold (which is a network design parameter), in spite of the occurrence of k simultaneous link failures, with k ≥ 1. The solution obtained by the new algorithm is significantly more efficient than the result of applying current methods, its implementation is notably simple and its on-line operation is very fast.","PeriodicalId":169489,"journal":{"name":"2017 IEEE 18th International Conference on High Performance Switching and Routing (HPSR)","volume":"32 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114134463","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-06-18DOI: 10.1109/HPSR.2017.7968676
J. Mun, Jungwon Lee, Hyesook Lim
Bloom filters have been employed in various fields because of its simple and effective structure in identifying the membership of an input. Since a Bloom filter can produce false positives, the positive results of a Bloom filter should be identified whether the positives are true or not by accessing the original database. A complement Bloom filter (C-BF) was introduced to identify the true positiveness of a given Bloom filter without accessing the original database. A critical problem of the C-BF is that every element included in the complement set of the given set should be programmed into the C-BF. Since the number of elements included in the complement set can be considerably large, the C-BF would require the significant amount of memory. In this paper, we claim that the elements that produce negative results from the given Bloom filter are not necessarily programmed into the C-BF, since Bloom filters never produce false negatives. In other words, we propose the Petit-BF (P-BF) which programs only the elements that cause false positives from the given Bloom filter. Simulation results and theoretical analysis show that the proposed method can achieve the same performance using a considerably smaller amount of memory.
{"title":"A new Bloom filter structure for identifying true positiveness of a Bloom filter","authors":"J. Mun, Jungwon Lee, Hyesook Lim","doi":"10.1109/HPSR.2017.7968676","DOIUrl":"https://doi.org/10.1109/HPSR.2017.7968676","url":null,"abstract":"Bloom filters have been employed in various fields because of its simple and effective structure in identifying the membership of an input. Since a Bloom filter can produce false positives, the positive results of a Bloom filter should be identified whether the positives are true or not by accessing the original database. A complement Bloom filter (C-BF) was introduced to identify the true positiveness of a given Bloom filter without accessing the original database. A critical problem of the C-BF is that every element included in the complement set of the given set should be programmed into the C-BF. Since the number of elements included in the complement set can be considerably large, the C-BF would require the significant amount of memory. In this paper, we claim that the elements that produce negative results from the given Bloom filter are not necessarily programmed into the C-BF, since Bloom filters never produce false negatives. In other words, we propose the Petit-BF (P-BF) which programs only the elements that cause false positives from the given Bloom filter. Simulation results and theoretical analysis show that the proposed method can achieve the same performance using a considerably smaller amount of memory.","PeriodicalId":169489,"journal":{"name":"2017 IEEE 18th International Conference on High Performance Switching and Routing (HPSR)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114941653","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-06-18DOI: 10.1109/HPSR.2017.7968687
C. Lira, R. C. Almeida, J. Martins-Filho
Elastic Optical Networks (EON) have been a constant focus of studies in recent years because they have characteristics that stand out in relation to current optical networks. Among these characteristics, it is possible to highlight the ability to transmit data with different bandwidths, adapted to the demand, which guarantees a high spectral efficiency. Different techniques and heuristics have been presented in order to solve the Routing and Spectrum Allocation (RSA) problem, which emphasize in providing efficient solutions for the packaging of requests within the optical spectrum. In this article, it is proposed the adaptation of an efficient spectrum assignment heuristic, referred to as Min Slot-Continuity Capacity Loss (MSCL), with the Split Spectrum technique. It is shown that by combining different forms of spectrum division with the spectrum assignment that generates the least loss of capacity, an efficient technique may be applied to EONs that provides better results than either the traditional algorithms of spectrum allocation (FF and MSCL) and the classic form of spectrum division.
{"title":"On combining Split Spectrum technique with a Slot-Continuity Capacity Loss heuristic in Elastic Optical Networks","authors":"C. Lira, R. C. Almeida, J. Martins-Filho","doi":"10.1109/HPSR.2017.7968687","DOIUrl":"https://doi.org/10.1109/HPSR.2017.7968687","url":null,"abstract":"Elastic Optical Networks (EON) have been a constant focus of studies in recent years because they have characteristics that stand out in relation to current optical networks. Among these characteristics, it is possible to highlight the ability to transmit data with different bandwidths, adapted to the demand, which guarantees a high spectral efficiency. Different techniques and heuristics have been presented in order to solve the Routing and Spectrum Allocation (RSA) problem, which emphasize in providing efficient solutions for the packaging of requests within the optical spectrum. In this article, it is proposed the adaptation of an efficient spectrum assignment heuristic, referred to as Min Slot-Continuity Capacity Loss (MSCL), with the Split Spectrum technique. It is shown that by combining different forms of spectrum division with the spectrum assignment that generates the least loss of capacity, an efficient technique may be applied to EONs that provides better results than either the traditional algorithms of spectrum allocation (FF and MSCL) and the classic form of spectrum division.","PeriodicalId":169489,"journal":{"name":"2017 IEEE 18th International Conference on High Performance Switching and Routing (HPSR)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123681949","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-06-18DOI: 10.1109/HPSR.2017.7968684
P. Patra, Christian Esteve Rothenberg, Gergely Pongrácz
Deep programmability of dataplane pipelines is one of the tenets of the evolving Software Defined Networking (SDN) paradigm. Despite recent efforts on high performance programmable devices, achieving fully programmability (protocol independent) of heterogeneous dataplane implementations still pose numerous challenges. The P4 language is emerging as a strong candidate top-down approach to describe a protocol independent datapath pipeline, agnostic to network platforms. Meanwhile, the OpenDataPlane (ODP) project follows an open-source, bottom-up approach seeking multi-architecture APIs to write platform independent dataplane applications. In this paper, we present Multi-Architecture Compiler System for Abstract Dataplanes (MACSAD) as an approach to converge P4 and ODP through a common compilation process delivering portability of dataplane applications without compromising target performance improvements. We validate our prototype implementation through experimental evaluation of L2 and L3 dataplane applications on different target platforms (×86, ×86+DPDK, ARM-SoC).
{"title":"MACSAD: High performance dataplane applications on the move","authors":"P. Patra, Christian Esteve Rothenberg, Gergely Pongrácz","doi":"10.1109/HPSR.2017.7968684","DOIUrl":"https://doi.org/10.1109/HPSR.2017.7968684","url":null,"abstract":"Deep programmability of dataplane pipelines is one of the tenets of the evolving Software Defined Networking (SDN) paradigm. Despite recent efforts on high performance programmable devices, achieving fully programmability (protocol independent) of heterogeneous dataplane implementations still pose numerous challenges. The P4 language is emerging as a strong candidate top-down approach to describe a protocol independent datapath pipeline, agnostic to network platforms. Meanwhile, the OpenDataPlane (ODP) project follows an open-source, bottom-up approach seeking multi-architecture APIs to write platform independent dataplane applications. In this paper, we present Multi-Architecture Compiler System for Abstract Dataplanes (MACSAD) as an approach to converge P4 and ODP through a common compilation process delivering portability of dataplane applications without compromising target performance improvements. We validate our prototype implementation through experimental evaluation of L2 and L3 dataplane applications on different target platforms (×86, ×86+DPDK, ARM-SoC).","PeriodicalId":169489,"journal":{"name":"2017 IEEE 18th International Conference on High Performance Switching and Routing (HPSR)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128555181","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-06-18DOI: 10.1109/HPSR.2017.7968688
Gonzalo Fernández Del Carpio, D. Larrabeiti, M. Urueña
Multicast forwarding in the context of IP-MPLS networks for services like VPLS has important scalability issues. Alternatives to per-VPLS tree construction based on aggregation of multipoint requests onto shared trees have been studied. Other works have focused on stateless forwarding based on Bloom filters. Both suffer from some type of forwarding anomalies. This paper proposes the combination of both forwarding modes: shared multicast trees and an efficient variant of stateless switching based on Bloom filters. Simulations prove that constraining the forwarding to the shared tree is an effective mechanism to prevent most side effects of Bloom filter-based forwarding, making the combined technique a good trade-off in terms of forwarding state consumption, yielding best performance in terms of overhead with respect to each technique in isolation.
{"title":"Forwarding of multicast packets with hybrid methods based on Bloom filters and shared trees in MPLS networks","authors":"Gonzalo Fernández Del Carpio, D. Larrabeiti, M. Urueña","doi":"10.1109/HPSR.2017.7968688","DOIUrl":"https://doi.org/10.1109/HPSR.2017.7968688","url":null,"abstract":"Multicast forwarding in the context of IP-MPLS networks for services like VPLS has important scalability issues. Alternatives to per-VPLS tree construction based on aggregation of multipoint requests onto shared trees have been studied. Other works have focused on stateless forwarding based on Bloom filters. Both suffer from some type of forwarding anomalies. This paper proposes the combination of both forwarding modes: shared multicast trees and an efficient variant of stateless switching based on Bloom filters. Simulations prove that constraining the forwarding to the shared tree is an effective mechanism to prevent most side effects of Bloom filter-based forwarding, making the combined technique a good trade-off in terms of forwarding state consumption, yielding best performance in terms of overhead with respect to each technique in isolation.","PeriodicalId":169489,"journal":{"name":"2017 IEEE 18th International Conference on High Performance Switching and Routing (HPSR)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128897921","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-06-18DOI: 10.1109/HPSR.2017.7968671
Walber Jose Adriano Silva, D. Sadok
The Border Gateway Protocol (BGP) is the current standard protocol for the inter-domain routing system. Although BGP makes easy to manipulate the output traffic by an Autonomous System (AS), it lacks other desired features such as convenient management of incoming traffic to an AS. Thus, we propose a framework to evolve the control plane routing system that is compatible with BGP (smooth transition), uses SDN technologies and can be used to management the incoming traffic of multihomed ASes. Based on our framework, a load balancing application was developed and applied to a scenario to depict the proof of concept of our framework. The results were compared and discussed with BGP AS-Path Prepending technique, shown an improvement of inbound traffic bandwidth utilization.
{"title":"Control inbound traffic: Evolving the control plane routing system with Software Defined Networking","authors":"Walber Jose Adriano Silva, D. Sadok","doi":"10.1109/HPSR.2017.7968671","DOIUrl":"https://doi.org/10.1109/HPSR.2017.7968671","url":null,"abstract":"The Border Gateway Protocol (BGP) is the current standard protocol for the inter-domain routing system. Although BGP makes easy to manipulate the output traffic by an Autonomous System (AS), it lacks other desired features such as convenient management of incoming traffic to an AS. Thus, we propose a framework to evolve the control plane routing system that is compatible with BGP (smooth transition), uses SDN technologies and can be used to management the incoming traffic of multihomed ASes. Based on our framework, a load balancing application was developed and applied to a scenario to depict the proof of concept of our framework. The results were compared and discussed with BGP AS-Path Prepending technique, shown an improvement of inbound traffic bandwidth utilization.","PeriodicalId":169489,"journal":{"name":"2017 IEEE 18th International Conference on High Performance Switching and Routing (HPSR)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127940870","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-06-18DOI: 10.1109/HPSR.2017.7968691
Y. Sun, Junpeng Guo, Yuhui Yao
This paper proposes a position-based routing scheme called Speed Up-Greedy Perimeter Stateless Routing Protocol for Wireless Sensor Networks (SU-GPSR). The speed up mode works together with greedy mode to provide a solution for data transmission in WSN. Unlike other variants of greedy perimeter stateless routing protocols, SU-GPSR not only embraces both still nodes and mobile nodes in one unified scheme, but provide a complete energy consumption consideration when evaluating the potential next hop. The simulation results reveal that the SU-GPSR outperforms EGPSR and FA-GPSR from various aspects in both dense and loose network size.
{"title":"Speed Up-Greedy Perimeter Stateless Routing Protocol for Wireless Sensor Networks (SU-GPSR)","authors":"Y. Sun, Junpeng Guo, Yuhui Yao","doi":"10.1109/HPSR.2017.7968691","DOIUrl":"https://doi.org/10.1109/HPSR.2017.7968691","url":null,"abstract":"This paper proposes a position-based routing scheme called Speed Up-Greedy Perimeter Stateless Routing Protocol for Wireless Sensor Networks (SU-GPSR). The speed up mode works together with greedy mode to provide a solution for data transmission in WSN. Unlike other variants of greedy perimeter stateless routing protocols, SU-GPSR not only embraces both still nodes and mobile nodes in one unified scheme, but provide a complete energy consumption consideration when evaluating the potential next hop. The simulation results reveal that the SU-GPSR outperforms EGPSR and FA-GPSR from various aspects in both dense and loose network size.","PeriodicalId":169489,"journal":{"name":"2017 IEEE 18th International Conference on High Performance Switching and Routing (HPSR)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131200803","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-06-01DOI: 10.1109/HPSR.2017.7968682
Yue Fei, Xue Wang, Yamini Jayabal, A. Fumagalli, R. Hui, G. Galimberti, G. Martinelli
In dynamic-traffic Wavelength Division Multiplexing (WDM) networks, it is desirable to guarantee each optical circuit a minimum Optical Signal-to-Noise Ratio (OSNR) throughout the circuit's entire lifetime. The objective of this paper is to increase such guaranteed OSNR, which in turn enables bandwidth-efficient modulation formats to be applied to the circuit signals. The guaranteed OSNR is improved by applying OSNR-driven Spectrum Assignment (OSA) constraints to each fiber link in the network, based on its forecast traffic volume (offered load). Applying OSA constraints to fiber links has two conflicting outcomes. On the one hand, circuit requests may experience higher blocking probabilities due to the lack of usable spectrum. On the other hand, the adverse effects of medium nonlinearity may be contained, thus yielding improved circuit OSNR. Two OSA constraints are described and their favorable impact on circuit OSNR (up to 2.75 dB gain) is estimated by using a Gaussian Noise (GN) model and an event-driven simulation of two WDM networks supporting dynamic circuits.
{"title":"Spectrum Assignment constraints for improved OSNR in optical networks with dynamic traffic","authors":"Yue Fei, Xue Wang, Yamini Jayabal, A. Fumagalli, R. Hui, G. Galimberti, G. Martinelli","doi":"10.1109/HPSR.2017.7968682","DOIUrl":"https://doi.org/10.1109/HPSR.2017.7968682","url":null,"abstract":"In dynamic-traffic Wavelength Division Multiplexing (WDM) networks, it is desirable to guarantee each optical circuit a minimum Optical Signal-to-Noise Ratio (OSNR) throughout the circuit's entire lifetime. The objective of this paper is to increase such guaranteed OSNR, which in turn enables bandwidth-efficient modulation formats to be applied to the circuit signals. The guaranteed OSNR is improved by applying OSNR-driven Spectrum Assignment (OSA) constraints to each fiber link in the network, based on its forecast traffic volume (offered load). Applying OSA constraints to fiber links has two conflicting outcomes. On the one hand, circuit requests may experience higher blocking probabilities due to the lack of usable spectrum. On the other hand, the adverse effects of medium nonlinearity may be contained, thus yielding improved circuit OSNR. Two OSA constraints are described and their favorable impact on circuit OSNR (up to 2.75 dB gain) is estimated by using a Gaussian Noise (GN) model and an event-driven simulation of two WDM networks supporting dynamic circuits.","PeriodicalId":169489,"journal":{"name":"2017 IEEE 18th International Conference on High Performance Switching and Routing (HPSR)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123713172","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：