IEEE INFOCOM Workshops 2009最新文献

{"title":"Distributed Overlay Anycast Tables Using Space Filling Curves","authors":"E. Mykoniati, L. Latif, R. Landa, Ben Yang, R. Clegg, D. Griffin, M. Rio","doi":"10.1109/INFCOMW.2009.5072131","DOIUrl":"https://doi.org/10.1109/INFCOMW.2009.5072131","url":null,"abstract":"In this paper we present the Distributed Overlay Anycast Table, a structured overlay that implements application-layer anycast, allowing the discovery of the closest host that is a member of a given group. One application is in locality-aware peer-to-peer networks, where peers need to discover low-latency peers participating in the distribution of a particular file or stream. The DOAT makes use of network delay coordinates and a space filling curve to achieve locality-aware routing across the overlay, and Bloom filters to aggregate group identifiers. The solution is designed to optimise both accuracy and query time, which are essential for real-time applications. We simulated DOAT using both random and realistic node distributions. The results show that accuracy is high and query time is low.","PeriodicalId":252414,"journal":{"name":"IEEE INFOCOM Workshops 2009","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129167589","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}

{"title":"Alternate Multihop Routing in Limited Reconfigurable Optical Networks","authors":"O. Turkcu, S. Subramaniam","doi":"10.1109/INFCOMW.2009.5072109","DOIUrl":"https://doi.org/10.1109/INFCOMW.2009.5072109","url":null,"abstract":"In this paper, we investigate the performance of limited reconfigurable optical networks when multihopping is used. Multihopping is achieved by dropping a wavelength at an intermediate node and transmitting on another wavelength at that node (O-E-O). A route can consist of several such hops each obeying the wavelength continuity constraint individually. Considering that a receiver and a transmitter are used for add/drop at a node, multihopping is restricted by the number of transponders and their tunabilities. We develop a dynamic routing strategy based on the availability and tunability of transponders as well as the wavelength availability. We adopt a Share-Per-Link model for the usage of transponders within a reconfigurable node, and each node is assumed to be equipped with a ROADM which can add/drop any wavelength to any of the ports. We show that the proposed routing strategy improves the blocking performance significantly compared to fixed routing with or without multihopping or alternate routing methods without multihopping.","PeriodicalId":252414,"journal":{"name":"IEEE INFOCOM Workshops 2009","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128905798","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}

{"title":"On the Effects of Overlay Localization on P2P Networks","authors":"C. Király, R. Lo Cigno","doi":"10.1109/INFCOMW.2009.5072170","DOIUrl":"https://doi.org/10.1109/INFCOMW.2009.5072170","url":null,"abstract":"Recently several studies have been made on reducing overall network traffic by localizing P2P traffic. Interestingly, real world measurements show that these localization techniques often do not bring performance advantages to the P2P user, only to the underlying network by reducing average layer 3 hop count of individual transmissions. In this paper, we study the effects of localized traffic patterns on end-user performance, in the specific case of P2P-TV traffic.We find that, without assuming excess local networking resources (such as higher bandwidth), localization reduces end-user performance considerably due to the resulting clustered overlay structure. We investigate (though simulation) the amount of random overlay edges and the amount of local bandwidth surplus that can mitigate this negative effect of preferring local connections.","PeriodicalId":252414,"journal":{"name":"IEEE INFOCOM Workshops 2009","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133035401","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}

{"title":"A Study of the Performance of SSL on PDAs","authors":"Youngsang Shin, Minaxi Gupta, Steven Myers","doi":"10.1109/INFCOMW.2009.5072104","DOIUrl":"https://doi.org/10.1109/INFCOMW.2009.5072104","url":null,"abstract":"PDAs and smartphones are increasingly being used as handheld computers. Today, their network connectivity and their usages for various tasks over the Internet require privacy and authenticity. In this paper, we conduct a comprehensive and comparative study of the performance of the SSL protocol for PDA and laptop clients, both in WEP secured and open Wi-Fi environments. Unlike previous studies [1], [2], the measurements are at sub-protocol granularity allowing for researchers to consider appropriate optimizations for these resource-constrained devices. Unsurprisingly, we find that SSL handshake costs 3 times more at a PDA client than it does for a laptop client, but surprisingly most of the delay comes from network latency and other PDA architecture issues, not cryptographic computation. This suggests that more effort should be spent in minimizing communication rounds in future cryptographic protocols that will be used by PDAs, even at the cost of more cryptographic operations.","PeriodicalId":252414,"journal":{"name":"IEEE INFOCOM Workshops 2009","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133276667","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}

{"title":"Court Trial Based Detection of Forwarding Misbehaviors in Wireless Networks","authors":"Sookhyun Yang, Sudarshan Vasudevan, J. Kurose","doi":"10.1109/INFCOMW.2009.5072123","DOIUrl":"https://doi.org/10.1109/INFCOMW.2009.5072123","url":null,"abstract":"This paper considers the problem of identifying the source of forwarding misbehavior in ad hoc networks. Unlike existing proposals, an approach is consider that works locally, within k-hops of the node under investigation, and requires neither end-end ACKs nor observer nodes to hear transmissions into, and out of, the node under investigation. The approach relies on nodes that observe a certain node's forwarding behavior (by virtue of being a next-hop neighbor on a path or an overhearing node in the vicinity of the forwarding node) and report the observed behavior to the node upstream from the node under investigation.","PeriodicalId":252414,"journal":{"name":"IEEE INFOCOM Workshops 2009","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134303836","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}

{"title":"Stability and Symmetry of Internet Routing","authors":"Udi Weinsberg, Y. Shavitt, Yaron Schwartz","doi":"10.1109/INFCOMW.2009.5072192","DOIUrl":"https://doi.org/10.1109/INFCOMW.2009.5072192","url":null,"abstract":"This paper presents a large-scale analysis of the stability and symmetry of routing in the modern Internet using adapted edit distance algorithm as a measure for stability. This improves on existing work by capturing changes in the order of hops in paths as well as changes in the hops themselves. Preliminary results show that this measure alongside with diverse and broad active measurements have potential to help understand better the complex routing of Internet packets.","PeriodicalId":252414,"journal":{"name":"IEEE INFOCOM Workshops 2009","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126531666","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}

{"title":"Labels, Routing, and Capacity: Bringing Theoretical Networking Closer to Practice","authors":"M. Dinitz","doi":"10.1109/INFCOMW.2009.5072158","DOIUrl":"https://doi.org/10.1109/INFCOMW.2009.5072158","url":null,"abstract":"In this work we study a variety of problems, including network coordinate systems, compact routing, and wireless network capacity. The unifying thread is the observation that while strong theoretical properties are already known about all of these problems, the standard models used to prove these properties are not particularly realistic. We attempt to work in more realistic models, which are either new (slack guarantees for distance problems) or old but difficult to work in (the geometric SINR model for wireless network capacity). Sometimes this involves getting around theoretical lower bounds by weakening the model, and in other cases it involves strengthening the model to make it more realistic, and thus becoming unable to use existing theoretical algorithms. While obviously we do not claim to have the final word on these problems, we view this as a step towards bringing theory closer to practice.","PeriodicalId":252414,"journal":{"name":"IEEE INFOCOM Workshops 2009","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126028592","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}

{"title":"A Real-Time Peer-to-Peer Streaming System for Mobile Networking Environment","authors":"J. Peltotalo, J. Harju, M. Saukko, Lassi Vaatamoinen, Imed Bouazizi, I. Curcio, Joep van Gassel","doi":"10.1109/INFCOMW.2009.5072102","DOIUrl":"https://doi.org/10.1109/INFCOMW.2009.5072102","url":null,"abstract":"Peer-to-peer is emerging as a potentially disruptive technology for content distribution in the mobile Internet. In addition to the already well-known peer-to-peer file sharing, real-time peer-to-peer streaming is gaining popularity. This paper presents an effective real-time peer-to-peer streaming system for the mobile environment. The basis for the system is a scalable overlay network which groups peers into clusters according to their proximity using RTT values between peers as a criteria for the cluster selection. The actual media delivery in the system is implemented using the partial RTP stream concept: the original RTP sessions related to a media delivery are split into a number of so-called partial streams according to a pre-defined set of parameters in such a way that it allows low-complexity reassembly of the original media session in real-time at the receiving end. Partial streams also help in utilizing the upload capacity with finer granularity than just per one original stream. This is beneficial in mobile environments where bandwidth can be scarce.","PeriodicalId":252414,"journal":{"name":"IEEE INFOCOM Workshops 2009","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133828351","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}

{"title":"Do Neighbor-Avoiding Walkers Walk as if in a Small-World Network?","authors":"G. Gianini, E. Damiani","doi":"10.1109/INFCOMW.2009.5072133","DOIUrl":"https://doi.org/10.1109/INFCOMW.2009.5072133","url":null,"abstract":"A social network can be said to exhibit the small-world phenomenon if any two individuals in the network are likely to be connected through a short sequence of intermediate acquaintances. If so, this short degree of separation can be exploited to route messages more quickly. Even networks which do not have a small world structure can in principle be given one through the addition of few extra links. The problem is that most large scale social networks are inherently unstructured and so are many computer networks, such as wireless ad-hoc networks, and most wireless sensor networks: for practical reasons it is often impossible to run a distributed algorithm able to enforce in such networks the minimal lightweight infrastructure needed to exploit their small world topology, when this is present. It is often equally impossible adding connections to a non-small-world network to change it into a small-world one. In unstructured networks an agent, or a node, has no precise information nor model of the overall topology of the network, and to send out or pass information has to rely only on local knowledge of the topology, i.e. on the knowledge of its neighbors. For this reason, in most unstructured networks, information is propagated by gossiping, i.e. by passing the information to one neighbor chosen according to some random policy. As a result the message undergoes a random walk. The characteristics of the walk depend both on the topology of the network and on the details of the random policy used. Recently some attention has been given to the random walk policy defined by self-avoiding random walks (SAWs), where a message is not allowed to be forwarded to a node visited in the latest few steps, and to a generalization of the SAWs, the neighbor-avoiding random walks (NAWs), where the message is not allowed to be forwarded to the neighbors of the latest visited nodes. In this paper we study the behavior of NAW policies within the reference networking problem of information spreading and quantify their performance in terms of cover time and in terms of its variance. We argue that in networks with moderate number of nodes the class of NAW policies feel an effective network's communication structure closer to a small-world one.","PeriodicalId":252414,"journal":{"name":"IEEE INFOCOM Workshops 2009","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124552985","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}

{"title":"Towards Enhanced RSSI-Based Distance Measurements and Localization in WSNs","authors":"H. AbdelSalam, S. Olariu","doi":"10.1109/INFCOMW.2009.5072200","DOIUrl":"https://doi.org/10.1109/INFCOMW.2009.5072200","url":null,"abstract":"Despite its inherent inaccuracy, RSSI has been used as the standard tool for distance measurements in the majority of range-based localization protocols available in the literature. In this paper, we propose a technique to enhance the accuracy of RSSI-based distance measurements using calibration. Our technique depends on the existence of location-aware anchor nodes that are distributed across the deployment area. Initially and through exchanging messages between anchors, the deployment area is divided into disjoint set of Delaunay triangles. Through the power of received signals, anchors estimate a set of calibration records(CR) and distribute them to sensors in their neighborhood. Each triangle edge connects a pair of anchors and is associated with a single calibration record. Each record contains calibration parameters for sensors in the neighborhood of the record anchors. Based on the power of received messages from different anchors, sensors can determine the calibration record they should use for their RSSI-based distance measurements.","PeriodicalId":252414,"journal":{"name":"IEEE INFOCOM Workshops 2009","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115991517","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}