Pub Date : 2017-06-01DOI: 10.1109/HPSR.2017.7968686
Danilo R. B. Araújo, C. J. A. B. Filho
Physical topology design of optical networks is a NP-hard problem and is frequently accomplished by using heuristics and metaheuristics. Previous works investigated the suitability of a tunable version of the Gabriel method to represent optical networks regarding performance and cost. In this paper, we study the robustness of a heuristics based on Gabriel graphs deployed in three different backbone networks. The robustness of the physical topologies obtained by the proposed heuristics is analyzed regarding robustness metrics and critical thresholds obtained by failure simulations in the original deployed networks and equivalent scale-free networks. According to our results, the heuristics based on Gabriel graphs can provide physical topologies that are more robust according to several indicators.
{"title":"Robustness of physical topologies of optical networks created by variants of Gabriel graphs","authors":"Danilo R. B. Araújo, C. J. A. B. Filho","doi":"10.1109/HPSR.2017.7968686","DOIUrl":"https://doi.org/10.1109/HPSR.2017.7968686","url":null,"abstract":"Physical topology design of optical networks is a NP-hard problem and is frequently accomplished by using heuristics and metaheuristics. Previous works investigated the suitability of a tunable version of the Gabriel method to represent optical networks regarding performance and cost. In this paper, we study the robustness of a heuristics based on Gabriel graphs deployed in three different backbone networks. The robustness of the physical topologies obtained by the proposed heuristics is analyzed regarding robustness metrics and critical thresholds obtained by failure simulations in the original deployed networks and equivalent scale-free networks. According to our results, the heuristics based on Gabriel graphs can provide physical topologies that are more robust according to several indicators.","PeriodicalId":169489,"journal":{"name":"2017 IEEE 18th International Conference on High Performance Switching and Routing (HPSR)","volume":"74 3 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":"123605951","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.7968680
Xiao Lin, Weiqiang Sun, Weisheng Hu
Increasing bulk data transfers have been overwhelming the Internet. To overcome this, optical circuit-switched (OCS) networks are equipped with assistive storage, so that bulk data that are delay tolerant can be temporarily stored at intermediate nodes and forwarded at later times. But, the use of storage greatly complicates the routing problem, since data storage must be incorporated into routing. This motivates us to simplify this issue by applying slotted operations for the network. Intuitively, the slotted network suffers from degraded network performance due to the inefficient utilization incurred by the slot constraint. However, our simulation shows that when the slot size equals to half the mean duration, the blocking probability is reduced from 0.076 to 8.5×10−5, and the number of network reconfigurations is reduced by a factor of 5, compared to the unslotted case. We reveal that in spite of the inefficient utilization, the slotted operations mitigate bandwidth fragmentation. This suggests in the slotted case, more bandwidth gaps on the links are available for accommodating other requests, and they are aligned with each other in time. Requests hence are delivered with less store-and-forward (SnF) operations being performed. Thus, when the number of SnF allowed for routing each request is limited (in order to reduce the computational complexity of routing), requests are more easily served in the slotted than in the unslotted cases. Our research provides clue for designing scalable slotted OCS networks with assistive storage.
{"title":"Performance of slotted store-and-forward (sSnF) optical circuit-switched networks - a simulation study","authors":"Xiao Lin, Weiqiang Sun, Weisheng Hu","doi":"10.1109/HPSR.2017.7968680","DOIUrl":"https://doi.org/10.1109/HPSR.2017.7968680","url":null,"abstract":"Increasing bulk data transfers have been overwhelming the Internet. To overcome this, optical circuit-switched (OCS) networks are equipped with assistive storage, so that bulk data that are delay tolerant can be temporarily stored at intermediate nodes and forwarded at later times. But, the use of storage greatly complicates the routing problem, since data storage must be incorporated into routing. This motivates us to simplify this issue by applying slotted operations for the network. Intuitively, the slotted network suffers from degraded network performance due to the inefficient utilization incurred by the slot constraint. However, our simulation shows that when the slot size equals to half the mean duration, the blocking probability is reduced from 0.076 to 8.5×10−5, and the number of network reconfigurations is reduced by a factor of 5, compared to the unslotted case. We reveal that in spite of the inefficient utilization, the slotted operations mitigate bandwidth fragmentation. This suggests in the slotted case, more bandwidth gaps on the links are available for accommodating other requests, and they are aligned with each other in time. Requests hence are delivered with less store-and-forward (SnF) operations being performed. Thus, when the number of SnF allowed for routing each request is limited (in order to reduce the computational complexity of routing), requests are more easily served in the slotted than in the unslotted cases. Our research provides clue for designing scalable slotted OCS networks with assistive storage.","PeriodicalId":169489,"journal":{"name":"2017 IEEE 18th International Conference on High Performance Switching and Routing (HPSR)","volume":"70 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":"125155311","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.7968693
J. Finochietto, M. Garrich, A. Bianco
Elastic Optical Networks (EONs) can increase the efficiency of already deployed optical fibers thanks to transponders that adjust the modulation format, baud-rate and number of optical carriers to achieve the desired transmission rate, bandwidth and reach. Due to the high cost of these transponders, transparent end-to-end lightpaths are usually desired, which can require a large amount of spectrum when provisioned over long distances. In this paper, we consider the case of translucent lightpaths, which make use of flexible regeneration schemes to reduce the amount of required spectrum. We analyze the trade-off between the spectrum usage and the number of transponder devices. In particular, we propose a proactive approach to provision EONs that considers the spectrum availability. Thus, it is possible to explore the referred trade-off with a load-incremental perspective, which may be relevant for network operators. Results show how the proposed approach can increase the supported capacity in the network at the cost of additional transponder devices.
{"title":"On provisioning strategies in translucent Elastic Optical Networks with flexible regeneration and superchannel transmission","authors":"J. Finochietto, M. Garrich, A. Bianco","doi":"10.1109/HPSR.2017.7968693","DOIUrl":"https://doi.org/10.1109/HPSR.2017.7968693","url":null,"abstract":"Elastic Optical Networks (EONs) can increase the efficiency of already deployed optical fibers thanks to transponders that adjust the modulation format, baud-rate and number of optical carriers to achieve the desired transmission rate, bandwidth and reach. Due to the high cost of these transponders, transparent end-to-end lightpaths are usually desired, which can require a large amount of spectrum when provisioned over long distances. In this paper, we consider the case of translucent lightpaths, which make use of flexible regeneration schemes to reduce the amount of required spectrum. We analyze the trade-off between the spectrum usage and the number of transponder devices. In particular, we propose a proactive approach to provision EONs that considers the spectrum availability. Thus, it is possible to explore the referred trade-off with a load-incremental perspective, which may be relevant for network operators. Results show how the proposed approach can increase the supported capacity in the network at the cost of additional transponder devices.","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":"130269778","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
扫码关注我们
求助内容：
应助结果提醒方式：