2008 IEEE International Conference on Network Protocols最新文献_第2页

New adaptive protocols for fine-level end-to-end rate control in wireless networks 无线网络中精细级端到端速率控制的新自适应协议

2008 IEEE International Conference on Network Protocols Pub Date : 2008-12-08 DOI: 10.1109/ICNP.2008.4697021

Ying Jian, Shigang Chen, L. Zhang, Yuguang Fang

{"title":"New adaptive protocols for fine-level end-to-end rate control in wireless networks","authors":"Ying Jian, Shigang Chen, L. Zhang, Yuguang Fang","doi":"10.1109/ICNP.2008.4697021","DOIUrl":"https://doi.org/10.1109/ICNP.2008.4697021","url":null,"abstract":"Fine-level rate control, particularly meeting rate requirements and differentiating various types of end-to-end traffic, remains an open problem for multihop wireless networks. Traditionally, rate assurance in wired networks is achieved through resource reservation and admission control, which can be efficiently implemented since the bandwidth capacity of each communication link is known and the sender of a link has the information of all flows that compete for the bandwidth of the link. In a wireless network, however, the capacity of each wireless link can change unpredictably over time due to contention from nearby links and dynamic channel conditions. An end-to-end flow consumes available bandwidth not only at links on its route but also at all nearby contending links, which makes resource reservation extremely complicated. We believe fundamental differences require a fundamentally different paradigm shift in solutions. Is there a simpler alternative to resource reservation and admission control that is better suited for wireless network dynamics? In this paper, we propose a new adaptive rate control function based on two novel protocols, called dynamic weight adaptation with floor and ceiling and proportional packet scheduling, which together implement prioritized rate assurance and sophisticated bandwidth differentiation among all end-to-end flows in a multihop wireless network without resource reservation and admission control. The adaptive function achieves global rate control objectives in a fully distributed way using only localized operations.","PeriodicalId":301984,"journal":{"name":"2008 IEEE International Conference on Network Protocols","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115192723","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}

引用次数: 5

A model-based approach to security flaw detection of network protocol implementations 基于模型的网络协议实现安全漏洞检测方法

2008 IEEE International Conference on Network Protocols Pub Date : 2008-12-08 DOI: 10.1109/ICNP.2008.4697030

Yating Hsu, Guoqiang Shu, David Lee

{"title":"A model-based approach to security flaw detection of network protocol implementations","authors":"Yating Hsu, Guoqiang Shu, David Lee","doi":"10.1109/ICNP.2008.4697030","DOIUrl":"https://doi.org/10.1109/ICNP.2008.4697030","url":null,"abstract":"A lot of efforts have been devoted to the analysis of network protocol specification for reliability and security properties using formal techniques. However, faults can also be introduced during system implementation; it is indispensable to detect protocol implementation flaws, yet due to the black-box nature of protocol implementation and the unavailability of protocol specification most of the approaches resort to random or manual testing. In this paper we propose a model-based approach for security flaw detection of protocol implementation with a high fault coverage, measurability, and automation. Our approach first synthesizes an abstract behavioral model from a protocol implementation and then uses it to guide the testing process for detecting security and reliability flaws. For protocol specification synthesis we reduce the problem a trace minimization with a finite state machine model and an efficient algorithm is presented for state space reduction. Our method is implemented and applied to real network protocols. Guided by the synthesized model our testing tool reveals a number of unknown reliability and security issues by automatically crashing the implementations of the Microsoft MSN instant messaging (MSNIM) protocol. Analytical comparison between our model-based and prevalent syntax-based flaw detection schemes is also provided with the support of experimental results.","PeriodicalId":301984,"journal":{"name":"2008 IEEE International Conference on Network Protocols","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126052968","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}

引用次数: 55

Substream Trading: Towards an open P2P live streaming system 子流交易:走向开放的P2P直播系统

2008 IEEE International Conference on Network Protocols Pub Date : 2008-12-08 DOI: 10.1109/ICNP.2008.4697028

Zhengye Liu, Yanming Shen, K. Ross, S. Panwar, Yao Wang

引用次数: 100

Robust channel assignment for link-level resource provision in multi-radio multi-channel wireless networks 多无线电多信道无线网络中链路级资源分配的鲁棒信道分配

2008 IEEE International Conference on Network Protocols Pub Date : 2008-12-08 DOI: 10.1109/ICNP.2008.4697034

Cunqing Hua, Song Wei, Rong L. Zheng

{"title":"Robust channel assignment for link-level resource provision in multi-radio multi-channel wireless networks","authors":"Cunqing Hua, Song Wei, Rong L. Zheng","doi":"10.1109/ICNP.2008.4697034","DOIUrl":"https://doi.org/10.1109/ICNP.2008.4697034","url":null,"abstract":"In this paper, we investigate the problem of link-level resource provision in multi-radio multi-channel (MR-MC) wireless networks. To quantify robustness of resource provision schemes, we propose the novel concept of interference margin. Using the notion of interference margin, a robust radio and channel assignment problem is formulated that explicitly takes into consideration link-level traffic demands. The key advantage of the proposed formulation is its robustness to channel variability and co-existence of external interference sources. We utilize the generalized Benders decomposition techniques to decouple the radio and channel assignment (combinatorial constraints) and network resource allocation (continuous constraints) so that the problem can be solved efficiently. The proposed algorithm is guaranteed to converge to the optimal solution within a finite number of iterations. We have evaluated our scheme using traces collected from a wireless mesh testbed and simulation studies in Qualnet. Experiments show that the proposed algorithm is superior to existing schemes in providing larger interference margin, and reducing outage and packet loss probabilities.","PeriodicalId":301984,"journal":{"name":"2008 IEEE International Conference on Network Protocols","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114218619","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}

引用次数: 15

Controlling overload in networks of SIP servers 控制SIP服务器网络过载

2008 IEEE International Conference on Network Protocols Pub Date : 2008-12-08 DOI: 10.1109/ICNP.2008.4697027

V. Hilt, I. Widjaja

{"title":"Controlling overload in networks of SIP servers","authors":"V. Hilt, I. Widjaja","doi":"10.1109/ICNP.2008.4697027","DOIUrl":"https://doi.org/10.1109/ICNP.2008.4697027","url":null,"abstract":"The session initiation protocol (SIP) is rapidly being adopted as the signaling protocol for establishing, modifying and terminating multimedia sessions. With the increasing use of SIP in large deployments, it is now becoming apparent that the current SIP design does not easily scale up to large network sizes and SIP servers are not well equipped to handle overload conditions. When a SIP server is operating close to or above its capacity limit, message retransmissions by various SIP timers can cause the network to be severely overloaded and result in an extremely low goodput. In this paper, we first provide a detailed analysis of the behavior of SIP servers under overload. We show that SIP servers are often unable to recover from congestion collapse once it has occurred and that overload can spread throughout a network of SIP servers. We then discuss mechanisms and algorithms for controlling overload in these servers. We found that performing overload control locally at a server provides a simple remedy for light cases of overload; however, it is ineffective in handling higher amounts of load. Finally, we investigate distributed overload control mechanisms for SIP and show that they are effective in controlling overload of SIP servers.","PeriodicalId":301984,"journal":{"name":"2008 IEEE International Conference on Network Protocols","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114225845","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}

引用次数: 117

Incentive-aware routing in DTNs dtn中的激励感知路由

2008 IEEE International Conference on Network Protocols Pub Date : 2008-12-08 DOI: 10.1109/ICNP.2008.4697042

Upendra Shevade, H. Song, L. Qiu, Yin Zhang

{"title":"Incentive-aware routing in DTNs","authors":"Upendra Shevade, H. Song, L. Qiu, Yin Zhang","doi":"10.1109/ICNP.2008.4697042","DOIUrl":"https://doi.org/10.1109/ICNP.2008.4697042","url":null,"abstract":"Disruption tolerant networks (DTNs) are a class of networks in which no contemporaneous path may exist between the source and destination at a given time. In such a network, routing takes place with the help of relay nodes and in a store-and-forward fashion. If the nodes in a DTN are controlled by rational entities, such as people or organizations, the nodes can be expected to behave selfishly and attempt to maximize their utilities and conserve their resources. Since routing is an inherently cooperative activity, system operation will be critically impaired unless cooperation is somehow incentivized. The lack of end-to-end paths, high variation in network conditions, and long feedback delay in DTNs imply that existing solutions for mobile ad-hoc networks do not apply to DTNs. In this paper, we propose the use of pair-wise tit-for-tat (TFT) as a simple, robust and practical incentive mechanism for DTNs. Existing TFT mechanisms often face bootstrapping problems or suffer from exploitation. We propose a TFT mechanism that incorporates generosity and contrition to address these issues. We then develop an incentive-aware routing protocol that allows selfish nodes to maximize their own performance while conforming to TFT constraints. For comparison, we also develop techniques to optimize the system-wide performance when all nodes are cooperative. Using both synthetic and real DTN traces, we show that without an incentive mechanism, the delivery ratio among selfish nodes can be as low as 20% as what is achieved under full cooperation; in contrast, with TFT as a basis of cooperation among selfish nodes, the delivery ratio increases to 60% or higher as under full cooperation. We also address the practical challenges involved in implementing the TFT mechanism. To our knowledge, this is the first practical incentive-aware routing scheme for DTNs.","PeriodicalId":301984,"journal":{"name":"2008 IEEE International Conference on Network Protocols","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131318451","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}

引用次数: 245

PRISM: Privacy-friendly routing in suspicious MANETs (and VANETs) PRISM:可疑manet(和vanet)中的隐私友好路由

2008 IEEE International Conference on Network Protocols Pub Date : 2008-12-08 DOI: 10.1109/ICNP.2008.4697044

Karim M. El Defrawy, G. Tsudik

引用次数: 87

A scalable distributed routing protocol for networks with data-path services 一种可扩展的分布式路由协议，用于具有数据路径服务的网络

2008 IEEE International Conference on Network Protocols Pub Date : 2008-12-08 DOI: 10.1109/ICNP.2008.4697050

Xin Huang, S. Ganapathy, T. Wolf

引用次数: 21

CARS: Context-Aware Rate Selection for vehicular networks 汽车:车辆网络环境感知速率选择

2008 IEEE International Conference on Network Protocols Pub Date : 2008-12-08 DOI: 10.1109/ICNP.2008.4697019

P. Shankar, T. Nadeem, J. Rosca, L. Iftode

{"title":"CARS: Context-Aware Rate Selection for vehicular networks","authors":"P. Shankar, T. Nadeem, J. Rosca, L. Iftode","doi":"10.1109/ICNP.2008.4697019","DOIUrl":"https://doi.org/10.1109/ICNP.2008.4697019","url":null,"abstract":"Traffic querying, road sensing and mobile content delivery are emerging application domains for vehicular networks whose performance depends on the throughput these networks can sustain. Rate adaptation is one of the key mechanisms at the link layer that determine this performance. Rate adaptation in vehicular networks faces the following key challenges: (1) due to the rapid variations of the link quality caused by fading and mobility at vehicular speeds, the transmission rate must adapt fast in order to be effective, (2) during infrequent and bursty transmission, the rate adaptation scheme must be able to estimate the link quality with few or no packets transmitted in the estimation window, (3) the rate adaptation scheme must distinguish losses due to environment from those due to hidden-station induced collision. Our extensive outdoor experiments show that the existing rate adaptation schemes for 802.11 wireless networks under utilize the link capacity in vehicular environments. In this paper, we design, implement and evaluate CARS, a novel context-aware rate selection algorithm that makes use of context information (e.g. vehicle speed and distance from neighbor) to systematically address the above challenges, while maximizing the link throughput. Our experimental evaluation in real outdoor vehicular environments with different mobility scenarios shows that CARS adapts to changing link conditions at high vehicular speeds faster than existing rate-adaptation algorithms. Our scheme achieves significantly higher throughput, up to 79%, in all the tested scenarios, and is robust to packet loss due to collisions, improving the throughput by up to 256% in the presence of hidden stations.","PeriodicalId":301984,"journal":{"name":"2008 IEEE International Conference on Network Protocols","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130444665","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}

引用次数: 118

Optimization based rate allocation and scheduling in TDMA based wireless mesh networks 基于TDMA的无线网状网络中基于优化的速率分配和调度

2008 IEEE International Conference on Network Protocols Pub Date : 2008-12-08 DOI: 10.1109/ICNP.2008.4697033

Bo Wang, M. Mutka, E. Torng

引用次数: 13