Pub Date : 2012-10-22DOI: 10.1109/LCN.2012.6423669
Sebastian Meiling, T. Schmidt, Matthias Wählisch
Group communication plays an important role in the distribution of real-time data for IPTV, multimedia conferencing, or online multiplayer games, but IP multicast remains unsupported in today's global Internet. Hybrid solutions that bridge between overlay and underlay multicast are a promising escape from the deployment dilemma of multicast. In this paper, we examine the real-time capabilities of hybrid multicast in a globally distributed environment based on our adaptive architecture H8Mcast within the Planet-Lab testbed. We present a large-scale measurement study and analysis of one-way packet delay distributions in several realistic group scenarios. The unique results in global traces of hybrid multicast data have been achieved by carefully tracking packets and continuously correcting clock offsets. Companion measurements of unicast-based distribution are part of our analysis, as well as the comparative discussion of our results with previous findings from theory and simulation. Our measurements reveal that about 50% of global group members experience a real-time compliant service within the conversational time bounds of 150 ms.
{"title":"Large-scale measurement and analysis of one-way delay in hybrid multicast networks","authors":"Sebastian Meiling, T. Schmidt, Matthias Wählisch","doi":"10.1109/LCN.2012.6423669","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423669","url":null,"abstract":"Group communication plays an important role in the distribution of real-time data for IPTV, multimedia conferencing, or online multiplayer games, but IP multicast remains unsupported in today's global Internet. Hybrid solutions that bridge between overlay and underlay multicast are a promising escape from the deployment dilemma of multicast. In this paper, we examine the real-time capabilities of hybrid multicast in a globally distributed environment based on our adaptive architecture H8Mcast within the Planet-Lab testbed. We present a large-scale measurement study and analysis of one-way packet delay distributions in several realistic group scenarios. The unique results in global traces of hybrid multicast data have been achieved by carefully tracking packets and continuously correcting clock offsets. Companion measurements of unicast-based distribution are part of our analysis, as well as the comparative discussion of our results with previous findings from theory and simulation. Our measurements reveal that about 50% of global group members experience a real-time compliant service within the conversational time bounds of 150 ms.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"242 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115763666","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 : 2012-10-22DOI: 10.1109/LCN.2012.6423682
V. Khare, Beichuan Zhang
Content Delivery Networks (CDN) are overlay network of servers being used to deliver growing traffic demands on the Internet. As a result, CDNs are facing ever-increasing operating costs. Internet Service Providers (ISP) charge CDNs on server traffic, computed using common usage-based charging models, e.g. 95th Percentile charging. We propose Network Cost Aware Request Routing, NetReq, that assign user requests to reduce server charging volume. We compare NetReq against nearest-available server request routing in large scale simulations for both Web and multicast traffic requests. NetReq reduces charging volume for both traffic request types, thereby reducing cost. NetReq provides comparable network performance for multicast traffic by introducing end-to-end delay as a constraint in the request-routing. NetReq marginally increases network performance for Web traffic, when content maybe available at every server.
{"title":"CDN Request Routing to reduce network access cost","authors":"V. Khare, Beichuan Zhang","doi":"10.1109/LCN.2012.6423682","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423682","url":null,"abstract":"Content Delivery Networks (CDN) are overlay network of servers being used to deliver growing traffic demands on the Internet. As a result, CDNs are facing ever-increasing operating costs. Internet Service Providers (ISP) charge CDNs on server traffic, computed using common usage-based charging models, e.g. 95th Percentile charging. We propose Network Cost Aware Request Routing, NetReq, that assign user requests to reduce server charging volume. We compare NetReq against nearest-available server request routing in large scale simulations for both Web and multicast traffic requests. NetReq reduces charging volume for both traffic request types, thereby reducing cost. NetReq provides comparable network performance for multicast traffic by introducing end-to-end delay as a constraint in the request-routing. NetReq marginally increases network performance for Web traffic, when content maybe available at every server.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125189534","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 : 2012-10-22DOI: 10.1109/LCN.2012.6423648
J. Márquez-Barja, C. Calafate, Juan-Carlos Cano, P. Manzoni
Due to the increasing popularity of mobile devices and the growing development of wireless networks, nowadays automobiles are able to communicate among them and with the infrastructure using different wireless technologies, thus improving not only communications but also safety on the roads. In order to improve communications by maintaining the Quality of Service (QoS) required by applications (e.g. throughput, latency) while the car is moving, switching from one base station to another, Vertical Handover techniques are the most adequate solution. In this work we present a Vertical Handover Decision Algorithm powered by the IEEE 802.21 protocol which takes advantage of the current devices deployed in the vehicle's on-board unit by considering geolocation, car navigation and realistic propagation model of different underlying networks such as Wi-Fi, WiMAX, and UMTS. Results demonstrate that QoS can be guaranteed when location and networking parameters (such as packet delay and bandwidth offered) are jointly considered.
{"title":"A geolocation-based Vertical Handover Decision Algorithm for Vehicular Networks","authors":"J. Márquez-Barja, C. Calafate, Juan-Carlos Cano, P. Manzoni","doi":"10.1109/LCN.2012.6423648","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423648","url":null,"abstract":"Due to the increasing popularity of mobile devices and the growing development of wireless networks, nowadays automobiles are able to communicate among them and with the infrastructure using different wireless technologies, thus improving not only communications but also safety on the roads. In order to improve communications by maintaining the Quality of Service (QoS) required by applications (e.g. throughput, latency) while the car is moving, switching from one base station to another, Vertical Handover techniques are the most adequate solution. In this work we present a Vertical Handover Decision Algorithm powered by the IEEE 802.21 protocol which takes advantage of the current devices deployed in the vehicle's on-board unit by considering geolocation, car navigation and realistic propagation model of different underlying networks such as Wi-Fi, WiMAX, and UMTS. Results demonstrate that QoS can be guaranteed when location and networking parameters (such as packet delay and bandwidth offered) are jointly considered.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126083657","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 : 2012-10-22DOI: 10.1109/LCN.2012.6423688
S. Zander, Thuy T. T. Nguyen, G. Armitage
Machine Learning (ML) classifiers have been shown to provide accurate, timely and continuous IP flow classification when evaluating sub-flows (short moving windows of packets within flows). They can be used to provide automated QoS management for interactive traffic, such as fast-paced multiplayer games or VoIP. As with other ML classification approaches, previous sub-flow techniques have assumed all packets in all flows are being observed and evaluated. This limits scalability and poses a problem for practical deployment in network core or edge routers. In this paper we propose and evaluate subflow packet sampling (SPS) to reduce an ML sub-flow classifier's resource requirements with minimal compromise of accuracy. While random packet sampling increases classification time from <;1 second to over 30 seconds and can reduce accuracy from 98% to <;90%, our tailored SPS technique retains classification times of <;1 second while providing 98% accuracy.
{"title":"Sub-flow packet sampling for scalable ML classification of interactive traffic","authors":"S. Zander, Thuy T. T. Nguyen, G. Armitage","doi":"10.1109/LCN.2012.6423688","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423688","url":null,"abstract":"Machine Learning (ML) classifiers have been shown to provide accurate, timely and continuous IP flow classification when evaluating sub-flows (short moving windows of packets within flows). They can be used to provide automated QoS management for interactive traffic, such as fast-paced multiplayer games or VoIP. As with other ML classification approaches, previous sub-flow techniques have assumed all packets in all flows are being observed and evaluated. This limits scalability and poses a problem for practical deployment in network core or edge routers. In this paper we propose and evaluate subflow packet sampling (SPS) to reduce an ML sub-flow classifier's resource requirements with minimal compromise of accuracy. While random packet sampling increases classification time from <;1 second to over 30 seconds and can reduce accuracy from 98% to <;90%, our tailored SPS technique retains classification times of <;1 second while providing 98% accuracy.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"150 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116575173","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 : 2012-10-22DOI: 10.1109/LCN.2012.6423630
Abdoulmenim Bilh, C. Chou
Opportunistic routing has been shown to outperform traditional routing protocols which use a pre-determined next hop. Most of the opportunistic routing protocols proposed to-date are for unicast while few multicast opportunistic routing protocols have been proposed. This paper proposes an opportunistic multicast routing protocol. The protocol addresses the problem of selection and prioritisation of relay candidates to reduce the overall number of transmissions. It also addresses the problem of reducing protocol overheads. We compare the performance of our proposed protocol against an existing opportunistic multicast routing protocol, and find that our proposed protocol has a higher packet delivery rate and lower number of transmissions per packet delivered.
{"title":"An opportunistic multicast routing protocol for wireless mesh networks","authors":"Abdoulmenim Bilh, C. Chou","doi":"10.1109/LCN.2012.6423630","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423630","url":null,"abstract":"Opportunistic routing has been shown to outperform traditional routing protocols which use a pre-determined next hop. Most of the opportunistic routing protocols proposed to-date are for unicast while few multicast opportunistic routing protocols have been proposed. This paper proposes an opportunistic multicast routing protocol. The protocol addresses the problem of selection and prioritisation of relay candidates to reduce the overall number of transmissions. It also addresses the problem of reducing protocol overheads. We compare the performance of our proposed protocol against an existing opportunistic multicast routing protocol, and find that our proposed protocol has a higher packet delivery rate and lower number of transmissions per packet delivered.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123215027","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 : 2012-10-22DOI: 10.1109/LCN.2012.6423678
M. Shazly, E. Elmallah, J. Harms
This paper considers wireless sensor networks (WSNs) deployed to provide surveillance against intruders that wish to cross a given area. Due to limited resources, low manufacturing cost, and operation in harsh environments, nodes in such networks are subject to random failure in the field. Hence, there is a need to develop suitable reliability assessment mechanisms to quantify a WSN's ability to perform successfully. Here, we consider one such measure, called the breach path detection reliability (BPDREL), that applies to networks where any intruder crossing a line segment between some adjacent operating pairs of sensor nodes can be detected, and the network perimeter is made of a polygon of such line segments. Each breach path across the network is associated with a pair of entry-exit sides on the perimeter. Our measure takes into account intrusion events associated with any user-specified set of such entry-exit sides. Computing the exact BPDREL can be shown to be #P-hard. We extend existing results on the BPDREL by developing an approach for deriving lower bounds on the problem for arbitrary WSNs where the sink node is located on the network's perimeter. The resulting algorithm is used to analyze the impact of varying various network parameters on the overall network reliability.
{"title":"An approach for bounding breach path detection reliability in wireless sensor networks","authors":"M. Shazly, E. Elmallah, J. Harms","doi":"10.1109/LCN.2012.6423678","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423678","url":null,"abstract":"This paper considers wireless sensor networks (WSNs) deployed to provide surveillance against intruders that wish to cross a given area. Due to limited resources, low manufacturing cost, and operation in harsh environments, nodes in such networks are subject to random failure in the field. Hence, there is a need to develop suitable reliability assessment mechanisms to quantify a WSN's ability to perform successfully. Here, we consider one such measure, called the breach path detection reliability (BPDREL), that applies to networks where any intruder crossing a line segment between some adjacent operating pairs of sensor nodes can be detected, and the network perimeter is made of a polygon of such line segments. Each breach path across the network is associated with a pair of entry-exit sides on the perimeter. Our measure takes into account intrusion events associated with any user-specified set of such entry-exit sides. Computing the exact BPDREL can be shown to be #P-hard. We extend existing results on the BPDREL by developing an approach for deriving lower bounds on the problem for arbitrary WSNs where the sink node is located on the network's perimeter. The resulting algorithm is used to analyze the impact of varying various network parameters on the overall network reliability.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115851082","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 : 2012-10-22DOI: 10.1109/LCN.2012.6423607
P. Rathod, A. Karandikar, A. Sahoo
In this paper, we discuss the problem of non-collocated coexistence of WiFi and 4G technologies such as WiMAX and LTE due to adjacent channel interference. The existing literature has many solutions and schemes to address the problem of shared channel coexistence and adjacent channel coexistence on multi-radio platforms. Results for Non-collocated coexistence in adjacent channels in wireless remain very scattered and few. Radio devices operating on Broadband Wireless Access (BWA) 4G wireless technologies like IEEE 802.16 (WiMAX) and LTE-A require very low noise floor. BWA spectrum allocations in 2.3 GHz and 2.5GHz have resulted in these networks to be very close to 2.4 GHz ISM band used by WiFi. We show, with measurements on our test-bed and from existing results, that the low-cost filters on WiFi devices are not very effective in controlling the out-of-band emissions to satisfy the low noise floor requirements of 4G. We propose schemes to mitigate the problem of adjacent channel interference by a time sharing mechanism across technologies by protecting packet receptions on both IEEE 802.11 and the IEEE 802.16 side. We demonstrate the effectiveness of our scheme to protect WiMAX packets by ensuring a controlled silence zone in the WiFi network using a test-bed. We also show that there is very limited adverse impact, due to the use of our scheme, on the system throughput of the non-collocated WiFi network operating in the adjacent channel.
{"title":"Facilitating Non-collocated coexistence for WiFi and 4G wireless networks","authors":"P. Rathod, A. Karandikar, A. Sahoo","doi":"10.1109/LCN.2012.6423607","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423607","url":null,"abstract":"In this paper, we discuss the problem of non-collocated coexistence of WiFi and 4G technologies such as WiMAX and LTE due to adjacent channel interference. The existing literature has many solutions and schemes to address the problem of shared channel coexistence and adjacent channel coexistence on multi-radio platforms. Results for Non-collocated coexistence in adjacent channels in wireless remain very scattered and few. Radio devices operating on Broadband Wireless Access (BWA) 4G wireless technologies like IEEE 802.16 (WiMAX) and LTE-A require very low noise floor. BWA spectrum allocations in 2.3 GHz and 2.5GHz have resulted in these networks to be very close to 2.4 GHz ISM band used by WiFi. We show, with measurements on our test-bed and from existing results, that the low-cost filters on WiFi devices are not very effective in controlling the out-of-band emissions to satisfy the low noise floor requirements of 4G. We propose schemes to mitigate the problem of adjacent channel interference by a time sharing mechanism across technologies by protecting packet receptions on both IEEE 802.11 and the IEEE 802.16 side. We demonstrate the effectiveness of our scheme to protect WiMAX packets by ensuring a controlled silence zone in the WiFi network using a test-bed. We also show that there is very limited adverse impact, due to the use of our scheme, on the system throughput of the non-collocated WiFi network operating in the adjacent channel.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131076359","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 : 2012-10-22DOI: 10.1109/LCN.2012.6423608
R. Trestian, Olga Ormond, Gabriel-Miro Muntean
In the context of wireless user's increasing demands for better device power and battery management, this paper investigates some factors that can impact the power consumption on the energy consumption of mobile devices. The focus is on two factors when performing multimedia streaming: the impact of the traffic location within a WLAN; and the impact of the radio access network technology (WLAN, HSDPA, UMTS). The energy measurement results show that by changing the quality level of the multimedia stream the energy can be greatly conserved while the user perceived quality level is still acceptable. Moreover, by using the cellular interface much more energy is consumed (up to 61%) than by using the WLAN interface.
{"title":"On the impact of wireless network traffic location and access technology on mobile device energy consumption","authors":"R. Trestian, Olga Ormond, Gabriel-Miro Muntean","doi":"10.1109/LCN.2012.6423608","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423608","url":null,"abstract":"In the context of wireless user's increasing demands for better device power and battery management, this paper investigates some factors that can impact the power consumption on the energy consumption of mobile devices. The focus is on two factors when performing multimedia streaming: the impact of the traffic location within a WLAN; and the impact of the radio access network technology (WLAN, HSDPA, UMTS). The energy measurement results show that by changing the quality level of the multimedia stream the energy can be greatly conserved while the user perceived quality level is still acceptable. Moreover, by using the cellular interface much more energy is consumed (up to 61%) than by using the WLAN interface.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124525313","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 : 2012-10-22DOI: 10.1109/LCN.2012.6423661
C. Truong, K. Römer
Recently, large sensor networks with several thousands of nodes are being deployed over large geographic areas in the context of smart city projects. In these settings, there is often a need to send a message to all sensors contained in one of multiple geographic regions, for example, to query for a free parking spot in several streets. We present Recursive Multi-region Geocasting (RMG), a novel multi-region geocast routing protocol which addresses the problem of delivering data from a source to multiple remote geocast regions in large-scale wireless sensor networks. The key idea is to treat a remote group of geocast regions as a point destination and forward data packets along a straight line towards the group, until a division point at which the group is divided, and the packet is forwarded towards the sub-groups in the same fashion. RMG is lightweight as no state has to be maintained at the nodes and the computations are simple. Simulation shows that our protocol achieves lower path length overhead and network relay load while incurring less computation overhead when compared to state-of-the-art protocols.
{"title":"Efficient geocasting to multiple regions in large-scale wireless sensor networks","authors":"C. Truong, K. Römer","doi":"10.1109/LCN.2012.6423661","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423661","url":null,"abstract":"Recently, large sensor networks with several thousands of nodes are being deployed over large geographic areas in the context of smart city projects. In these settings, there is often a need to send a message to all sensors contained in one of multiple geographic regions, for example, to query for a free parking spot in several streets. We present Recursive Multi-region Geocasting (RMG), a novel multi-region geocast routing protocol which addresses the problem of delivering data from a source to multiple remote geocast regions in large-scale wireless sensor networks. The key idea is to treat a remote group of geocast regions as a point destination and forward data packets along a straight line towards the group, until a division point at which the group is divided, and the packet is forwarded towards the sub-groups in the same fashion. RMG is lightweight as no state has to be maintained at the nodes and the computations are simple. Simulation shows that our protocol achieves lower path length overhead and network relay load while incurring less computation overhead when compared to state-of-the-art protocols.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124709700","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 : 2012-10-22DOI: 10.1109/LCN.2012.6423589
HyunYong Lee, A. Nakao
In this paper, we examine a new kind of P2P traffic localization approach exploiting the peer selection adaptation (i.e., preferring peers who are likely to provide better performance), called Netpherd. Netpherd tries to affect the peer selection adaptation to localize the P2P traffic by manipulating the network performance. To manipulate the network performance, Netpherd adds an artificial delay to inter-domain traffic going to target peer. Evaluation results show that Netpherd localizes the P2P traffic while improving the content download performance.
{"title":"A study of P2P traffic localization by network delay insertion","authors":"HyunYong Lee, A. Nakao","doi":"10.1109/LCN.2012.6423589","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423589","url":null,"abstract":"In this paper, we examine a new kind of P2P traffic localization approach exploiting the peer selection adaptation (i.e., preferring peers who are likely to provide better performance), called Netpherd. Netpherd tries to affect the peer selection adaptation to localize the P2P traffic by manipulating the network performance. To manipulate the network performance, Netpherd adds an artificial delay to inter-domain traffic going to target peer. Evaluation results show that Netpherd localizes the P2P traffic while improving the content download performance.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127887320","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
扫码关注我们
求助内容：
应助结果提醒方式：