The largest part of routers and switches, today deployed in production networks, has very limited energy saving capabilities, and substantially requires the same amount of energy both when working at full speed or when being idle. In order to dynamically adapt such energy requirements to the real device work load, current approaches foster the introduction of low power idle and power scaling primitives in entire devices, internal components and network interfaces. Starting from these considerations, we propose an analysis of the theoretical and technological limitations in adopting such kind of mechanisms. The results achieved show that the power scaling allows a linear trade-off between consumption and network performance, but the time to switch between two power states may cause a non negligible service interruption.
{"title":"Power scaling in network devices","authors":"R. Bolla, R. Bruschi, A. Carrega","doi":"10.1145/1921206.1921216","DOIUrl":"https://doi.org/10.1145/1921206.1921216","url":null,"abstract":"The largest part of routers and switches, today deployed in production networks, has very limited energy saving capabilities, and substantially requires the same amount of energy both when working at full speed or when being idle. In order to dynamically adapt such energy requirements to the real device work load, current approaches foster the introduction of low power idle and power scaling primitives in entire devices, internal components and network interfaces. Starting from these considerations, we propose an analysis of the theoretical and technological limitations in adopting such kind of mechanisms. The results achieved show that the power scaling allows a linear trade-off between consumption and network performance, but the time to switch between two power states may cause a non negligible service interruption.","PeriodicalId":325024,"journal":{"name":"CoNEXT '10 Student Workshop","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117148052","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}
Nowadays, mobile wireless users are in constant demand of connectivity. Satisfying the connectivity requirements of the users requires a large amount of Access Points (APs) in order to enlarge the wireless service coverage. Wireless Metropolitan Area Sharing Networks (WMSN) are a low cost alternative that fulfill this high degree of user requirements. On WMSN certain places will experiment congestion when a large number of users are associated with the same device. For this reason, new mechanisms are required with the aim of satisfy the Quality of User Experience (QoE). The Experience Level Agreements (ELA) definition for WMSN is a formal way to characterize the requirements of the users and permits having measuring functions for this kind of network, which helps to improve the QoE.
{"title":"Experience level agreements in wireless metropolitan area sharing networks","authors":"M. A. Girón","doi":"10.1145/1921206.1921215","DOIUrl":"https://doi.org/10.1145/1921206.1921215","url":null,"abstract":"Nowadays, mobile wireless users are in constant demand of connectivity.\u0000 Satisfying the connectivity requirements of the users requires a large amount of Access Points (APs) in order to enlarge the wireless service coverage. Wireless Metropolitan Area Sharing Networks (WMSN) are a low cost alternative that fulfill this high degree of user requirements.\u0000 On WMSN certain places will experiment congestion when a large number of users are associated with the same device. For this reason, new mechanisms are required with the aim of satisfy the Quality of User Experience (QoE).\u0000 The Experience Level Agreements (ELA) definition for WMSN is a formal way to characterize the requirements of the users and permits having measuring functions for this kind of network, which helps to improve the QoE.","PeriodicalId":325024,"journal":{"name":"CoNEXT '10 Student Workshop","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125420753","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}
Matthias Wählisch, T. Schmidt, Sebastian Meiling, Markus de Brün, Thomas Häberlen
Data communication in the Internet is based on the borderless interplay of Autonomous Systems (ASes). An AS abstracts one or multiple IP networks, which may be globally distributed, but is owned by an organization located in a country. Current research on the Internet structure mainly focuses on a global perspective or considers local, intra-domain properties. In this paper, we analyze nation-centric subsets of the Internet taken from the AS-level graph of Germany. Each subset reflects a public or industrial sector. Based on a classified set of relevant German ASes, we are able to perform detailed investigations of structural dependencies for the critical Internet infrastructure. We identify and visualize the importance of dedicated ASes within specific sectors, and quantify robustness of the communication communities. Our preliminary results indicate that members of sectoral groups tend to avoid direct peering, but connect via a small group of common ISPs. This results in an enhanced dependence (betweenness) on selected hubs as compared to the characteristics of larger networks.
{"title":"Towards a nation-centric understanding of the internet","authors":"Matthias Wählisch, T. Schmidt, Sebastian Meiling, Markus de Brün, Thomas Häberlen","doi":"10.1145/1921206.1921214","DOIUrl":"https://doi.org/10.1145/1921206.1921214","url":null,"abstract":"Data communication in the Internet is based on the borderless interplay of Autonomous Systems (ASes). An AS abstracts one or multiple IP networks, which may be globally distributed, but is owned by an organization located in a country. Current research on the Internet structure mainly focuses on a global perspective or considers local, intra-domain properties. In this paper, we analyze nation-centric subsets of the Internet taken from the AS-level graph of Germany. Each subset reflects a public or industrial sector. Based on a classified set of relevant German ASes, we are able to perform detailed investigations of structural dependencies for the critical Internet infrastructure. We identify and visualize the importance of dedicated ASes within specific sectors, and quantify robustness of the communication communities. Our preliminary results indicate that members of sectoral groups tend to avoid direct peering, but connect via a small group of common ISPs. This results in an enhanced dependence (betweenness) on selected hubs as compared to the characteristics of larger networks.","PeriodicalId":325024,"journal":{"name":"CoNEXT '10 Student Workshop","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127080700","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}
Zhuo Chen, Yibo Zhu, Yang Chen, Beixing Deng, Xing Li
The network coordinate (NC) systems, which are scalable in estimating the latencies between network hosts, are significantly limited by the Triangle Inequality Violations (TIVs). Previously, two-layer Vivaldi systems like Pharos were proposed to remedy the impact of TIV. In our recent research, we built a new system, Tarantula, which deals with a larger portion of existing TIVs. Our simulation demonstrates that this new system achieves a higher estimation accuracy than the two-layer systems do.
{"title":"Reducing TIV interference in network coordinate systems","authors":"Zhuo Chen, Yibo Zhu, Yang Chen, Beixing Deng, Xing Li","doi":"10.1145/1921206.1921213","DOIUrl":"https://doi.org/10.1145/1921206.1921213","url":null,"abstract":"The network coordinate (NC) systems, which are scalable in estimating the latencies between network hosts, are significantly limited by the Triangle Inequality Violations (TIVs). Previously, two-layer Vivaldi systems like Pharos were proposed to remedy the impact of TIV. In our recent research, we built a new system, Tarantula, which deals with a larger portion of existing TIVs. Our simulation demonstrates that this new system achieves a higher estimation accuracy than the two-layer systems do.","PeriodicalId":325024,"journal":{"name":"CoNEXT '10 Student Workshop","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131863851","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}
In this paper, we study the potential security issues in data center networks (DCN). We focus on TCP, and propose a synchronized denial of service (SDoS) attack model. In SDoS, malicious tenants may employ multiple virtual machines (VM) as attackers and launch a low-rate synchronized DoS attack to VMs of the targeted victims. We give an analysis and our preliminary experiments confirm the feasibility of such SDoS attack.
{"title":"Exploring potential vulnerabilities in data center network","authors":"Zhenqian Feng, Haitao Wu, Jinshu Su","doi":"10.1145/1921206.1921219","DOIUrl":"https://doi.org/10.1145/1921206.1921219","url":null,"abstract":"In this paper, we study the potential security issues in data center networks (DCN). We focus on TCP, and propose a synchronized denial of service (SDoS) attack model. In SDoS, malicious tenants may employ multiple virtual machines (VM) as attackers and launch a low-rate synchronized DoS attack to VMs of the targeted victims. We give an analysis and our preliminary experiments confirm the feasibility of such SDoS attack.","PeriodicalId":325024,"journal":{"name":"CoNEXT '10 Student Workshop","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132416869","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}
Peer-to-Peer (P2P) systems have gained a phenomenal popularity in the past few years; BitTorrent serves daily tens of millions of people and generates an important fraction of the Internet traffic. Measurement data collected from real P2P systems are fundamental for gaining solid knowledge of the usage patterns and the characteristics of these systems, and can improve the modeling, the design, and the evaluation of P2P systems. Although many P2P measurements have been carried out in the last decade [1, 2, 4, 6, 7], few measurement data sets are publicly available, and for these few the data are presented in different formats. This situation hampers the exchange, study, and reuse of existing traces. Furthermore, due to the lack of available datasets, many P2P studies have been based on unrealistic assumptions about the characteristics and usage patterns of P2P systems; as a consequence, many P2P algorithms and methods lack a realistic evaluation. To remedy this situation, we have set to create the P2P Trace Archive (P2PTA), a virtual meeting place that facilitates the collection and exchange of P2P traces.
{"title":"The peer-to-peer trace archive: design and comparative trace analysis","authors":"Boxun Zhang, A. Iosup, J. Pouwelse, D. Epema","doi":"10.1145/1921206.1921229","DOIUrl":"https://doi.org/10.1145/1921206.1921229","url":null,"abstract":"Peer-to-Peer (P2P) systems have gained a phenomenal popularity in the past few years; BitTorrent serves daily tens of millions of people and generates an important fraction of the Internet traffic. Measurement data collected from real P2P systems are fundamental for gaining solid knowledge of the usage patterns and the characteristics of these systems, and can improve the modeling, the design, and the evaluation of P2P systems. Although many P2P measurements have been carried out in the last decade [1, 2, 4, 6, 7], few measurement data sets are publicly available, and for these few the data are presented in different formats. This situation hampers the exchange, study, and reuse of existing traces. Furthermore, due to the lack of available datasets, many P2P studies have been based on unrealistic assumptions about the characteristics and usage patterns of P2P systems; as a consequence, many P2P algorithms and methods lack a realistic evaluation. To remedy this situation, we have set to create the P2P Trace Archive (P2PTA), a virtual meeting place that facilitates the collection and exchange of P2P traces.","PeriodicalId":325024,"journal":{"name":"CoNEXT '10 Student Workshop","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134123588","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}
Next-Generation Internet applications demand inherent flexibility and programmability from the underlying network. OpenFlow-based substrate, as a potential solution, provides the required support to enable network innovations by separating the intelligent control plane from the datapath processing. Several visualization systems have been designed in the context of OpenFlow to facilitate network management. However, the fundamental drawback of these systems is the lack of generality. In this paper we propose ROVIZ, an interactive visualization framework for next generation networks. The contributions of our work consists of the following: i) compatible with any OpenFlow based networks, irrespective of the controller(s), ii) maintains real-time information about the entire network as well as individual devices, and iii) provides interactive menus for selective information retrieval improving bandwidth constraints.
{"title":"An interactive visualization framework for next generation networks","authors":"S. Natarajan, Xin Huang","doi":"10.1145/1921206.1921222","DOIUrl":"https://doi.org/10.1145/1921206.1921222","url":null,"abstract":"Next-Generation Internet applications demand inherent flexibility and programmability from the underlying network. OpenFlow-based substrate, as a potential solution, provides the required support to enable network innovations by separating the intelligent control plane from the datapath processing. Several visualization systems have been designed in the context of OpenFlow to facilitate network management. However, the fundamental drawback of these systems is the lack of generality. In this paper we propose ROVIZ, an interactive visualization framework for next generation networks. The contributions of our work consists of the following: i) compatible with any OpenFlow based networks, irrespective of the controller(s), ii) maintains real-time information about the entire network as well as individual devices, and iii) provides interactive menus for selective information retrieval improving bandwidth constraints.","PeriodicalId":325024,"journal":{"name":"CoNEXT '10 Student Workshop","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121754899","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}
Flows typically pass through multiple networks owned and managed by different ISPs (Internet Service Providers). Users pay usage fee to the traversed networks, and each ISP typically applies different charging rules, depending on their own economic interests and business policies. The revenue sharing rule among ISPs, i.e., how users' fee is shared among them has been known to have large impacts on evolution of the networks, e.g., incentives to upgrade the networks. Related to revenue sharing is network neutrality, where we are particularly interested in the way of sharing the network operation cost between EUs (End-User) and CPs (Content-Providers). This paper studies the interaction between ISP revenue sharing and neutrality-compatible pricing between EU and CP. We study the cases (i) when ISPs charge users/CPs selfishly and (ii) when they coordinate towards fairness of ROI (Return-On Investment). We discuss different engineering and economic implications using the analytical results for two revenue sharing policies coupled with neutrality in the network.
流通常通过由不同的isp (Internet Service Providers)拥有和管理的多个网络。用户向所穿越的网络支付使用费，每个ISP根据自己的经济利益和业务策略，通常采用不同的收费规则。互联网服务提供商之间的收入分享规则，即用户的费用如何在他们之间分享，已经被认为对网络的发展有很大的影响，例如，激励网络升级。与收入分享相关的是网络中立性，我们对在eu(最终用户)和cp(内容提供商)之间分担网络运营成本的方式特别感兴趣。本文研究了欧盟和CP之间的ISP收入共享与中立性兼容定价之间的相互作用。我们研究了(i) ISP向用户/CP自私收费的情况和(ii)他们协调投资回报率(ROI)公平的情况。我们使用两种收入共享政策加上网络中立性的分析结果来讨论不同的工程和经济影响。
{"title":"On the interaction between ISP revenue sharing and network neutrality","authors":"Hyeryung Jang, Hyojung Lee, Yung Yi","doi":"10.1145/1921206.1921227","DOIUrl":"https://doi.org/10.1145/1921206.1921227","url":null,"abstract":"Flows typically pass through multiple networks owned and managed by different ISPs (Internet Service Providers). Users pay usage fee to the traversed networks, and each ISP typically applies different charging rules, depending on their own economic interests and business policies. The revenue sharing rule among ISPs, i.e., how users' fee is shared among them has been known to have large impacts on evolution of the networks, e.g., incentives to upgrade the networks. Related to revenue sharing is network neutrality, where we are particularly interested in the way of sharing the network operation cost between EUs (End-User) and CPs (Content-Providers). This paper studies the interaction between ISP revenue sharing and neutrality-compatible pricing between EU and CP. We study the cases (i) when ISPs charge users/CPs selfishly and (ii) when they coordinate towards fairness of ROI (Return-On Investment). We discuss different engineering and economic implications using the analytical results for two revenue sharing policies coupled with neutrality in the network.","PeriodicalId":325024,"journal":{"name":"CoNEXT '10 Student Workshop","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126587803","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}
Cloud services are radically changing the way we access the information from the Internet and how the "digital goods" are delivered to users. To enable such services, large scale data centers are deployed at various geographical locations, and the contents are replicated at multiple locations to achieve better availability and reliability. However, it is not clear given these multiple data centers how content providers place the content and how a user query is served from the cloud. In this paper, we propose a comprehensive, yet simple and intuitive, approach that can be employed to understand the data center driven content distribution using active measurements. Additionally, applying this method on YouTube, we find that YouTube uses data-centers in more than 50 locations, and that it employs an interesting "3-step" approach to deliver videos to clients in a location-aware manner.
{"title":"Understanding data-center driven content distribution","authors":"Vijay Kumar Adhikari, Sourabh Jain, Gyan Ranjan, Zhi-Li Zhang","doi":"10.1145/1921206.1921232","DOIUrl":"https://doi.org/10.1145/1921206.1921232","url":null,"abstract":"Cloud services are radically changing the way we access the information from the Internet and how the \"digital goods\" are delivered to users. To enable such services, large scale data centers are deployed at various geographical locations, and the contents are replicated at multiple locations to achieve better availability and reliability. However, it is not clear given these multiple data centers how content providers place the content and how a user query is served from the cloud.\u0000 In this paper, we propose a comprehensive, yet simple and intuitive, approach that can be employed to understand the data center driven content distribution using active measurements. Additionally, applying this method on YouTube, we find that YouTube uses data-centers in more than 50 locations, and that it employs an interesting \"3-step\" approach to deliver videos to clients in a location-aware manner.","PeriodicalId":325024,"journal":{"name":"CoNEXT '10 Student Workshop","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123301015","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}
We investigate if it is possible to reconstruct a mobile phone's mobility using its Bluetooth contacts with other mobile devices, some of which are equipped with GPS receivers. Our data mining analysis, based on two different data sets, shows that in certain environments coarse grained mobility of a significant portion of mobile phones can be obtained using this technique. For this reason, anyone capable of collecting Bluetooth and, if available, GPS logs for a large population of mobile phones, represents a serious privacy threat for all users with discoverable Bluetooth devices in the area.
{"title":"Tracking of mobile devices through Bluetooth contacts","authors":"Nikodin Ristanovic, Dang-Khoa Tran, J. Boudec","doi":"10.1145/1921206.1921211","DOIUrl":"https://doi.org/10.1145/1921206.1921211","url":null,"abstract":"We investigate if it is possible to reconstruct a mobile phone's mobility using its Bluetooth contacts with other mobile devices, some of which are equipped with GPS receivers. Our data mining analysis, based on two different data sets, shows that in certain environments coarse grained mobility of a significant portion of mobile phones can be obtained using this technique. For this reason, anyone capable of collecting Bluetooth and, if available, GPS logs for a large population of mobile phones, represents a serious privacy threat for all users with discoverable Bluetooth devices in the area.","PeriodicalId":325024,"journal":{"name":"CoNEXT '10 Student Workshop","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124831059","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
扫码关注我们
求助内容：
应助结果提醒方式：