Pub Date : 1900-01-01DOI: 10.1109/ICCNC.2017.7876250
Artur Pilimon, Alexandra Zeimpeki, A. M. Fagertun, S. Ruepp
In this paper we analyze the impact of WDM-enhanced optical circuit switching on the power consumption of multiple Data Center Network (DCN) architectures. Traditional three-tier Tree, Fat-Tree and a ring-based structure are evaluated and optical switching is selectively introduced on different layers of the network topology. The analysis is based on network-level simulations using a transport network planning tool applied to small-scale setups of the considered DCNs. The obtained results show that introducing all-optical switching within the DCN leads to reduced power consumption in all architectures, except the traditional Tree. This is caused by the inability to perform efficient traffic grooming and smaller average nodal degree of this architecture. Enabling optical switching only at the aggregation layer results in the highest energy savings in Fat-Tree and traditional Tree, while an optically switched core benefits most the ring-based network. For the latter, the core ring nodes need fewer long-reach transponders at the trunk interfaces and benefit from more efficient traffic grooming in the access part.
{"title":"Energy efficiency benefits of introducing optical switching in Data Center Networks","authors":"Artur Pilimon, Alexandra Zeimpeki, A. M. Fagertun, S. Ruepp","doi":"10.1109/ICCNC.2017.7876250","DOIUrl":"https://doi.org/10.1109/ICCNC.2017.7876250","url":null,"abstract":"In this paper we analyze the impact of WDM-enhanced optical circuit switching on the power consumption of multiple Data Center Network (DCN) architectures. Traditional three-tier Tree, Fat-Tree and a ring-based structure are evaluated and optical switching is selectively introduced on different layers of the network topology. The analysis is based on network-level simulations using a transport network planning tool applied to small-scale setups of the considered DCNs. The obtained results show that introducing all-optical switching within the DCN leads to reduced power consumption in all architectures, except the traditional Tree. This is caused by the inability to perform efficient traffic grooming and smaller average nodal degree of this architecture. Enabling optical switching only at the aggregation layer results in the highest energy savings in Fat-Tree and traditional Tree, while an optically switched core benefits most the ring-based network. For the latter, the core ring nodes need fewer long-reach transponders at the trunk interfaces and benefit from more efficient traffic grooming in the access part.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"13 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":"122190784","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/ICCNC.2017.7876232
Anna Fang, Zina Ben-Miled
Bad news travels fast. Although this concept may be intuitively accepted, there has been little evidence to confirm that the propagation of bad news differs from that of good news. In this paper, we examine the effect of user perspective on his or her sharing of a controversial news story. Social media not only offers insight into human behavior but has also developed as a source of news. In this paper, we define the spreading of news by tracking selected tweets in Twitter as they are shared over time to create models of user sharing behavior. Many news events can be viewed as positive or negative. In this paper, we compare and contrast tweets about these news events among general users, while monitoring the tweet frequency for each event over time to ensure that news events are comparable with respect to user interest. In addition, we track the tweets of a controversial event between two different groups of users (i.e., those who view the event as positive and those who view it as negative). As a result, we are able to make assessments based on a single event from two different perspectives.
{"title":"Does bad news spread faster?","authors":"Anna Fang, Zina Ben-Miled","doi":"10.1109/ICCNC.2017.7876232","DOIUrl":"https://doi.org/10.1109/ICCNC.2017.7876232","url":null,"abstract":"Bad news travels fast. Although this concept may be intuitively accepted, there has been little evidence to confirm that the propagation of bad news differs from that of good news. In this paper, we examine the effect of user perspective on his or her sharing of a controversial news story. Social media not only offers insight into human behavior but has also developed as a source of news. In this paper, we define the spreading of news by tracking selected tweets in Twitter as they are shared over time to create models of user sharing behavior. Many news events can be viewed as positive or negative. In this paper, we compare and contrast tweets about these news events among general users, while monitoring the tweet frequency for each event over time to ensure that news events are comparable with respect to user interest. In addition, we track the tweets of a controversial event between two different groups of users (i.e., those who view the event as positive and those who view it as negative). As a result, we are able to make assessments based on a single event from two different perspectives.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"82 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":"126830054","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/ICCNC.2017.7876231
Jacqueline Hom, Lauren Good, Shuhui Yang
Delay tolerant networks (DTN) require innovation in routing technology because of the intermittent connectivity of the nodes in the network. Routing must account for the delay in connection. Some recent routing protocols use the social features of the nodes to aid in this process. These protocols may be categorized based on the number of message copies they produce, the number of destinations, and further the methods by which they select a relay node. Some issues are raised that must be addressed in further research, including buffer space management, energy efficiency, and adaptability.
{"title":"A survey of social-based routing protocols in Delay Tolerant Networks","authors":"Jacqueline Hom, Lauren Good, Shuhui Yang","doi":"10.1109/ICCNC.2017.7876231","DOIUrl":"https://doi.org/10.1109/ICCNC.2017.7876231","url":null,"abstract":"Delay tolerant networks (DTN) require innovation in routing technology because of the intermittent connectivity of the nodes in the network. Routing must account for the delay in connection. Some recent routing protocols use the social features of the nodes to aid in this process. These protocols may be categorized based on the number of message copies they produce, the number of destinations, and further the methods by which they select a relay node. Some issues are raised that must be addressed in further research, including buffer space management, energy efficiency, and adaptability.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"417 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":"116139068","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/ICCNC.2017.7876100
Md. Fazlul Kader, M. Shahab, S. Shin
We propose two novel cooperative spectrum sharing (CSS) protocols by using time-switching and power-splitting based energy harvesting (EH), namely CSS-TSP and CSS-PSP, respectively. The considered system consists of a set of energy constrained secondary transmitters (STs) that cooperate with the primary user to forward its symbol. All STs rely on the harvested energy from the source signal to forward the primary symbol. In exchange of cooperation, one of the STs behaving as the best EH decode-and-forward relay (STbr) gets channel access simultaneously with the primary user according to the non-orthogonal multiple access. Two STbr selection strategies, namely STbr selection based on harvested energy in current block of time and STbr selection based on harvested energy from current plus previous blocks of time, have been proposed. The distributed nature of the STbr selection in the proposed schemes to forward the primary symbol increases the network lifetime. We have investigated the achievable sum data rate/throughput of both CSS-TSP and CSS-PSP. Moreover, the optimal EH ratio that maximizes the sum data rate of both protocols is also investigated numerically.
{"title":"Cooperative spectrum sharing with energy harvesting best secondary user selection and non-orthogonal multiple access","authors":"Md. Fazlul Kader, M. Shahab, S. Shin","doi":"10.1109/ICCNC.2017.7876100","DOIUrl":"https://doi.org/10.1109/ICCNC.2017.7876100","url":null,"abstract":"We propose two novel cooperative spectrum sharing (CSS) protocols by using time-switching and power-splitting based energy harvesting (EH), namely CSS-TSP and CSS-PSP, respectively. The considered system consists of a set of energy constrained secondary transmitters (STs) that cooperate with the primary user to forward its symbol. All STs rely on the harvested energy from the source signal to forward the primary symbol. In exchange of cooperation, one of the STs behaving as the best EH decode-and-forward relay (STbr) gets channel access simultaneously with the primary user according to the non-orthogonal multiple access. Two STbr selection strategies, namely STbr selection based on harvested energy in current block of time and STbr selection based on harvested energy from current plus previous blocks of time, have been proposed. The distributed nature of the STbr selection in the proposed schemes to forward the primary symbol increases the network lifetime. We have investigated the achievable sum data rate/throughput of both CSS-TSP and CSS-PSP. Moreover, the optimal EH ratio that maximizes the sum data rate of both protocols is also investigated numerically.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"133 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":"122794747","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/ICCNC.2017.7876119
Yantian Hou, Ming Li, Dejun Yang
In Cognitive Radio Networks (CRNs), the spectrum underlay approach enables primary and secondary networks to transmit simultaneously, as long as the interference from the secondary network to the primary network is below certain threshold. As the recent advancement of the underlay approach, the transparent coexistence exploiting MIMO interference cancellation was proposed. Previous works assume that the secondary networks will completely follow the spectrum access rules by restricting their interference towards the primary network. However, this assumption might be invalid in practice due to the selfish nature of CRN users. In this work, we study the multi-hop MIMO-empowered secondary network's incentives of following or violating this rule through compliantly canceling or non-compliantly ignoring its interferences towards the primary network. Specifically, we model the coexistence between the primary and secondary networks as a Stackelberg game. The equilibriums reveal the secondary network's non-compliant incentives. These insights help in developing the methodology to deal with such type of selfish secondary networks.
{"title":"Game theoretical analysis of coexistence in MIMO-empowered Cognitive Radio Networks","authors":"Yantian Hou, Ming Li, Dejun Yang","doi":"10.1109/ICCNC.2017.7876119","DOIUrl":"https://doi.org/10.1109/ICCNC.2017.7876119","url":null,"abstract":"In Cognitive Radio Networks (CRNs), the spectrum underlay approach enables primary and secondary networks to transmit simultaneously, as long as the interference from the secondary network to the primary network is below certain threshold. As the recent advancement of the underlay approach, the transparent coexistence exploiting MIMO interference cancellation was proposed. Previous works assume that the secondary networks will completely follow the spectrum access rules by restricting their interference towards the primary network. However, this assumption might be invalid in practice due to the selfish nature of CRN users. In this work, we study the multi-hop MIMO-empowered secondary network's incentives of following or violating this rule through compliantly canceling or non-compliantly ignoring its interferences towards the primary network. Specifically, we model the coexistence between the primary and secondary networks as a Stackelberg game. The equilibriums reveal the secondary network's non-compliant incentives. These insights help in developing the methodology to deal with such type of selfish secondary networks.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"128 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":"123036493","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/ICCNC.2017.7876211
Mark Alan Matties
We present the architecture and partial proof of concept implementation of distributed responder ARP (DR-ARP), a software defined networking (SDN) enabled enhancement of the standard address resolution protocol (ARP). It is intended to improve network security and performance by exerting much greater control over how ARP traffic flows through the network as well as over what actually delivers the ARP service. Using SDN to centralize this service improves the security and performance of ARP in a way transparent to the end hosts.
{"title":"Distributed responder ARP: Using SDN to re-engineer ARP from within the network","authors":"Mark Alan Matties","doi":"10.1109/ICCNC.2017.7876211","DOIUrl":"https://doi.org/10.1109/ICCNC.2017.7876211","url":null,"abstract":"We present the architecture and partial proof of concept implementation of distributed responder ARP (DR-ARP), a software defined networking (SDN) enabled enhancement of the standard address resolution protocol (ARP). It is intended to improve network security and performance by exerting much greater control over how ARP traffic flows through the network as well as over what actually delivers the ARP service. Using SDN to centralize this service improves the security and performance of ARP in a way transparent to the end hosts.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","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":"131740759","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/ICCNC.2017.7876205
Najmeddine Majed, S. Ragot, X. Lagrange, Alberto Blanc
In this paper we evaluate metrics specified in 3GPP to characterize trade-offs between delay and quality of Voice over LTE (VoLTE) mobile phones in various network conditions. We report test results on clock accuracy, terminal delay in uplink and downlink under error-free conditions, as well as delay and quality in the presence of packet losses and network jitter. We discuss how the underlying methodology intended for delay testing can be extended to evaluate de-jitter buffer performance using a black-box approach, and how to model VoLTE packet delay/loss characteristics in a realistic way.
{"title":"Delay and quality metrics in Voice over LTE (VoLTE) networks: An end-terminal perspective","authors":"Najmeddine Majed, S. Ragot, X. Lagrange, Alberto Blanc","doi":"10.1109/ICCNC.2017.7876205","DOIUrl":"https://doi.org/10.1109/ICCNC.2017.7876205","url":null,"abstract":"In this paper we evaluate metrics specified in 3GPP to characterize trade-offs between delay and quality of Voice over LTE (VoLTE) mobile phones in various network conditions. We report test results on clock accuracy, terminal delay in uplink and downlink under error-free conditions, as well as delay and quality in the presence of packet losses and network jitter. We discuss how the underlying methodology intended for delay testing can be extended to evaluate de-jitter buffer performance using a black-box approach, and how to model VoLTE packet delay/loss characteristics in a realistic way.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"32 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":"132577468","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/ICCNC.2017.7876235
Andrew Choliy, Feng Li, Tianchong Gao
The incredible popularity of the Android mobile operating system has resulted in a massive influx of malicious applications for the platform. This malware can come from a number of sources as Google allows the installation of Android App Packages (APKs) from third parties. Even within its own Google Play storefront, however, malicious software can be found.
{"title":"Obfuscating function call topography to test structural malware detection against evasion attacks","authors":"Andrew Choliy, Feng Li, Tianchong Gao","doi":"10.1109/ICCNC.2017.7876235","DOIUrl":"https://doi.org/10.1109/ICCNC.2017.7876235","url":null,"abstract":"The incredible popularity of the Android mobile operating system has resulted in a massive influx of malicious applications for the platform. This malware can come from a number of sources as Google allows the installation of Android App Packages (APKs) from third parties. Even within its own Google Play storefront, however, malicious software can be found.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"29 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":"133933046","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/ICCNC.2017.7876239
Erdal Akin, T. Korkmaz
Routing a given set of flows with bandwidth requirements is a fundamental problem, which has been formulated as Unsplittable Flow Problem (UFP). One of the key issues in this formulation is that the bandwidth requirement is fixed for each flow. In practice, however, many applications (e.g., video-on-demand, backup and replication services) would greatly benefit from getting more bandwidths beyond the fixed minimum bandwidth requirement. To achieve this, we extended UFP such that bandwidth requirements will be given in a range. The challenge is now how to find paths and dynamically determine the allocated bandwidths such that we can provide more bandwidth to each flow while making sure that each flow gets at least the requested minimum amount. Like UFP, the extended UFP problem is also NP-Hard. Therefore, we propose two heuristics and demonstrate their efficiency using simulation.
{"title":"An efficient binary-search based heuristic for extended Unsplittable Flow Problem","authors":"Erdal Akin, T. Korkmaz","doi":"10.1109/ICCNC.2017.7876239","DOIUrl":"https://doi.org/10.1109/ICCNC.2017.7876239","url":null,"abstract":"Routing a given set of flows with bandwidth requirements is a fundamental problem, which has been formulated as Unsplittable Flow Problem (UFP). One of the key issues in this formulation is that the bandwidth requirement is fixed for each flow. In practice, however, many applications (e.g., video-on-demand, backup and replication services) would greatly benefit from getting more bandwidths beyond the fixed minimum bandwidth requirement. To achieve this, we extended UFP such that bandwidth requirements will be given in a range. The challenge is now how to find paths and dynamically determine the allocated bandwidths such that we can provide more bandwidth to each flow while making sure that each flow gets at least the requested minimum amount. Like UFP, the extended UFP problem is also NP-Hard. Therefore, we propose two heuristics and demonstrate their efficiency using simulation.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"405 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":"133178915","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/ICCNC.2017.7876125
Christopher Mansour, D. Chasaki
In today's modern networks, routers rely on high-performance multi-core packet processing systems to implement a variety of applications and operations required to forward traffic. This leads to an increase in the complexity of such systems and hence the number of processing cores. Managing such processing cores and ensuring their correct operation become a difficult task. In this paper, we address this problem by proposing another novel approach to verify the correct operation of network processor and detect any attack/failure. This approach monitors the power consumption of such cores at the OS level during run-time and correlates it statistically with predetermined benchmark information. We show that based on this correlation, any failure/attack can be detected.
{"title":"Real-time attack and failure detection for next generation networks","authors":"Christopher Mansour, D. Chasaki","doi":"10.1109/ICCNC.2017.7876125","DOIUrl":"https://doi.org/10.1109/ICCNC.2017.7876125","url":null,"abstract":"In today's modern networks, routers rely on high-performance multi-core packet processing systems to implement a variety of applications and operations required to forward traffic. This leads to an increase in the complexity of such systems and hence the number of processing cores. Managing such processing cores and ensuring their correct operation become a difficult task. In this paper, we address this problem by proposing another novel approach to verify the correct operation of network processor and detect any attack/failure. This approach monitors the power consumption of such cores at the OS level during run-time and correlates it statistically with predetermined benchmark information. We show that based on this correlation, any failure/attack can be detected.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"21 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":"134059141","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
扫码关注我们
求助内容：
应助结果提醒方式：