Pub Date : 1900-01-01DOI: 10.1109/COMSNETS.2017.7945436
A. Roy, Pranabesh Maji, Gowthamkrishnan Cherukuri, S. Kundu
In this paper, we analyze the secrecy performance of a two hop communication system with a Decode-and-Forward (DF) relay in a k-μ fading channel for Internet of Things (IOT) applications in the presence of an eavesdropper. The eavesdropper wiretaps from a single hop in the first case and from both the hops in second case. Analytical expressions for Secrecy Outage Probability (SOP) and Strictly Positive Secrecy Capacity (SPSC) have been derived. MATLAB based simulation has been carried out to evaluate the secrecy performance following our analytical formulation. Effects of channel and network parameters on secrecy performance are indicated.
{"title":"PHY layer security for IOT in κ-μ fading channel","authors":"A. Roy, Pranabesh Maji, Gowthamkrishnan Cherukuri, S. Kundu","doi":"10.1109/COMSNETS.2017.7945436","DOIUrl":"https://doi.org/10.1109/COMSNETS.2017.7945436","url":null,"abstract":"In this paper, we analyze the secrecy performance of a two hop communication system with a Decode-and-Forward (DF) relay in a k-μ fading channel for Internet of Things (IOT) applications in the presence of an eavesdropper. The eavesdropper wiretaps from a single hop in the first case and from both the hops in second case. Analytical expressions for Secrecy Outage Probability (SOP) and Strictly Positive Secrecy Capacity (SPSC) have been derived. MATLAB based simulation has been carried out to evaluate the secrecy performance following our analytical formulation. Effects of channel and network parameters on secrecy performance are indicated.","PeriodicalId":168357,"journal":{"name":"2017 9th International Conference on Communication Systems and Networks (COMSNETS)","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126986821","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 : 1900-01-01DOI: 10.1109/COMSNETS.2017.7945462
Venkatareddy Akumalla, Mohammed Zafar Ali Khan, K. Detroja
State estimation is essential in monitoring any Cyber-Physical System. When there is a wireless communication channel present between sensor and remote estimator, the imperfections associated with wireless channel like packet loss and quantization error due to limited capacity of the channel will have major impact on estimation. Hence, studying the effect of these imperfections is very important for critical cyber-physical system applications. In this paper, we model and study the effect of quantization and the joint effect of both packet loss and quantization on the estimation and give error covariance bounds.
{"title":"Modeling the effect of quantization and packet loss on state estimation in cyber-physical systems","authors":"Venkatareddy Akumalla, Mohammed Zafar Ali Khan, K. Detroja","doi":"10.1109/COMSNETS.2017.7945462","DOIUrl":"https://doi.org/10.1109/COMSNETS.2017.7945462","url":null,"abstract":"State estimation is essential in monitoring any Cyber-Physical System. When there is a wireless communication channel present between sensor and remote estimator, the imperfections associated with wireless channel like packet loss and quantization error due to limited capacity of the channel will have major impact on estimation. Hence, studying the effect of these imperfections is very important for critical cyber-physical system applications. In this paper, we model and study the effect of quantization and the joint effect of both packet loss and quantization on the estimation and give error covariance bounds.","PeriodicalId":168357,"journal":{"name":"2017 9th International Conference on Communication Systems and Networks (COMSNETS)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132130670","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 : 1900-01-01DOI: 10.1109/COMSNETS.2017.7945404
N. Sharma, G. R. M. Reddy
In this paper, we propose a branch-and-bound based exact algorithm for allocating multi-dimensional variable sized VMs at the cloud data center. Further, an energy efficient VMs migration technique is proposed to reduce the energy consumption and thus avoids the Service Level Agreement (SLA) violation at the cloud data center.
{"title":"A novel approach for multi-dimensional variable sized virtual machine allocation and migration at cloud data center","authors":"N. Sharma, G. R. M. Reddy","doi":"10.1109/COMSNETS.2017.7945404","DOIUrl":"https://doi.org/10.1109/COMSNETS.2017.7945404","url":null,"abstract":"In this paper, we propose a branch-and-bound based exact algorithm for allocating multi-dimensional variable sized VMs at the cloud data center. Further, an energy efficient VMs migration technique is proposed to reduce the energy consumption and thus avoids the Service Level Agreement (SLA) violation at the cloud data center.","PeriodicalId":168357,"journal":{"name":"2017 9th International Conference on Communication Systems and Networks (COMSNETS)","volume":"668 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122965876","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 : 1900-01-01DOI: 10.1109/COMSNETS.2017.7945392
Shilpa Rao, R. Shorey
Internet of things (IoT) encompass a plethora of connected smart devices and support diverse applications. IoT is likely to be an integral feature of next generation cellular systems. In the manufacturing and supply chain industry, the Industrial IoT (IIoT), which consists of sensors, actuators and machinery, is deployed for monitoring, data collection and analysis, asset management, maintenance planning, and plant control and optimization. In this work, we consider the uplink transmission of an IIoT system, in which the IoT devices transmit their data to the Base Station (BS) through User Equipments (UEs). The BS, in turn, transmits the data to the cloud for further processing. The UEs receive the data from the IoT devices, aggregate with their uplink data, and transmit the aggregated data to the BS. Our investigation shows that the IoT devices require less transmit energy when UEs are used as relays. We study the system when the IoT devices associate themselves with the UEs through the fixed, random, and greedy schemes, and evaluate the end-to-end outage probability at the devices for each of the three schemes. We show that the greedy association scheme has the minimum outage probability at the IoT device. We study the effect of the number of IoT devices, the number of UEs, the data arrival rates at the IoT devices, and the uplink data evolution process of UEs on the outage probability, and draw meaningful insights into IIoT system design.
{"title":"Efficient device-to-device association and data aggregation in industrial IoT systems","authors":"Shilpa Rao, R. Shorey","doi":"10.1109/COMSNETS.2017.7945392","DOIUrl":"https://doi.org/10.1109/COMSNETS.2017.7945392","url":null,"abstract":"Internet of things (IoT) encompass a plethora of connected smart devices and support diverse applications. IoT is likely to be an integral feature of next generation cellular systems. In the manufacturing and supply chain industry, the Industrial IoT (IIoT), which consists of sensors, actuators and machinery, is deployed for monitoring, data collection and analysis, asset management, maintenance planning, and plant control and optimization. In this work, we consider the uplink transmission of an IIoT system, in which the IoT devices transmit their data to the Base Station (BS) through User Equipments (UEs). The BS, in turn, transmits the data to the cloud for further processing. The UEs receive the data from the IoT devices, aggregate with their uplink data, and transmit the aggregated data to the BS. Our investigation shows that the IoT devices require less transmit energy when UEs are used as relays. We study the system when the IoT devices associate themselves with the UEs through the fixed, random, and greedy schemes, and evaluate the end-to-end outage probability at the devices for each of the three schemes. We show that the greedy association scheme has the minimum outage probability at the IoT device. We study the effect of the number of IoT devices, the number of UEs, the data arrival rates at the IoT devices, and the uplink data evolution process of UEs on the outage probability, and draw meaningful insights into IIoT system design.","PeriodicalId":168357,"journal":{"name":"2017 9th International Conference on Communication Systems and Networks (COMSNETS)","volume":"90-C 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123465704","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 : 1900-01-01DOI: 10.1109/COMSNETS.2017.7945400
Samir Kumar Mishra, Puneet Pandey, P. Arya
This paper discusses the problem of adaptively suppressing co-channel interference in a cellular wireless receiver. The technique makes use of statistical data to design a polynomial based classifier which can be used to identify the number of co-channel interferers. The result of detection is used to adaptively vary the order of interference suppression filter and the length of overall channel impulse response. The polynomial classifier is based on the eigenvalues of error covariance matrix and signal-to-interference-plus-noise ratio (SINR). An improvement of 1.5 dB is seen in receiver performance. Further, the parameters so derived for the classifier can be used to enhance the reliability of channel state information in more advanced communication systems, preferably LTE-A or 5G.
{"title":"Efficient spectrum harvesting using adaptive co-channel interference suppression based on polynomial classifier","authors":"Samir Kumar Mishra, Puneet Pandey, P. Arya","doi":"10.1109/COMSNETS.2017.7945400","DOIUrl":"https://doi.org/10.1109/COMSNETS.2017.7945400","url":null,"abstract":"This paper discusses the problem of adaptively suppressing co-channel interference in a cellular wireless receiver. The technique makes use of statistical data to design a polynomial based classifier which can be used to identify the number of co-channel interferers. The result of detection is used to adaptively vary the order of interference suppression filter and the length of overall channel impulse response. The polynomial classifier is based on the eigenvalues of error covariance matrix and signal-to-interference-plus-noise ratio (SINR). An improvement of 1.5 dB is seen in receiver performance. Further, the parameters so derived for the classifier can be used to enhance the reliability of channel state information in more advanced communication systems, preferably LTE-A or 5G.","PeriodicalId":168357,"journal":{"name":"2017 9th International Conference on Communication Systems and Networks (COMSNETS)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123607583","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 : 1900-01-01DOI: 10.1109/COMSNETS.2017.7945449
Akhil Shetty, Sharayu Moharir
Studies on creativity, largely recognized as a precursor to innovation, have rapidly multiplied in the recent past. In particular, the impact of social network parameters on creativity has received increased attention. As an individual's social network regulates access to diverse ideas and perspectives, it has been observed to play a pivotal role in influencing creativity. In this paper, we propose a model which encapsulates the relationship between creativity and several social network parameters. We show that our model is consistent with the results of empirical studies in this domain. We also suggest how organizations could use our model to modify their network structure so as to boost creativity.
{"title":"Modeling creativity in social networks","authors":"Akhil Shetty, Sharayu Moharir","doi":"10.1109/COMSNETS.2017.7945449","DOIUrl":"https://doi.org/10.1109/COMSNETS.2017.7945449","url":null,"abstract":"Studies on creativity, largely recognized as a precursor to innovation, have rapidly multiplied in the recent past. In particular, the impact of social network parameters on creativity has received increased attention. As an individual's social network regulates access to diverse ideas and perspectives, it has been observed to play a pivotal role in influencing creativity. In this paper, we propose a model which encapsulates the relationship between creativity and several social network parameters. We show that our model is consistent with the results of empirical studies in this domain. We also suggest how organizations could use our model to modify their network structure so as to boost creativity.","PeriodicalId":168357,"journal":{"name":"2017 9th International Conference on Communication Systems and Networks (COMSNETS)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122700318","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 : 1900-01-01DOI: 10.1109/COMSNETS.2017.7945390
M. Roy, C. Chowdhury, N. Aslam
Advancement of medical science brings together new trend of proactive health care which gives rise to the era of Wireless Body Area Networks (WBAN). A number of issues including energy efficiency, reliability, optimal use of network bandwidth need to be considered for designing any multi-hop communication protocol for WBANs. Energy consumption depends on many factors like amount and frequency of forwarding traffic, node activity, distance from sink etc. Energy consumption gives rise to other issues like heated nodes. Existing routing protocols are mostly single hop or multi-hop, and generally focus on one issue ignoring the others. In this paper, we first identify the sources of energy drain, and then propose a 2-hop cost based energy efficient routing protocol for WBAN that formulates the energy drain of a node due to various reasons and incorporates it in the routing decision. Relative node mobility due to posture change is also considered here. The protocol is simulated in Castalia simulator and compared with state of the art protocols. It is found to outperform state of the art protocols in terms of packet delivery ratio for a given transmission power level. Moreover, only a small number of relays are found to be sufficient to stabilize packet delivery ratio.
{"title":"Designing an energy efficient WBAN routing protocol","authors":"M. Roy, C. Chowdhury, N. Aslam","doi":"10.1109/COMSNETS.2017.7945390","DOIUrl":"https://doi.org/10.1109/COMSNETS.2017.7945390","url":null,"abstract":"Advancement of medical science brings together new trend of proactive health care which gives rise to the era of Wireless Body Area Networks (WBAN). A number of issues including energy efficiency, reliability, optimal use of network bandwidth need to be considered for designing any multi-hop communication protocol for WBANs. Energy consumption depends on many factors like amount and frequency of forwarding traffic, node activity, distance from sink etc. Energy consumption gives rise to other issues like heated nodes. Existing routing protocols are mostly single hop or multi-hop, and generally focus on one issue ignoring the others. In this paper, we first identify the sources of energy drain, and then propose a 2-hop cost based energy efficient routing protocol for WBAN that formulates the energy drain of a node due to various reasons and incorporates it in the routing decision. Relative node mobility due to posture change is also considered here. The protocol is simulated in Castalia simulator and compared with state of the art protocols. It is found to outperform state of the art protocols in terms of packet delivery ratio for a given transmission power level. Moreover, only a small number of relays are found to be sufficient to stabilize packet delivery ratio.","PeriodicalId":168357,"journal":{"name":"2017 9th International Conference on Communication Systems and Networks (COMSNETS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121720733","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 : 1900-01-01DOI: 10.1109/COMSNETS.2017.7945422
S. ThomasValerrianPasca, Sumanta Patro, T. B. Reddy, A. Franklin
A tighter coupling [1] between LTE and Wi-Fi interfaces can be achieved by integrating them at the radio protocol stack. LTE Wi-Fi radio level integration with IPsec tunnel (LWIP) is one such architecture introduced in Rel.13 of 3GPP. We have developed a variant of LWIP prototype and made commercial UE to readily work with the LWIP. The developed LWIP testbed uses OpenAirInterface (OAI) for LTE network and Cisco AP /Atheros device with Hostapd as Wi-Fi Access Point. In this demo, we present the aggregation benefits of using LWIP at flow/packet/bearer level steering across LTE and Wi-Fi links.
通过在无线协议栈上将LTE和Wi-Fi接口集成，可以实现两者之间更紧密的耦合。LTE Wi-Fi无线级集成与IPsec隧道(LWIP)是3GPP Rel.13中引入的一种这样的架构。我们已经开发了LWIP原型的一个变体，并使商业UE易于与LWIP一起工作。开发的LWIP测试平台使用OpenAirInterface (OAI)用于LTE网络，并使用Cisco AP /Atheros设备与Hostapd作为Wi-Fi接入点。在这个演示中，我们展示了在LTE和Wi-Fi链路的流/包/承载级转向上使用LWIP的聚合优势。
{"title":"Tightly coupled LTE Wi-Fi radio access networks: A demo of LWIP","authors":"S. ThomasValerrianPasca, Sumanta Patro, T. B. Reddy, A. Franklin","doi":"10.1109/COMSNETS.2017.7945422","DOIUrl":"https://doi.org/10.1109/COMSNETS.2017.7945422","url":null,"abstract":"A tighter coupling [1] between LTE and Wi-Fi interfaces can be achieved by integrating them at the radio protocol stack. LTE Wi-Fi radio level integration with IPsec tunnel (LWIP) is one such architecture introduced in Rel.13 of 3GPP. We have developed a variant of LWIP prototype and made commercial UE to readily work with the LWIP. The developed LWIP testbed uses OpenAirInterface (OAI) for LTE network and Cisco AP /Atheros device with Hostapd as Wi-Fi Access Point. In this demo, we present the aggregation benefits of using LWIP at flow/packet/bearer level steering across LTE and Wi-Fi links.","PeriodicalId":168357,"journal":{"name":"2017 9th International Conference on Communication Systems and Networks (COMSNETS)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115398839","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 : 1900-01-01DOI: 10.1109/COMSNETS.2017.7945373
Madanagopal Ramachandran, K. Sivalingam
Service providers employ different transport technologies like PDH, SDH/SONET, WDM/DWDM, ATM, DSL etc. to support different types of traffic and service requirements. Dynamic service provisioning requires the use of on-line algorithms which automatically compute the path to be taken to satisfy the given service request. Transport networks are deployed such that they follow different topologies such as linear, ring, mesh, protected linear, dual homing etc. In this work, a new mechanism for path computation is proposed. Here, two types of graphs are considered: a super graph containing the topologies as nodes and common nodes as edges and the base graph containing network elements as nodes and physical links as edges. An algorithm to compute the best path taking into account the topologies present in the super graph and then finding the basic path from the topology path is proposed. It takes into account topologies with and without protection and protection path is found wherever required. When every edge in the network belongs to a topology, then the performance of the proposed algorithms is much better when compared with the traditional path computation algorithms. But, when many of the edges do not belong to any topology in the network, then the performance of the algorithms were poor when compared with the traditional path computation algorithms.
{"title":"Topology based path computation for provisioning in transport networks","authors":"Madanagopal Ramachandran, K. Sivalingam","doi":"10.1109/COMSNETS.2017.7945373","DOIUrl":"https://doi.org/10.1109/COMSNETS.2017.7945373","url":null,"abstract":"Service providers employ different transport technologies like PDH, SDH/SONET, WDM/DWDM, ATM, DSL etc. to support different types of traffic and service requirements. Dynamic service provisioning requires the use of on-line algorithms which automatically compute the path to be taken to satisfy the given service request. Transport networks are deployed such that they follow different topologies such as linear, ring, mesh, protected linear, dual homing etc. In this work, a new mechanism for path computation is proposed. Here, two types of graphs are considered: a super graph containing the topologies as nodes and common nodes as edges and the base graph containing network elements as nodes and physical links as edges. An algorithm to compute the best path taking into account the topologies present in the super graph and then finding the basic path from the topology path is proposed. It takes into account topologies with and without protection and protection path is found wherever required. When every edge in the network belongs to a topology, then the performance of the proposed algorithms is much better when compared with the traditional path computation algorithms. But, when many of the edges do not belong to any topology in the network, then the performance of the algorithms were poor when compared with the traditional path computation algorithms.","PeriodicalId":168357,"journal":{"name":"2017 9th International Conference on Communication Systems and Networks (COMSNETS)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127660714","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 : 1900-01-01DOI: 10.1109/COMSNETS.2017.7945388
Madanagopal Ramachandran, K. Sivalingam
Synchronous Digital Hierarchy (SDH) is a widely used technology in access and core networks for carrying different types of traffic. It defines a hierarchy for multiplexing lower rate traffic containers into higher rate traffic containers. Provisioning refers to the process of allocation of resources to carry a given traffic demand. Due to the continued expansion of the networks employing SDH technology, the power consumption of the network increases becoming a bottleneck for further expansion. Allocation of resources to traffic demands in power-efficient ways will therefore help in minimizing the capital and operational costs in running the network. In this work, the power consumed by a switch matrix having the capability to switch different traffic containers in different amounts is considered. The objective is to minimize the number of network elements deployed in the network by allocating resources to traffic demands in power-efficient ways. A formulation based on Integer Linear Programming (ILP) is presented; three different heuristic approaches, based on how higher order trails are used and the use of grooming, are proposed. It is found that the grooming-based heuristic performs better in terms of the total power consumption relative to the weighted number of requests accepted. It is also found that, for small networks, the grooming heuristic performs identical to the optimal solution found by an LP solver when the problem is feasible. It can be noted that the power-efficient design is also a cost-efficient design since the capacity of the switch matrix determines the number of network elements that are required for deployment in the network.
{"title":"Power efficient resource allocation algorithms for provisioning in SDH networks","authors":"Madanagopal Ramachandran, K. Sivalingam","doi":"10.1109/COMSNETS.2017.7945388","DOIUrl":"https://doi.org/10.1109/COMSNETS.2017.7945388","url":null,"abstract":"Synchronous Digital Hierarchy (SDH) is a widely used technology in access and core networks for carrying different types of traffic. It defines a hierarchy for multiplexing lower rate traffic containers into higher rate traffic containers. Provisioning refers to the process of allocation of resources to carry a given traffic demand. Due to the continued expansion of the networks employing SDH technology, the power consumption of the network increases becoming a bottleneck for further expansion. Allocation of resources to traffic demands in power-efficient ways will therefore help in minimizing the capital and operational costs in running the network. In this work, the power consumed by a switch matrix having the capability to switch different traffic containers in different amounts is considered. The objective is to minimize the number of network elements deployed in the network by allocating resources to traffic demands in power-efficient ways. A formulation based on Integer Linear Programming (ILP) is presented; three different heuristic approaches, based on how higher order trails are used and the use of grooming, are proposed. It is found that the grooming-based heuristic performs better in terms of the total power consumption relative to the weighted number of requests accepted. It is also found that, for small networks, the grooming heuristic performs identical to the optimal solution found by an LP solver when the problem is feasible. It can be noted that the power-efficient design is also a cost-efficient design since the capacity of the switch matrix determines the number of network elements that are required for deployment in the network.","PeriodicalId":168357,"journal":{"name":"2017 9th International Conference on Communication Systems and Networks (COMSNETS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131295649","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
扫码关注我们
求助内容：
应助结果提醒方式：