End users are often curious to verify the performance of their network connection. Mostly, they accomplish this task with end-to-end active measurements. Unfortunately, the home network can affect end-to-end measurement and can lead to erroneous conclusions. This paper performs measurements in a controlled environment to understand the effect of cross traffic from home on the measurement. We show that although the impact from cross-traffic can be large, it is hard to detect it with active measurements in the home network.
{"title":"Is it me?: understanding the impact of the home network on end-to-end measurements","authors":"Lucas DiCioccio, R. Teixeira, C. Rosenberg","doi":"10.1145/1658997.1659016","DOIUrl":"https://doi.org/10.1145/1658997.1659016","url":null,"abstract":"End users are often curious to verify the performance of their network connection. Mostly, they accomplish this task with end-to-end active measurements. Unfortunately, the home network can affect end-to-end measurement and can lead to erroneous conclusions. This paper performs measurements in a controlled environment to understand the effect of cross traffic from home on the measurement. We show that although the impact from cross-traffic can be large, it is hard to detect it with active measurements in the home network.","PeriodicalId":181045,"journal":{"name":"Co-Next Student Workshop '09","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123069785","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}
Pocket Switched Networks (PSN) [3] have become a promising approach for providing communication between scarcely connected human-carried devices. Such devices, e.g. mobile phones or sensor nodes, are exposed to human mobility and can therewith leverage inter-human contacts for store-and-forward routing. Efficiently routing in such delay tolerant networks is complex due to incomplete knowledge about the network, and high dynamics of the network. In this work we want to develop an extension of Bloom filters for resource-efficient routing in pocket switched networks. Furthermore, we argue that PSNs may become densely populated in special situations. We want to exploit such situations to perform collaborative calculations of forwarding-decisions. In this paper we present a simple scheme for distributed decision calculation using overlays and a DHT-based distributed variant of Bloom filters.
{"title":"Bloom filters and overlays for routing in pocket switched networks","authors":"Christoph P. Mayer","doi":"10.1145/1658997.1659021","DOIUrl":"https://doi.org/10.1145/1658997.1659021","url":null,"abstract":"Pocket Switched Networks (PSN) [3] have become a promising approach for providing communication between scarcely connected human-carried devices. Such devices, e.g. mobile phones or sensor nodes, are exposed to human mobility and can therewith leverage inter-human contacts for store-and-forward routing. Efficiently routing in such delay tolerant networks is complex due to incomplete knowledge about the network, and high dynamics of the network. In this work we want to develop an extension of Bloom filters for resource-efficient routing in pocket switched networks. Furthermore, we argue that PSNs may become densely populated in special situations. We want to exploit such situations to perform collaborative calculations of forwarding-decisions. In this paper we present a simple scheme for distributed decision calculation using overlays and a DHT-based distributed variant of Bloom filters.","PeriodicalId":181045,"journal":{"name":"Co-Next Student Workshop '09","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123272012","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}
Many Wireless Sensor Networks (WSNs) employ security schemes based on the symmetric encryption, which requires the establishment and management of cryptographic keys. This paper presents a new key management scheme based on Random Key Pre-Distribution. The novelty of the proposed approach is the introduction of a keyed transformation with a Transitory Master Key, which is exploited by the nodes in order to increase the number of different keys employed in the network. The presence of a larger pool of keys provides more robustness and connectivity than previously proposed Random Key Distribution schemes. Furthermore, random pre-distribution allows recovering secure communication also when the master key has been compromised.
{"title":"Random key pre-distribution with transitory master key for wireless sensor networks","authors":"F. Gandino, B. Montrucchio, M. Rebaudengo","doi":"10.1145/1658997.1659012","DOIUrl":"https://doi.org/10.1145/1658997.1659012","url":null,"abstract":"Many Wireless Sensor Networks (WSNs) employ security schemes based on the symmetric encryption, which requires the establishment and management of cryptographic keys. This paper presents a new key management scheme based on Random Key Pre-Distribution. The novelty of the proposed approach is the introduction of a keyed transformation with a Transitory Master Key, which is exploited by the nodes in order to increase the number of different keys employed in the network. The presence of a larger pool of keys provides more robustness and connectivity than previously proposed Random Key Distribution schemes. Furthermore, random pre-distribution allows recovering secure communication also when the master key has been compromised.","PeriodicalId":181045,"journal":{"name":"Co-Next Student Workshop '09","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127679678","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}
Kyungsoo Lee, Sangki Yun, Yongtae Park, Hyogon Kim
As there is no MAC layer acknowledgment from the receiver for broadcast/multicast transmission in the 802.11 network, using the lowest transmission rate is understandably the safest approach because it minimizes reception error for clients with the worst channel condition. On the contrary, the transmission rate for receivers with good channel conditions is unnecessarily limited. In the case of video streams being broadcast/multicast via 802.11, this approach will lead to poor received video at all clients. In this paper, we demonstrate that there isutility in activating rate adaptation for broadcast/multicast traffic. In particular, we implement a system that significantly improves the broadcast video quality in 802.11 network. This is achieved through an approach of joined broadcast/multicast rate adaptation and network-coded retransmission.
{"title":"On the utility of rate adaptation for broadcast/multicast media traffic in 802.11 networks","authors":"Kyungsoo Lee, Sangki Yun, Yongtae Park, Hyogon Kim","doi":"10.1145/1658997.1659026","DOIUrl":"https://doi.org/10.1145/1658997.1659026","url":null,"abstract":"As there is no MAC layer acknowledgment from the receiver for broadcast/multicast transmission in the 802.11 network, using the lowest transmission rate is understandably the safest approach because it minimizes reception error for clients with the worst channel condition. On the contrary, the transmission rate for receivers with good channel conditions is unnecessarily limited. In the case of video streams being broadcast/multicast via 802.11, this approach will lead to poor received video at all clients.\u0000 In this paper, we demonstrate that there isutility in activating rate adaptation for broadcast/multicast traffic. In particular, we implement a system that significantly improves the broadcast video quality in 802.11 network. This is achieved through an approach of joined broadcast/multicast rate adaptation and network-coded retransmission.","PeriodicalId":181045,"journal":{"name":"Co-Next Student Workshop '09","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122290199","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}
One of the most valuable clients of cellular GSM networks are roaming clients, due to the pricing policy set by network operators. Despite that each operator applies a lot of effort in network signal coverage in order to achieve the best conditions for roaming traffic in the network, there still remain hardly detectable locations where roaming clients are getting lost to rival networks. This paper presents a roaming traffic weak locations revealing method based on active tracking of roamer location in a live GSM network. We define the problem scope using formal description of an active tracking process and propose a metrics for network "weakness" evaluation together with intuitive visualization of weak locations. We shortly conclude with plans of our ongoing research.
{"title":"Improving roamer retention by exposing weak locations in GSM networks","authors":"M. Ficek, L. Kencl","doi":"10.1145/1658997.1659007","DOIUrl":"https://doi.org/10.1145/1658997.1659007","url":null,"abstract":"One of the most valuable clients of cellular GSM networks are roaming clients, due to the pricing policy set by network operators. Despite that each operator applies a lot of effort in network signal coverage in order to achieve the best conditions for roaming traffic in the network, there still remain hardly detectable locations where roaming clients are getting lost to rival networks. This paper presents a roaming traffic weak locations revealing method based on active tracking of roamer location in a live GSM network. We define the problem scope using formal description of an active tracking process and propose a metrics for network \"weakness\" evaluation together with intuitive visualization of weak locations. We shortly conclude with plans of our ongoing research.","PeriodicalId":181045,"journal":{"name":"Co-Next Student Workshop '09","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115259787","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}
Three-party tunnel-based roaming infrastructures may become a future trend to permit mobile users to connect to the Internet when they are not at home. Those solutions takle security issues for both visited networks and mobile users, but require an efficient and scalable accounting protocol. In this paper, we present a lightweight accounting protocol in which the quantity of data that the mobile is allowed to send is gradually increased when cryptographically signed receipts are received.
{"title":"An adaptive three-party accounting protocol","authors":"G. Detal, Damien Leroy, O. Bonaventure","doi":"10.1145/1658997.1659000","DOIUrl":"https://doi.org/10.1145/1658997.1659000","url":null,"abstract":"Three-party tunnel-based roaming infrastructures may become a future trend to permit mobile users to connect to the Internet when they are not at home. Those solutions takle security issues for both visited networks and mobile users, but require an efficient and scalable accounting protocol. In this paper, we present a lightweight accounting protocol in which the quantity of data that the mobile is allowed to send is gradually increased when cryptographically signed receipts are received.","PeriodicalId":181045,"journal":{"name":"Co-Next Student Workshop '09","volume":"157 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116462381","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}
P2P networks enable end users to establish services relying neither on a dedicated infrastructure nor on an ISP deployment of enhanced services at the network layer. Regrettably, overlay traffic is not optimal with respect to native connections and peering agreements, but may decrease network quality at end users at increased transit costs. This issue has been addressed by traffic localization approaches: The general objective is to keep overlay traffic local and to minimize provider crossing. Current efforts foster provider-assisted solutions. Overlays, which approximate network paths from the underlay, promise to significantly limit inter-domain traffic. However, ISPs offering transits rejoice in additional traffic and may provide localization data to delocalize peers. In this paper, we argue that ISP interaction should be provided by neutral authorities, namely the Internet exchange points. We present an architecture which serves unstructured and structured overlay peers with a generic overlay ID that jointly reflects AS-paths and peering topologies, and is unbiased by unilateral ISP interests.
{"title":"Peer the peers: an overlay id assignment service at internet exchange points","authors":"Matthias Wählisch, T. Schmidt","doi":"10.1145/1658997.1659022","DOIUrl":"https://doi.org/10.1145/1658997.1659022","url":null,"abstract":"P2P networks enable end users to establish services relying neither on a dedicated infrastructure nor on an ISP deployment of enhanced services at the network layer. Regrettably, overlay traffic is not optimal with respect to native connections and peering agreements, but may decrease network quality at end users at increased transit costs. This issue has been addressed by traffic localization approaches: The general objective is to keep overlay traffic local and to minimize provider crossing. Current efforts foster provider-assisted solutions. Overlays, which approximate network paths from the underlay, promise to significantly limit inter-domain traffic. However, ISPs offering transits rejoice in additional traffic and may provide localization data to delocalize peers. In this paper, we argue that ISP interaction should be provided by neutral authorities, namely the Internet exchange points. We present an architecture which serves unstructured and structured overlay peers with a generic overlay ID that jointly reflects AS-paths and peering topologies, and is unbiased by unilateral ISP interests.","PeriodicalId":181045,"journal":{"name":"Co-Next Student Workshop '09","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123488189","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}
Maintaining Internet network resources available and se-cured is an unmet challenge. Hence, trac classi cationand anomaly detection received much attention in the lastfew years, and several algorithms have been proposed forbackbone trac. However, the evaluation of these methodsusually lacks rigor, leading to hasty conclusions. Since syn-thetic data is rather criticized and common labeled database(like the data sets from the DARPA Intrusion DetectionEvaluation Program [6]) is not available for backbone traf- c; researchers analyze real data and validate their methodsby manually inspecting their results, or by comparing theirresults with other methods. Our nal goal is to label theMAWI database [2] which is an archive of real backbonetrac traces publicly available. Since manual labeling ofbackbone trac is unpractical, we build this database bycross-validating results from several methods with di erenttheoretical backgrounds. This systematic approach permitsto maintain updated database in which recent trac tracesare regularly added, and labels are improved with upcomingalgorithms. In this paper we discuss the diculties facedin comparing events provided by distinct algorithms, andpropose a methodology to achieve it.This work will also help researchers in understanding re-sults from their algorithms. For instance, while developinganomaly detector, researchers commonly face a problem intuning their parameter set. The correlation between ana-lyzed trac and parameter set is complicated. Therefore,researchers usually run their application with numerous pa-rameter settings, and the best parameter set is selected bylooking at the highest detection rate. Although this processis commonly accepted by the community a crucial issue stillremains. Let say a parameter set A gives a similar detec-tion rate than a parameter set B , but a deeper analysis ofreported events shows that B is more e ective for a certainkind of anomalies not detectable with the parameter set A(and vice versa). This case is important and should notbe ignored, however, it cannot be observed with a simplecomparison of detection rate.
{"title":"Towards systematic traffic annotation","authors":"Romain Fontugne, P. Borgnat, P. Abry, K. Fukuda","doi":"10.1145/1658997.1659006","DOIUrl":"https://doi.org/10.1145/1658997.1659006","url":null,"abstract":"Maintaining Internet network resources available and se-cured is an unmet challenge. Hence, tra\u000ec classi cationand anomaly detection received much attention in the lastfew years, and several algorithms have been proposed forbackbone tra\u000ec. However, the evaluation of these methodsusually lacks rigor, leading to hasty conclusions. Since syn-thetic data is rather criticized and common labeled database(like the data sets from the DARPA Intrusion DetectionEvaluation Program [6]) is not available for backbone traf- c; researchers analyze real data and validate their methodsby manually inspecting their results, or by comparing theirresults with other methods. Our nal goal is to label theMAWI database [2] which is an archive of real backbonetra\u000ec traces publicly available. Since manual labeling ofbackbone tra\u000ec is unpractical, we build this database bycross-validating results from several methods with di erenttheoretical backgrounds. This systematic approach permitsto maintain updated database in which recent tra\u000ec tracesare regularly added, and labels are improved with upcomingalgorithms. In this paper we discuss the di\u000eculties facedin comparing events provided by distinct algorithms, andpropose a methodology to achieve it.This work will also help researchers in understanding re-sults from their algorithms. For instance, while developinganomaly detector, researchers commonly face a problem intuning their parameter set. The correlation between ana-lyzed tra\u000ec and parameter set is complicated. Therefore,researchers usually run their application with numerous pa-rameter settings, and the best parameter set is selected bylooking at the highest detection rate. Although this processis commonly accepted by the community a crucial issue stillremains. Let say a parameter set A gives a similar detec-tion rate than a parameter set B , but a deeper analysis ofreported events shows that B is more e ective for a certainkind of anomalies not detectable with the parameter set A(and vice versa). This case is important and should notbe ignored, however, it cannot be observed with a simplecomparison of detection rate.","PeriodicalId":181045,"journal":{"name":"Co-Next Student Workshop '09","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128700031","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}
R. C. Rumín, Nikolaos Laoutaris, Xiaoyuan Yang, Georgos Siganos, P. Rodriguez
Localizing BitTorrent traffic within an ISP in order to avoid excessive and often times unnecessary transit costs has recently received a lot of attention. In this work we attempt to answer yet unanswered questions like "what are the boundaries of win-win outcomes for both ISPs and users from locality?", "what does the tradeoff between ISPs and users look like?", and "are some ISPs more in need of locality biasing than others?".
{"title":"Deep diving into BitTorrent locality","authors":"R. C. Rumín, Nikolaos Laoutaris, Xiaoyuan Yang, Georgos Siganos, P. Rodriguez","doi":"10.1145/1658997.1659002","DOIUrl":"https://doi.org/10.1145/1658997.1659002","url":null,"abstract":"Localizing BitTorrent traffic within an ISP in order to avoid excessive and often times unnecessary transit costs has recently received a lot of attention. In this work we attempt to answer yet unanswered questions like \"what are the boundaries of win-win outcomes for both ISPs and users from locality?\", \"what does the tradeoff between ISPs and users look like?\", and \"are some ISPs more in need of locality biasing than others?\".","PeriodicalId":181045,"journal":{"name":"Co-Next Student Workshop '09","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126366367","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}
Mobility management in Wireless Mesh Networks (WMN) is a hot topic still lacking a final, widely accepted, and deployed solution. The major drawbacks of existing proposals is the fact that they rely on some sort of flooding-based technique and very often they need support from end-users' devices. Flooding in wireless environments leads to increased latency and broadcast storm problems, thus providing low performances. In this paper, we argue that a DHT-based approach can overcome such limitations and provide an effective solution to the mobility management problem. A preliminary evaluation of our DHT-based scheme on a real WMN test-bed shows encouraging results when compared to previous solutions.
{"title":"Practical DHT-based location service for wireless mesh networks","authors":"Mehdi Bezahaf, M. Amorim, S. Fdida, L. Iannone","doi":"10.1145/1658997.1659023","DOIUrl":"https://doi.org/10.1145/1658997.1659023","url":null,"abstract":"Mobility management in Wireless Mesh Networks (WMN) is a hot topic still lacking a final, widely accepted, and deployed solution. The major drawbacks of existing proposals is the fact that they rely on some sort of flooding-based technique and very often they need support from end-users' devices. Flooding in wireless environments leads to increased latency and broadcast storm problems, thus providing low performances. In this paper, we argue that a DHT-based approach can overcome such limitations and provide an effective solution to the mobility management problem. A preliminary evaluation of our DHT-based scheme on a real WMN test-bed shows encouraging results when compared to previous solutions.","PeriodicalId":181045,"journal":{"name":"Co-Next Student Workshop '09","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114908185","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
扫码关注我们
求助内容：
应助结果提醒方式：