2011 19th IEEE International Conference on Network Protocols最新文献_第2页

Gaming over COPSS: A content centric communication infrastructure for gaming applications 基于COPSS的游戏:游戏应用程序的以内容为中心的通信基础设施

2011 19th IEEE International Conference on Network Protocols Pub Date : 2011-10-17 DOI: 10.1109/ICNP.2011.6089039

Jiachen Chen, M. Arumaithurai, Xiaoming Fu, K. Ramakrishnan

{"title":"Gaming over COPSS: A content centric communication infrastructure for gaming applications","authors":"Jiachen Chen, M. Arumaithurai, Xiaoming Fu, K. Ramakrishnan","doi":"10.1109/ICNP.2011.6089039","DOIUrl":"https://doi.org/10.1109/ICNP.2011.6089039","url":null,"abstract":"Supporting Massively Multiplayer Online Role Playing Games (MMORPG) is a significant challenge. MMORPGs have become very popular because of their attractive structuring and incorporation of realistic and creative scenarios. World of Warcraft and Counter-Strike are examples of such games and are characterized by high interactivity (need very low network latency). Every action an individual player performs typically needs to be communicated to all the related players and the players need to react according to the ‘current’ environment and the cumulative actions of all the players. Games like Second Life involve a large number of players and require a persistent view of the world that is usually managed by a dedicated server (e.g., one that is hosted by the game's publisher). The load on such a server for player management and communication can be significant, and is likely to be a source of substantial latency. A problem in designing a MMORPG is that of determining the related players for every action and disseminate these actions and the changed environment to the relevant players in a scalable manner with very low latency. For games where the environment is divided into regions that different groups of players may have varying amounts of visibility, it is desirable to sub-divide the environment into hierarchical regions. We envisage incorporating the notion of a “multi-layer hierarchical map”. While such capabilities exist in some limited form in selected games, such as Second Life (where players share a global map), they may be useful in a wide range of interactive MMORPG. A server-based infrastructure is likely to have more difficulty with providing this capability because of the communication and processing (customized for each individual player) requirements.","PeriodicalId":202059,"journal":{"name":"2011 19th IEEE International Conference on Network Protocols","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134347602","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}

引用次数: 3

Probabilistic verification of BGP convergence BGP收敛的概率验证

2011 19th IEEE International Conference on Network Protocols Pub Date : 2011-10-17 DOI: 10.1109/ICNP.2011.6089037

Soroush Haeri, D. Kresic, L. Trajković

引用次数: 3

Source address validation solution with OpenFlow/NOX architecture 使用OpenFlow/NOX架构的源地址验证解决方案

2011 19th IEEE International Conference on Network Protocols Pub Date : 2011-10-17 DOI: 10.1109/ICNP.2011.6089085

Guang Yao, J. Bi, Peiyao Xiao

引用次数: 122

Dynamic Window Coupling for multipath congestion control 多路径拥塞控制的动态窗口耦合

2011 19th IEEE International Conference on Network Protocols Pub Date : 2011-10-17 DOI: 10.1109/ICNP.2011.6089073

S. Hassayoun, J. Iyengar, David Ros

{"title":"Dynamic Window Coupling for multipath congestion control","authors":"S. Hassayoun, J. Iyengar, David Ros","doi":"10.1109/ICNP.2011.6089073","DOIUrl":"https://doi.org/10.1109/ICNP.2011.6089073","url":null,"abstract":"The traditional problem of end-hosts efficiently and fairly utilizing end-to-end paths becomes significantly harder when the end-hosts are multihomed. Such is the case, for instance, when an end-host has simultaneous connectivity through several service providers, or when a mobile device is simultaneously connected via both a wireless LAN and a cellular network. A multihoming-aware transport protocol, such as MPTCP or SCTP, that sends data over the multiple resulting end-to-end paths must be fair to other flows in the network while being able to maximize its own throughput. In this paper, we present Dynamic Window Coupling (DWC), a multipath congestion control mechanism that seeks to achieve both these goals. DWC uses loss and delay signals to detect shared bottlenecks, explicitly grouping and sharing congestion control across subflows on paths that have a common bottleneck, while separating congestion control for subflows on paths with distinct bottlenecks. DWC detects shifting bottlenecks in the network and responds by dynamically regrouping subflows. Simulations demonstrate that DWC detects shared bottlenecks under most network topologies and conditions that we considered, regroups subflows correctly as bottlenecks shift, aggregates throughput across distinct bottlenecks, and is fair to other TCP flows at all bottlenecks.","PeriodicalId":202059,"journal":{"name":"2011 19th IEEE International Conference on Network Protocols","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125335893","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}

引用次数: 60

Generalized graph products for network design and analysis 网络设计与分析的广义图积

2011 19th IEEE International Conference on Network Protocols Pub Date : 2011-10-17 DOI: 10.1109/ICNP.2011.6089084

Eric Parsonage, H. Nguyen, R. Bowden, Simon Knight, Nickolas J. G. Falkner, M. Roughan

引用次数: 28

Efficient and fast distributed top-k query protocol in wireless sensor networks 无线传感器网络中高效快速的分布式top-k查询协议

2011 19th IEEE International Conference on Network Protocols Pub Date : 2011-10-17 DOI: 10.1109/ICNP.2011.6089087

Shaojie Tang, Xufei Mao, Xiangyang Li

{"title":"Efficient and fast distributed top-k query protocol in wireless sensor networks","authors":"Shaojie Tang, Xufei Mao, Xiangyang Li","doi":"10.1109/ICNP.2011.6089087","DOIUrl":"https://doi.org/10.1109/ICNP.2011.6089087","url":null,"abstract":"In this paper, we focus on designing efficient query of top-k data produced by sensor nodes in a wireless sensor network (WSN). Assume that we are given a connected WSN of diameter D, consisting of n nodes with maximum node degree Δ. Two different models are studied. In the first model, each node holds a numeric element, the goal is to determine the top-k smallest (or biggest) of these elements from all nodes. In the second model, there are m objects in set ℒ, each node vi, 1 ≤ i ≤ n holds a numeric value Sj(vi) for each object Lj ∈ ℒ,1 ≤ j ≤ m, the goal is to find the k objects in ℒ with the k smallest (or biggest) aggregated values /(sj(u1), Sj(v2), ..., Sj(vn)), where f is an aggregation function given in advance. We propose both fast and message efficient methods for conducting top-k queries in the two aforementioned models. Following that we study the minimum delay and messages required by any distributed method for top-k queries in both models. Our analysis shows that our methods are almost optimum. We conducted extensive experiments in both testbed and simulations to study the practical performances of our methods.","PeriodicalId":202059,"journal":{"name":"2011 19th IEEE International Conference on Network Protocols","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127274784","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}

引用次数: 12

Scalable routing easy as PIE: A practical isometric embedding protocol 可扩展路由容易为PIE:一个实用的等距嵌入协议

2011 19th IEEE International Conference on Network Protocols Pub Date : 2011-10-17 DOI: 10.1109/ICNP.2011.6089081

J. Herzen, C. Westphal, Patrick Thiran

{"title":"Scalable routing easy as PIE: A practical isometric embedding protocol","authors":"J. Herzen, C. Westphal, Patrick Thiran","doi":"10.1109/ICNP.2011.6089081","DOIUrl":"https://doi.org/10.1109/ICNP.2011.6089081","url":null,"abstract":"We present PIE, a scalable routing scheme that achieves 100% packet delivery and low path stretch. It is easy to implement in a distributed fashion and works well when costs are associated to links. Scalability is achieved by using virtual coordinates in a space of concise dimensionality, which enables greedy routing based only on local knowledge. PIE is a general routing scheme, meaning that it works on any graph. We focus however on the Internet, where routing scalability is an urgent concern. We show analytically and by using simulation that the scheme scales extremely well on Internet-like graphs. In addition, its geometric nature allows it to react efficiently to topological changes or failures by finding new paths in the network at no cost, yielding better delivery ratios than standard algorithms. The proposed routing scheme needs an amount of memory polylogarithmic in the size of the network and requires only local communication between the nodes. Although each node constructs its coordinates and routes packets locally, the path stretch remains extremely low, even lower than for centralized or less scalable state-of-the-art algorithms: PIE always finds short paths and often enough finds the shortest paths.","PeriodicalId":202059,"journal":{"name":"2011 19th IEEE International Conference on Network Protocols","volume":"3 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120826956","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}

引用次数: 45

IPv6 evolution, stability and deployment IPv6的演进、稳定性和部署

2011 19th IEEE International Conference on Network Protocols Pub Date : 2011-10-17 DOI: 10.1109/ICNP.2011.6089035

Xiaoke Jiang, J. Bi, Yangyang Wang, Zhijie He, Wei Zhang, Hongcheng Tian

引用次数: 2

Moving bits from 3G to metro-scale WiFi for vehicular network access: An integrated transport layer solution 将比特从3G移动到城域WiFi，用于车载网络接入:一种集成传输层解决方案

2011 19th IEEE International Conference on Network Protocols Pub Date : 2011-10-17 DOI: 10.1109/ICNP.2011.6089074

Xiaoxiao Hou, P. Deshpande, Samir R Das

{"title":"Moving bits from 3G to metro-scale WiFi for vehicular network access: An integrated transport layer solution","authors":"Xiaoxiao Hou, P. Deshpande, Samir R Das","doi":"10.1109/ICNP.2011.6089074","DOIUrl":"https://doi.org/10.1109/ICNP.2011.6089074","url":null,"abstract":"We investigate a transport layer protocol design that integrates 3G and WiFi networks, specifically targeting vehicular mobility. The goal is to move load from the expensive 3G network to the less expensive WiFi network without hurting the user experience. As the test platform we choose a nationwide 3G network and a commercially operated metro-scale WiFi network. We exploit the often complementary characteristics of these networks for a hybrid design at the transport layer. To this end, we modify the stock Linux SCTP implementation to support ‘striping’ across multiple interfaces and the ability to handle frequent path failures and recovery in a seamless fashion. Instead of simply striping data over two network connections, we develop a utility and cost-based formulation that decides the right amount of load that can be put on the 3G network to maximize the user's benefit. We develop and experiment with a transport level scheduler to do this. We call the new SCTP design as oSCTP, meaning ‘SCTP to be used for offloading.’ We demonstrate the effectiveness of oSCTP and show that it is able to deliver superior network throughput and user experience, while significantly reducing the load on the 3G network.","PeriodicalId":202059,"journal":{"name":"2011 19th IEEE International Conference on Network Protocols","volume":"221 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132518925","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}

引用次数: 66

Network fault localization with small TCB 基于小TCB的网络故障定位

2011 19th IEEE International Conference on Network Protocols Pub Date : 2011-10-17 DOI: 10.1109/ICNP.2011.6089046

Xin Zhang, Zongwei Zhou, Geoffrey Hasker, A. Perrig, V. Gligor

引用次数: 27