Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications最新文献

{"title":"Secure Localization with Hidden and Mobile Base Stations","authors":"Srdjan Capkun, Mario Cagalj, M. Srivastava","doi":"10.1109/INFOCOM.2006.302","DOIUrl":"https://doi.org/10.1109/INFOCOM.2006.302","url":null,"abstract":"Keywords: NCCR-MICS ; NCCR-MICS/CL3 Reference LCA-CONF-2005-029 Record created on 2005-12-07, modified on 2017-05-12","PeriodicalId":163725,"journal":{"name":"Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132762134","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 Network Coding Approach to Energy Efficient Broadcasting: From Theory to Practice","authors":"C. Fragouli, J. Widmer, J. Boudec","doi":"10.1109/INFOCOM.2006.45","DOIUrl":"https://doi.org/10.1109/INFOCOM.2006.45","url":null,"abstract":"We show that network coding allows to realize significant energy savings in a wireless ad-hoc network, when each node of the network is a source that wants to transmit information to all other nodes. Energy efficiency directly affects battery life and thus is a critical design parameter for wireless ad-hoc networks. We propose an implementable method for performing network coding in such a setting. We analyze theoretical cases in detail, and use the insights gained to propose a practical, fully distributed method for realistic wireless adhoc scenarios. We address practical issues such as setting the forwarding factor, managing generations, impact of transmission range and mobility. We use theoretical analysis and packet level simulation.","PeriodicalId":163725,"journal":{"name":"Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications","volume":"176 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126948318","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":"Ad Hoc Routing with Distributed Ordered Sequences","authors":"M. Mosko, J. Garcia-Luna-Aceves","doi":"10.1109/INFOCOM.2006.200","DOIUrl":"https://doi.org/10.1109/INFOCOM.2006.200","url":null,"abstract":"Ad hoc routing with distributed ordered sequences Marc Mosko ∗ Palo Alto Research Center 3333 Coyote Hill Road Palo Alto, CA 94304 Email: mmosko@parc.com Abstract— We propose a new hop-by-hop routing protocol for ad hoc wireless networks that uses a novel sequence number scheme to ensure loop-freedom at all times. We use a single large per-destination label space to order nodes in a topological sort (directed acyclic graph). Nodes manipulate the label set in- network without needing destination-controlled resets, so path repair is localized. The label size is large enough that it should never be exhausted in the lifetime of any given network. Route request flooding is performed through a new method that exploits the inherent partial order of the network, so nodes can share RREQ floods. Whereas most previous route request pruning techniques create a request tree, the new technique creates a directed acyclic request graph. Simulation results compared to AODV, DSR and OLSR show that the new protocol has in most cases equivalent or better packet delivery ratio and latency, but with a fraction of the network load. I. I NTRODUCTION Wireless ad hoc computer networks are communications networks in which each node may be mobile and has at least one radio interface. There is no central infrastructure, such as cell towers, base stations, for access points. Exam- ples of these networks include tactical military applications, commercial vehicle-to-vehicle systems such as DSRC [1], or emergency rescue impromptu networks. The Internet Engi- neering Task Force (IETF) studies such networks under the mobile ad hoc networks (MANET) working group. Three MANET routing protocols have request for comments (RFC) status and two have internet draft (ID) status. The three MANET RFC protocols are the Adhoc On-demand Distance Vector (AODV) routing protocol [2], the Optimized Link State Routing (OLSR) protocol [3], and the Topology Dissemination Based on Reverse-Path Forwarding (TBRPF) [4]. The two Internet Drafts are the Dynamic Source Routing Protocol (DSR) [5], and the Dynamic MANET On-demand (DYMO) Routing [6]. TBRPF and OLSR are examples of link-state protocols, where nodes exchange topology information and execute a shortest path algorithm (e.g. Dijkstra’s) using the topology information they maintain to find routing paths. Unfortunately, neither of these protocol are loop-free, which means that the routing tables at nodes may point in a directed cycle at times. AODV, DSR, DYMO operate as on-demand protocols, which means that they do not maintain routes for all destinations, only those for which there is traffic. Nodes discover paths in on-demand routing protocols through route request (RREQ) floods in the network and unicast route reply J.J. Garcia-Luna-Aceves ∗† Computer Engineering Department University of California at Santa Cruz Santa Cruz, CA 95064 Email: jj@soe.ucsc.edu (RREP) advertisements. The IETF on-demand protocols attempt to maintain loop- free operation t","PeriodicalId":163725,"journal":{"name":"Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121986529","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":"PULSE, a Flexible P2P Live Streaming System","authors":"Fabio Pianese, Joaquín Keller, E. Biersack","doi":"10.1109/INFOCOM.2006.42","DOIUrl":"https://doi.org/10.1109/INFOCOM.2006.42","url":null,"abstract":"With the widespread availability of inexpensive broadband Internet connections for home-users, a large number of bandwidth-intensive applications previously not feasible have now become practical. This is the case for multimedia live streaming, for which end-user's dial-up/ISDN modem connections once were the bottleneck. The bottleneck is now mostly found on the server side: the bandwidth required for serving many clients at once is large and thus very costly to the broadcasting entity. Peer-to-peer systems for on-demand and live streaming have proved to be an encouraging solution, since they can shift the burden of content distribution from the server to the users of the network. In this work we introduce PULSE, a P2P system for live streaming whose main goals are flexibility, scalability, and robustness. We present the fundamental concepts that stand behind the design of PULSE along with its intended global behavior, and describe in detail the main algorithms running on its nodes.","PeriodicalId":163725,"journal":{"name":"Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130467849","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":"Comparison Studies between Pre-Shared and Public Key Exchange Mechanisms for Transport Layer Security","authors":"F. Kuo, H. Tschofenig, Fabian Meyer, Xiaoming Fu","doi":"10.1109/INFOCOM.2006.52","DOIUrl":"https://doi.org/10.1109/INFOCOM.2006.52","url":null,"abstract":"The pre-shared key based mechanisms for Transport Layer Security (TLS) were recently standardized by the IETF to extend the set of ciphersuites by utilizing existing key management infrastructures. The benefit of pre-shared based mechanisms is the avoidance or reduction of the cryptographic operations used in public-key based mechanisms. However, so far there are no performance measurements for pre-shared key based ciphersuites available. In this paper, we present a systematic analysis and performance comparison between the pre-shared key exchange mechanisms and the standard public key exchange mechanisms in TLS. Our performance metrics are processing time and transmitted amount of data for a handshake establishment. Furthermore, the interaction between the overall TLS handshake duration and the network environment is evaluated. The results for different key exchange mechanisms are comparatively studied and the design choices of pre-shared key based key exchange mechanisms have been validated. Experimental results give details about the performance improvement of the pre-shared key based mechanisms compared to the standard public key based mechanisms.","PeriodicalId":163725,"journal":{"name":"Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128945717","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":"Control Plane for Advance Bandwidth Scheduling in Ultra High-Speed Networks","authors":"N. Rao, C. Wu, Song Ding, S. Carter, W. Wing, A. Banerjee, D. Ghosal, B. Mukherjee","doi":"10.1109/INFOCOM.2006.35","DOIUrl":"https://doi.org/10.1109/INFOCOM.2006.35","url":null,"abstract":"A control-plane architecture for supporting advance reservation of dedicated bandwidth channels on a switched network infrastructure is described including the front-end web interface, user and token management scheme, bandwidth scheduler, and signaling daemon. A path computation algorithm for bandwidth scheduling is proposed based on an extension of Bellman-Ford algorithm to an algebraic structure on sequences of disjoint non-negative real intervals. An implementation of this architecture for UltraScience Net is briefly described.","PeriodicalId":163725,"journal":{"name":"Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128963510","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":"An Integrated Framework for Managing Best Effort Traffic in MPLS Networks","authors":"Christopher Marty, Mohamed A. Ali","doi":"10.1109/INFOCOM.2006.60","DOIUrl":"https://doi.org/10.1109/INFOCOM.2006.60","url":null,"abstract":"This paper presents a scalable and flexible system for explicit rate congestion control in multi-protocol label switched networks. Resource reservation protocol is used to signal explicit rate congestion control information for best effort label switched paths. We present a weight proportional max-min fair rate algorithm that works with the signaling mechanism to calculate differentiated fair rates in O(1) time. We propose a method for marking traffic that is above the explicit rate as less than best effort allowing bursty traffic to utilize excess capacity while ensuring all label switched paths get a fair allocation of bandwidth. Simulations are presented that show the effectiveness of the proposed system.","PeriodicalId":163725,"journal":{"name":"Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122985254","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":"Analyzing the Energy-Latency Trade-Off During the Deployment of Sensor Networks","authors":"T. Moscibroda, Pascal von Rickenbach, Roger Wattenhofer","doi":"10.1109/INFOCOM.2006.295","DOIUrl":"https://doi.org/10.1109/INFOCOM.2006.295","url":null,"abstract":"The inherent trade-off between energy-efficiency and rapidity of event dissemination is characteristic for wireless sensor networks. Scarcity of energy renders it necessary for nodes to spend a large portion of their lifetime in an energyefficient sleep mode during which they do neither receive nor send messages. On the other hand, the longer nodes stay in sleep mode, the slower will be the reaction time for disseminating an external event. The trade-off is prominently exhibited during the deployment phase of sensor networks, if some nodes are deployed earlier than others. In this paper, we study this fundamental trade-off by giving a formal model that enables us to compare the performance of different protocols and algorithms. Based on this model, we propose, analyze, and simulate two novel algorithms which significantly outperform existing solutions.","PeriodicalId":163725,"journal":{"name":"Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121569105","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":"Policy Based QoS Architecture in MUSE","authors":"G. Rajan, A. Armengol, P. Nooren, A. Foglar","doi":"10.1109/INFOCOM.2006.98","DOIUrl":"https://doi.org/10.1109/INFOCOM.2006.98","url":null,"abstract":"This paper presents the architecture and framework for a policy based QoS control in a shared medium type of network such as Ethernet. QoS is achieved by a combination of traffic engineering of bandwidth pipes, priority scheduling of traffic at network nodes and controlled access to the bandwidth pipes in broadband access networks.","PeriodicalId":163725,"journal":{"name":"Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122690937","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":"Extracting a Mobility Model from Real User Traces","authors":"Minkyong Kim, D. Kotz, S. Kim","doi":"10.1109/INFOCOM.2006.173","DOIUrl":"https://doi.org/10.1109/INFOCOM.2006.173","url":null,"abstract":"Understanding user mobility is critical for simula- tions of mobile devices in a wireless network, but current mobility models often do not reflect real user movements. In this paper, we provide a foundation for such work by exploring mobility characteristics in traces of mobile users. We present a method to estimate the physical location of users from a large trace of mobile devices associating with access points in a wireless network. Using this method, we extracted tracks of always-on Wi-Fi devices from a 13-month trace. We discovered that the speed and pause time each follow a log-normal distribution and that the direction of movements closely reflects the direction of roads and walkways. Based on the extracted mobility characteristics, we developed a mobility model, focusing on movements among popular regions. Our validation shows that synthetic tracks match real tracks with a median relative error of 17%.","PeriodicalId":163725,"journal":{"name":"Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115205730","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}