Pub Date : 2016-02-01DOI: 10.1109/ICCNC.2016.7440620
M. Bahnasy, Bochra Boughzala, H. Elbiaze, B. Alleyne, André Béliveau, C. Padala
In the quest of providing a deterministic backplane-like behaviour a mechanism called ECCP (Ethernet Congestion Control & Prevention) was proposed where specialized and expensive devices were replaced by commodity Ethernet switches while still keeping the router properties, e.g. low-latency packet delivery, no packet loss within the fabric and fair share of the bandwidth. However, ECCP uses a self-induced congestion probing model which can cause queue length fluctuation in addition to the network bandwidth wastage due to the probes. Therefore, we propose enhancements to the algorithm used by ECCP to reduce probe packet overhead. In our solution NoP-ECCP (ECCP with no probes), we use a link utilization estimation technique instead of the estimation of the available bandwidth. The results obtained through simulations show that NoP-ECCP outperforms ECCP in terms of fairness, link utilization and queue length.
{"title":"Proactive Ethernet Congestion Control based on link utilization estimation","authors":"M. Bahnasy, Bochra Boughzala, H. Elbiaze, B. Alleyne, André Béliveau, C. Padala","doi":"10.1109/ICCNC.2016.7440620","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440620","url":null,"abstract":"In the quest of providing a deterministic backplane-like behaviour a mechanism called ECCP (Ethernet Congestion Control & Prevention) was proposed where specialized and expensive devices were replaced by commodity Ethernet switches while still keeping the router properties, e.g. low-latency packet delivery, no packet loss within the fabric and fair share of the bandwidth. However, ECCP uses a self-induced congestion probing model which can cause queue length fluctuation in addition to the network bandwidth wastage due to the probes. Therefore, we propose enhancements to the algorithm used by ECCP to reduce probe packet overhead. In our solution NoP-ECCP (ECCP with no probes), we use a link utilization estimation technique instead of the estimation of the available bandwidth. The results obtained through simulations show that NoP-ECCP outperforms ECCP in terms of fairness, link utilization and queue length.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125545108","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 : 2016-02-01DOI: 10.1109/ICCNC.2016.7440590
Donghyun Kim, Yesenia Velasco, Zishen Yang, Wei Wang, Rasheed Hussain, R. Uma
This paper investigates a new strategy to best deploy road side units so that their spatio-temporal coverage is maximized under a limited budget. For the first time in the literature, we consider three different RSU deployment strategies in a single framework, on static locations, public mobile transportation, and fully controllable vehicles. We first introduce a new strategy to abstract a map of city area into a grid graph. Then, we formulate the problem as a new optimization problem and show its NP-hardness. To solve this problem, we transform this problem into another optimization problem and propose a new polynomial running time approximation algorithm and show its performance ratio is at least the half of the best possible ratio.
{"title":"Cost effective mobile and static road side unit deployment for vehicular adhoc networks","authors":"Donghyun Kim, Yesenia Velasco, Zishen Yang, Wei Wang, Rasheed Hussain, R. Uma","doi":"10.1109/ICCNC.2016.7440590","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440590","url":null,"abstract":"This paper investigates a new strategy to best deploy road side units so that their spatio-temporal coverage is maximized under a limited budget. For the first time in the literature, we consider three different RSU deployment strategies in a single framework, on static locations, public mobile transportation, and fully controllable vehicles. We first introduce a new strategy to abstract a map of city area into a grid graph. Then, we formulate the problem as a new optimization problem and show its NP-hardness. To solve this problem, we transform this problem into another optimization problem and propose a new polynomial running time approximation algorithm and show its performance ratio is at least the half of the best possible ratio.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126332787","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 : 2016-02-01DOI: 10.1109/ICCNC.2016.7440636
Sejun Song, Baek-Young Choi, Daehee Kim
As smart devices gain their popularity and usage applications become versatile, the users are also hoping to perform resource intensive tasks at anywhere and anytime as conveniently as using their static computers. To overcome the smart device's intrinsic resource limitations in processing, storage, and power, emerging collaborative mobile cloud technologies such as Mobile Cloud Computing (MCC), Mobile-Edge Computing (MEC), and Fog Computing (FC) augment the smart device's capabilities by leveraging distributed and remote cloud resources. However, in collaborative computing environments, the demand for big data processing and exchanges among smart devices is considered as a significant challenge. An effective technique to reduce data at a source device is essential to save network bandwidth and storage spaces. It, in turn, improves the data processing overhead as well as reduces the security vulnerability caused by data movement among the smart devices. In this paper, we design and develop a novel Selective Encryption and Component-Oriented Deduplication (SEACOD) application that achieves both fast and effective data encryption and reduction for MCC services. Specifically, SEACOD efficiently deduplicates redundant objects in files, emails, as well as images exploiting object-level components based on their structures. It also effectively reduces the overall encryption overhead on the mobile devices by adaptively applying compression and encryption methods according to the decomposed data types. Our evaluation using real datasets of structured files shows that the proposed scheme accomplishes as good of storage savings as a variable-block deduplication, while being as fast as a file-level or a large fixed-size block-level deduplication.
{"title":"Selective encryption and component-oriented deduplication for mobile cloud data computing","authors":"Sejun Song, Baek-Young Choi, Daehee Kim","doi":"10.1109/ICCNC.2016.7440636","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440636","url":null,"abstract":"As smart devices gain their popularity and usage applications become versatile, the users are also hoping to perform resource intensive tasks at anywhere and anytime as conveniently as using their static computers. To overcome the smart device's intrinsic resource limitations in processing, storage, and power, emerging collaborative mobile cloud technologies such as Mobile Cloud Computing (MCC), Mobile-Edge Computing (MEC), and Fog Computing (FC) augment the smart device's capabilities by leveraging distributed and remote cloud resources. However, in collaborative computing environments, the demand for big data processing and exchanges among smart devices is considered as a significant challenge. An effective technique to reduce data at a source device is essential to save network bandwidth and storage spaces. It, in turn, improves the data processing overhead as well as reduces the security vulnerability caused by data movement among the smart devices. In this paper, we design and develop a novel Selective Encryption and Component-Oriented Deduplication (SEACOD) application that achieves both fast and effective data encryption and reduction for MCC services. Specifically, SEACOD efficiently deduplicates redundant objects in files, emails, as well as images exploiting object-level components based on their structures. It also effectively reduces the overall encryption overhead on the mobile devices by adaptively applying compression and encryption methods according to the decomposed data types. Our evaluation using real datasets of structured files shows that the proposed scheme accomplishes as good of storage savings as a variable-block deduplication, while being as fast as a file-level or a large fixed-size block-level deduplication.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120947142","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 : 2016-02-01DOI: 10.1109/ICCNC.2016.7440623
Wei Liu, U. Krieger, E. K. Park, S. S. Zhu
This paper reports our innovation in a Smart and Connected e-Health Service (SCeHS) lab approach for e-Health standards validation. The lab platform has been designed for SCeHS which is a next generation solution following the initial Big Data e-Health Service (BDeHS) initiative. After a number of e-Health standards are summarized, we present our validation designs for conformance to those e-Health standards.
{"title":"Smart and connected e-Health lab for standards validation and conformance","authors":"Wei Liu, U. Krieger, E. K. Park, S. S. Zhu","doi":"10.1109/ICCNC.2016.7440623","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440623","url":null,"abstract":"This paper reports our innovation in a Smart and Connected e-Health Service (SCeHS) lab approach for e-Health standards validation. The lab platform has been designed for SCeHS which is a next generation solution following the initial Big Data e-Health Service (BDeHS) initiative. After a number of e-Health standards are summarized, we present our validation designs for conformance to those e-Health standards.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"2014 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121525708","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 : 2016-02-01DOI: 10.1109/ICCNC.2016.7440628
Younghee Park, Sang-Yoon Chang, Lavanya M. Krishnamurthy
Software-defined networking (SDN) provides network operators a high level of flexibility and programability through the separation of the control plane from the data plane. When initiating traffic, users are required to install flow rules that direct the traffic routing. This process requires communication between control and data plane and results in significant overhead and enables the controller to monitor the traffic and its source. In this paper, we introduce a novel misbehavior, called freeloading, where attackers bypass the process of installing flow rules. The attackers thus can send traffic with an unfair advantage in delay (enabling them to launch more timely threats) and significantly reduce the risk of attacker detection by the network controller (especially if further threats were launched). To prevent such attack, we develop a flow watermarking technique that embeds a secret message into the data payload. It facilitates ownership of the established flow rules, so that only the legitimate owners of flow rules can send packets using their own rules and the network can help detect the misuse cases of the installed flow rules.
{"title":"Watermarking for detecting freeloader misbehavior in software-defined networks","authors":"Younghee Park, Sang-Yoon Chang, Lavanya M. Krishnamurthy","doi":"10.1109/ICCNC.2016.7440628","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440628","url":null,"abstract":"Software-defined networking (SDN) provides network operators a high level of flexibility and programability through the separation of the control plane from the data plane. When initiating traffic, users are required to install flow rules that direct the traffic routing. This process requires communication between control and data plane and results in significant overhead and enables the controller to monitor the traffic and its source. In this paper, we introduce a novel misbehavior, called freeloading, where attackers bypass the process of installing flow rules. The attackers thus can send traffic with an unfair advantage in delay (enabling them to launch more timely threats) and significantly reduce the risk of attacker detection by the network controller (especially if further threats were launched). To prevent such attack, we develop a flow watermarking technique that embeds a secret message into the data payload. It facilitates ownership of the established flow rules, so that only the legitimate owners of flow rules can send packets using their own rules and the network can help detect the misuse cases of the installed flow rules.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122859977","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 : 2016-02-01DOI: 10.1109/ICCNC.2016.7440569
Yu Liu, M. Huynh, D. Ghosal
The Discontinuous Reception (DRX) mechanism which is widely adopted in LTE to conserve the user equipment (UE)'s battery resources, not only introduces high handover latency but also reduces the downlink scheduler efficiency. A key objective of this work is to design battery power aware scheduling by incorporating the per-UE DRX parameters (such as the On Duration Timer) in downlink scheduling. This allows maximizing the UEs battery lifetime while satisfying the application qualify of service (QoS) requirement. In this paper, we propose an enhanced DRX-Aware scheduling (eDAS) mechanism that can balance the trade-off between application QoS requirements and UE's power consumption. The eDAS scheduler accounts for both static and mobile UEs. Simulation analysis shows that the proposed eDAS scheme achieves lower packet loss rate and packet delay when compared with traditional scheduling algorithms such as Proportional Fairness (PF) and Maximum Largest Weighted Delay First (M-LWDF), while still achieving significant power conservation.
{"title":"Enhanced DRX-aware scheduling for mobile users in LTE networks","authors":"Yu Liu, M. Huynh, D. Ghosal","doi":"10.1109/ICCNC.2016.7440569","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440569","url":null,"abstract":"The Discontinuous Reception (DRX) mechanism which is widely adopted in LTE to conserve the user equipment (UE)'s battery resources, not only introduces high handover latency but also reduces the downlink scheduler efficiency. A key objective of this work is to design battery power aware scheduling by incorporating the per-UE DRX parameters (such as the On Duration Timer) in downlink scheduling. This allows maximizing the UEs battery lifetime while satisfying the application qualify of service (QoS) requirement. In this paper, we propose an enhanced DRX-Aware scheduling (eDAS) mechanism that can balance the trade-off between application QoS requirements and UE's power consumption. The eDAS scheduler accounts for both static and mobile UEs. Simulation analysis shows that the proposed eDAS scheme achieves lower packet loss rate and packet delay when compared with traditional scheduling algorithms such as Proportional Fairness (PF) and Maximum Largest Weighted Delay First (M-LWDF), while still achieving significant power conservation.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131266682","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 : 2016-02-01DOI: 10.1109/ICCNC.2016.7440555
T. Kobayashi, Hiroshi Yamamoto, K. Yamazaki
Observing activities of working vehicles on a work site, such as a factory, is important in regard to managing the lifetime of vehicles and achieving high operational availability. However, it is a problem that an administrator cannot completely grasp the activities of a working vehicle. Existing systems cannot cover a large area, particularly in an indoor environment. A system is proposed for monitoring operating activities of working vehicles, regardless of whether they are operating indoors or outdoors. The system calculates the activity rate of a vehicle by analyzing the topology of a network configured by the wireless technology ZigBee. In addition, it was experimentally verified that network topology and RSSI can be used to estimate activities of working vehicles.
{"title":"ZigBee network system for observing operating activities of work vehicles","authors":"T. Kobayashi, Hiroshi Yamamoto, K. Yamazaki","doi":"10.1109/ICCNC.2016.7440555","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440555","url":null,"abstract":"Observing activities of working vehicles on a work site, such as a factory, is important in regard to managing the lifetime of vehicles and achieving high operational availability. However, it is a problem that an administrator cannot completely grasp the activities of a working vehicle. Existing systems cannot cover a large area, particularly in an indoor environment. A system is proposed for monitoring operating activities of working vehicles, regardless of whether they are operating indoors or outdoors. The system calculates the activity rate of a vehicle by analyzing the topology of a network configured by the wireless technology ZigBee. In addition, it was experimentally verified that network topology and RSSI can be used to estimate activities of working vehicles.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"113 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131507801","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 : 2016-02-01DOI: 10.1109/ICCNC.2016.7440663
Sa Xiao, Xiangwei Zhou, Daquan Feng, Y. Yuan-Wu, Geoffrey Y. Li, Wenting Guo
In this paper, we investigate energy-efficient mobile association for users with the capability of device-to-device (D2D) communications in heterogeneous networks. To maximize the energy efficiency (EE) of uplink transmission while guaranteeing the quality-of-service requirement of users, we first propose a brute-force-based mobile association algorithm, which requires complete channel state information and searches all association candidates. To reduce the cost involved in computation, channel estimation, and feedback, we also develop a distance-based mobile association (DMA) algorithm, which operates according to geographical information of access points and D2D relay nodes and with much lower computational complexity. Simulation results demonstrate that the proposed DMA algorithm can achieve a good tradeoff between the EE and complexity.
{"title":"Energy-efficient mobile association in device-to-device-enabled heterogeneous networks","authors":"Sa Xiao, Xiangwei Zhou, Daquan Feng, Y. Yuan-Wu, Geoffrey Y. Li, Wenting Guo","doi":"10.1109/ICCNC.2016.7440663","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440663","url":null,"abstract":"In this paper, we investigate energy-efficient mobile association for users with the capability of device-to-device (D2D) communications in heterogeneous networks. To maximize the energy efficiency (EE) of uplink transmission while guaranteeing the quality-of-service requirement of users, we first propose a brute-force-based mobile association algorithm, which requires complete channel state information and searches all association candidates. To reduce the cost involved in computation, channel estimation, and feedback, we also develop a distance-based mobile association (DMA) algorithm, which operates according to geographical information of access points and D2D relay nodes and with much lower computational complexity. Simulation results demonstrate that the proposed DMA algorithm can achieve a good tradeoff between the EE and complexity.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133608479","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 : 2016-02-01DOI: 10.1109/ICCNC.2016.7440649
Ben Niu, Sheng Gao, Fenghua Li, Hui Li, Zongqing Lu
Privacy issues in continuous Location-Based Services (LBSs) have gained attractive attentions in literature over recent years. In this paper, we illustrate the limitations of existing work and define an entropy-based privacy metric to quantify the privacy degree based on a set of vital observations. To tackle the privacy issues, we propose an efficient privacy-preserving scheme, DUMMY-T, which aims to protect LBSs user's privacy against adversaries with background information. By our Dummy Locations Generating (DLG) algorithm, we first generate a set of realistic dummy locations for each snapshot with considering the minimum cloaking region and background information. Further, our proposed Dummy Paths Constructing (DPC) algorithm guarantees the location reachability by taking the maximum distance of the moving mobile users into consideration. Security analysis and empirical evaluation results further verify the effectiveness and efficiency of our DUMMY-T.
{"title":"Protection of location privacy in continuous LBSs against adversaries with background information","authors":"Ben Niu, Sheng Gao, Fenghua Li, Hui Li, Zongqing Lu","doi":"10.1109/ICCNC.2016.7440649","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440649","url":null,"abstract":"Privacy issues in continuous Location-Based Services (LBSs) have gained attractive attentions in literature over recent years. In this paper, we illustrate the limitations of existing work and define an entropy-based privacy metric to quantify the privacy degree based on a set of vital observations. To tackle the privacy issues, we propose an efficient privacy-preserving scheme, DUMMY-T, which aims to protect LBSs user's privacy against adversaries with background information. By our Dummy Locations Generating (DLG) algorithm, we first generate a set of realistic dummy locations for each snapshot with considering the minimum cloaking region and background information. Further, our proposed Dummy Paths Constructing (DPC) algorithm guarantees the location reachability by taking the maximum distance of the moving mobile users into consideration. Security analysis and empirical evaluation results further verify the effectiveness and efficiency of our DUMMY-T.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133657947","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 : 2016-02-01DOI: 10.1109/ICCNC.2016.7440674
M. Kanj, E. L. Rouzic, Djamel Amar, Jean-Luc Augé, Bernard A. Cousin, N. Brochier
The exponential traffic growth in optical networks has triggered the evolution from Fixed-Grid to Flex-Grid technology. This evolution allows better spectral efficiency and spectrum usage over current networks in order to facilitate dynamic and huge traffic demands. The integration of Flex-Grid technology increases the number of optical channels established over optical links, leading, however, to an increase in amplification power and possibly saturating optical amplifiers. In this work, we propose a power adaptation process that takes advantage of link optical signal to noise ratio (OSNR) margins to allow network operators to support this power increase while maintaining the use of legacy amplifiers. Results show that controlling channel optical power benefits from the Flex-Grid in terms of spectrum and capacity gain using in-place amplifier infrastructure.
{"title":"Optical power control to efficiently handle flex-grid spectrum gain over existing fixed-grid network infrastructures","authors":"M. Kanj, E. L. Rouzic, Djamel Amar, Jean-Luc Augé, Bernard A. Cousin, N. Brochier","doi":"10.1109/ICCNC.2016.7440674","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440674","url":null,"abstract":"The exponential traffic growth in optical networks has triggered the evolution from Fixed-Grid to Flex-Grid technology. This evolution allows better spectral efficiency and spectrum usage over current networks in order to facilitate dynamic and huge traffic demands. The integration of Flex-Grid technology increases the number of optical channels established over optical links, leading, however, to an increase in amplification power and possibly saturating optical amplifiers. In this work, we propose a power adaptation process that takes advantage of link optical signal to noise ratio (OSNR) margins to allow network operators to support this power increase while maintaining the use of legacy amplifiers. Results show that controlling channel optical power benefits from the Flex-Grid in terms of spectrum and capacity gain using in-place amplifier infrastructure.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132004405","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
扫码关注我们
求助内容：
应助结果提醒方式：