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

On The Implementation of Traffic-Engineering in an "All-Ethernet Global Multi-Service Infrastructure" “全以太网全局多业务基础设施”中流量工程的实现

Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications Pub Date : 2006-04-23 DOI: 10.1109/INFOCOM.2006.16

A. Hadjiantonis, Mohamed A. Ali, H. Chamas, W. Bjorkman, S. Elby, N. Ghani

引用次数: 2

Policy-Based Service Provisioning Architecture for Hybrid Photonic Networks 基于策略的混合光子网络服务发放体系结构

Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications Pub Date : 2006-04-23 DOI: 10.1109/INFOCOM.2006.96

Belkacem Daheb, G. Pujolle, W. Fawaz, Ken Chen

引用次数: 1

Dedicated Channels as an Optimal Network Support for Effective Transfer of Massive Data 专用通道是有效传输海量数据的最佳网络支持

Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications Pub Date : 2006-04-23 DOI: 10.1109/INFOCOM.2006.20

Sergey Gorinsky, N. Rao

引用次数: 31

Light-Weight Overlay Path Selection in a Peer-to-Peer Environment 点对点环境中的轻量级覆盖路径选择

Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications Pub Date : 2006-04-23 DOI: 10.1109/INFOCOM.2006.48

Teng Fei, S. Tao, Lixin Gao, R. Guérin, Zhi-Li Zhang

引用次数: 14

Bandwidth Sharing with Primary Paths for Protection Routing in an MPLS Network 利用主路径共享带宽实现MPLS网络保护路由

Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications Pub Date : 2006-04-23 DOI: 10.1109/INFOCOM.2006.58

Faisal Aslam, Saqib Raza, Z. A. Uzmi, Young-Chon Kim

{"title":"Bandwidth Sharing with Primary Paths for Protection Routing in an MPLS Network","authors":"Faisal Aslam, Saqib Raza, Z. A. Uzmi, Young-Chon Kim","doi":"10.1109/INFOCOM.2006.58","DOIUrl":"https://doi.org/10.1109/INFOCOM.2006.58","url":null,"abstract":"In label-switched networks such as MPLS, protection routing involves computing and setting up the backup paths at the same time when the primary paths are routed. It has previously been shown that two or more backup paths may share bandwidth along common links if such backup paths will never be activated simultaneously. Such sharing between the backup paths leads to reduced bandwidth reservations and, hence improved performance in terms of number of path requests that can be accommodated on the network (Aslam et al., 2005). We present a novel idea that backup paths may also share bandwidth with certain primary paths, thereby further reducing the overall bandwidth reservations on the network. This results in even more path requests being accommodated on the network. Sharing with primary paths is possible with any protection routing framework. To demonstrate this sharing, we use the NPP protection routing framework as an example (Aslam et al., 2005). We provide the enhancements to the NPP framework needed to exploit sharing with the primary paths. For the enhanced NPP framework, simulation results on various networks confirm that sharing with primary paths indeed results in better network utilization. This increased performance is achieved with bounded local state information and without requiring any additional routing or signaling overhead.","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":"131181733","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}

引用次数: 7

Stimulating Participation in Wireless Community Networks 鼓励参与无线社区网络

Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications Pub Date : 2006-04-23 DOI: 10.1109/INFOCOM.2006.320

E. C. Efstathiou, P. A. Frangoudis, George C. Polyzos

引用次数: 85

The Complexity of Connectivity in Wireless Networks 无线网络连接的复杂性

Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications Pub Date : 2006-04-23 DOI: 10.1109/INFOCOM.2006.23

T. Moscibroda, Roger Wattenhofer

{"title":"The Complexity of Connectivity in Wireless Networks","authors":"T. Moscibroda, Roger Wattenhofer","doi":"10.1109/INFOCOM.2006.23","DOIUrl":"https://doi.org/10.1109/INFOCOM.2006.23","url":null,"abstract":"We define and study the scheduling complexity in wireless networks, which expresses the theoretically achievable efficiency of MAC layer protocols. Given a set of communication requests in arbitrary networks, the scheduling complexity describes the amount of time required to successfully schedule all requests. The most basic and important network structure in wireless networks being connectivity, we study the scheduling complexity of connectivity, i.e., the minimal amount of time required until a connected structure can be scheduled. In this paper, we prove that the scheduling complexity of connectivity grows only polylogarithmically in the number of nodes. Specifically, we present a novel scheduling algorithm that successfully schedules a strongly connected set of links in time O(logn) even in arbitrary worst-case networks. On the other hand, we prove that standard MAC layer or scheduling protocols can perform much worse. Particularly, any protocol that either employs uniform or linear (a node’s transmit power is proportional to the minimum power required to reach its intended receiver) power assignment has a Ω(n) scheduling complexity in the worst case, even for simple communication requests. In contrast, our polylogarithmic scheduling algorithm allows many concurrent transmission by using an explicitly formulated non-linear power assignment scheme. Our results show that even in large-scale worst-case networks, there is no theoretical scalability problem when it comes to scheduling transmission requests, thus giving an interesting complement to the more pessimistic bounds for the capacity in wireless networks. All results are based on the physical model of communication, which takes into account that the signal-tonoise plus interference ratio (SINR) at a receiver must be above a certain threshold if the transmission is to be received correctly.","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":"130195183","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}

引用次数: 317

Establishing Pair-Wise Keys in Heterogeneous Sensor Networks 异构传感器网络中双密钥的建立

Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications Pub Date : 2006-04-23 DOI: 10.1109/INFOCOM.2006.260

Patrick Traynor, Heesook Choi, G. Cao, Sencun Zhu, T. L. Porta

{"title":"Establishing Pair-Wise Keys in Heterogeneous Sensor Networks","authors":"Patrick Traynor, Heesook Choi, G. Cao, Sencun Zhu, T. L. Porta","doi":"10.1109/INFOCOM.2006.260","DOIUrl":"https://doi.org/10.1109/INFOCOM.2006.260","url":null,"abstract":"Many applications that make use of sensor networks require secure communication. Because asymmetric-key solutions are difficult to implement in such a resource-constrained environment, symmetric-key methods coupled with a priori key distribution schemes have been proposed to achieve the goals of data secrecy and integrity. These approaches typically assume that all sensors are similar in terms of capabilities, and hence deploy the same number of keys in all sensors in a network to provide the aforementioned protections. In this paper we demonstrate that a probabilistic unbalanced distribution of keys throughout the network that leverages the existence of a small percentage of more capable sensor nodes can not only provide an equal level of security but also reduce the consequences of node compromise. We demonstrate the effectiveness of this approach on small networks using a variety of trust models and then demonstrate the application of this method to very large systems. The approach and analysis presented in this paper can be applied to all protocols that use probabilistic keys including those that employ broadcast mechanisms, hash functions or polynomials for the generation of keys.","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":"116049990","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}

引用次数: 105

Resource Aware Middleware Services Over MANETs 通过manet的资源感知中间件服务

Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications Pub Date : 2006-04-23 DOI: 10.1109/INFOCOM.2006.66

O. Drugan, T. Plagemann, E. Munthe-Kaas

引用次数: 3

A Node Identity Internetworking Architecture 一个节点身份互联网络架构

Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications Pub Date : 2006-04-23 DOI: 10.1109/INFOCOM.2006.51

B. Ahlgren, J. Arkko, L. Eggert, J. Rajahalme

引用次数: 98