Pub Date : 2011-10-17DOI: 10.1109/ICNP.2011.6089039
Jiachen Chen, M. Arumaithurai, Xiaoming Fu, K. Ramakrishnan
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.
{"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}
Pub Date : 2011-10-17DOI: 10.1109/ICNP.2011.6089037
Soroush Haeri, D. Kresic, L. Trajković
The Border Gateway Protocol (BGP) is the de facto Internet routing protocol. Various aspects of the BGP protocol have been analyzed using mathematical and experimental approaches. Formal verification of BGP specification validates whether or not a specific set of requirements is satisfied. In resent years, the probabilistic behavior of BGP has been explored. The size of routing tables has been modeled as a stochastic process that changes over time according to some probability distribution function. Hence, the verification of BGP may also be probabilistic in nature due to its randomized behavior. In this paper, we present a probabilistic model checking approach to analyze BGP convergence properties that may be employed to automate the BGP convergence analysis.
{"title":"Probabilistic verification of BGP convergence","authors":"Soroush Haeri, D. Kresic, L. Trajković","doi":"10.1109/ICNP.2011.6089037","DOIUrl":"https://doi.org/10.1109/ICNP.2011.6089037","url":null,"abstract":"The Border Gateway Protocol (BGP) is the de facto Internet routing protocol. Various aspects of the BGP protocol have been analyzed using mathematical and experimental approaches. Formal verification of BGP specification validates whether or not a specific set of requirements is satisfied. In resent years, the probabilistic behavior of BGP has been explored. The size of routing tables has been modeled as a stochastic process that changes over time according to some probability distribution function. Hence, the verification of BGP may also be probabilistic in nature due to its randomized behavior. In this paper, we present a probabilistic model checking approach to analyze BGP convergence properties that may be employed to automate the BGP convergence analysis.","PeriodicalId":202059,"journal":{"name":"2011 19th IEEE International Conference on Network Protocols","volume":"49 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":"117199448","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}
Pub Date : 2011-10-17DOI: 10.1109/ICNP.2011.6089085
Guang Yao, J. Bi, Peiyao Xiao
Current Internet is lack of validation on source IP address, resulting in many security threats. The future Internet can face the similar routing locator spoofing problem without careful design. The current in-progress source address validation standard, i.e., SAVI, is not of enough protection due to the solution space constraint. In this article, a mechanism named VAVE is proposed to improve the SAVI solutions. VAVE employs OpenFlow protocol, which provides the de facto standard network innovation interface, to solve source address validation problem with a global view. Significant improvements can be found from our evaluation results.
{"title":"Source address validation solution with OpenFlow/NOX architecture","authors":"Guang Yao, J. Bi, Peiyao Xiao","doi":"10.1109/ICNP.2011.6089085","DOIUrl":"https://doi.org/10.1109/ICNP.2011.6089085","url":null,"abstract":"Current Internet is lack of validation on source IP address, resulting in many security threats. The future Internet can face the similar routing locator spoofing problem without careful design. The current in-progress source address validation standard, i.e., SAVI, is not of enough protection due to the solution space constraint. In this article, a mechanism named VAVE is proposed to improve the SAVI solutions. VAVE employs OpenFlow protocol, which provides the de facto standard network innovation interface, to solve source address validation problem with a global view. Significant improvements can be found from our evaluation results.","PeriodicalId":202059,"journal":{"name":"2011 19th IEEE International Conference on Network Protocols","volume":"5 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":"123342395","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}
Pub Date : 2011-10-17DOI: 10.1109/ICNP.2011.6089073
S. Hassayoun, J. Iyengar, David Ros
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.
{"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}
Pub Date : 2011-10-17DOI: 10.1109/ICNP.2011.6089084
Eric Parsonage, H. Nguyen, R. Bowden, Simon Knight, Nickolas J. G. Falkner, M. Roughan
Network design, as it is currently practiced, involves putting devices together to create a network. However, a network is more than the sum of its parts, both in terms of the services it provides, and the potential for bugs. Devices are important, but their combination into a network should follow from expression of high-level policy, not the minutiae of network device configuration. Ideally we want to consider the network as a whole object. In this paper we develop generalized graph products that allow the mathematical design of a network in terms of small subgraphs that directly express business policy. The result is a flexible algebraic description of networks suitable for manipulation and proof. The approach is more than just design — it allows for analysis of existing networks providing an understanding of the policies used in their construction, something which can be difficult if the original designers no longer work on that network. We apply the approach to several real world networks to demonstrate how it can provide insight, and improve design.
{"title":"Generalized graph products for network design and analysis","authors":"Eric Parsonage, H. Nguyen, R. Bowden, Simon Knight, Nickolas J. G. Falkner, M. Roughan","doi":"10.1109/ICNP.2011.6089084","DOIUrl":"https://doi.org/10.1109/ICNP.2011.6089084","url":null,"abstract":"Network design, as it is currently practiced, involves putting devices together to create a network. However, a network is more than the sum of its parts, both in terms of the services it provides, and the potential for bugs. Devices are important, but their combination into a network should follow from expression of high-level policy, not the minutiae of network device configuration. Ideally we want to consider the network as a whole object. In this paper we develop generalized graph products that allow the mathematical design of a network in terms of small subgraphs that directly express business policy. The result is a flexible algebraic description of networks suitable for manipulation and proof. The approach is more than just design — it allows for analysis of existing networks providing an understanding of the policies used in their construction, something which can be difficult if the original designers no longer work on that network. We apply the approach to several real world networks to demonstrate how it can provide insight, and improve design.","PeriodicalId":202059,"journal":{"name":"2011 19th IEEE International Conference on Network Protocols","volume":"16 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":"129784171","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}
Pub Date : 2011-10-17DOI: 10.1109/ICNP.2011.6089087
Shaojie Tang, Xufei Mao, Xiangyang Li
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.
{"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 v<sub>i</sub>, 1 ≤ i ≤ n holds a numeric value S<sub>j</sub>(v<sub>i</sub>) for each object L<sub>j</sub> ∈ ℒ,1 ≤ j ≤ m, the goal is to find the k objects in ℒ with the k smallest (or biggest) aggregated values /(s<sub>j</sub>(u<sub>1</sub>), S<sub>j</sub>(v<sub>2</sub>), ..., S<sub>j</sub>(v<sub>n</sub>)), 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}
Pub Date : 2011-10-17DOI: 10.1109/ICNP.2011.6089081
J. Herzen, C. Westphal, Patrick Thiran
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.
{"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}
Our subject focuses on IPv6 network, which develops for more than 10 years. How IPv6 evolve in those years? Is IPv6 network mature enough to undertake the load produced by users? Can we find some principles to guide IPv6 deployment, which make the whole network more robust and efficiency? This paper tries to answer these questions with in-depth statistics. Good news is that network is growing at a speed of O(d2) (d is time) after 2006, moreover, network itself and its routing system become more and more stable. And we explore special properties of this preliminary network, We find that distribution of AS degree follows "Power-Law Distribution", but AS-level topology cannot be described as "Small-World Model" properly. We also propose a method to define the importance of AS and give a simple principle of IPv6 deployment. We even build "6Stats Project"[1] to provide data which help deploy IPv6.
{"title":"IPv6 evolution, stability and deployment","authors":"Xiaoke Jiang, J. Bi, Yangyang Wang, Zhijie He, Wei Zhang, Hongcheng Tian","doi":"10.1109/ICNP.2011.6089035","DOIUrl":"https://doi.org/10.1109/ICNP.2011.6089035","url":null,"abstract":"Our subject focuses on IPv6 network, which develops for more than 10 years. How IPv6 evolve in those years? Is IPv6 network mature enough to undertake the load produced by users? Can we find some principles to guide IPv6 deployment, which make the whole network more robust and efficiency? This paper tries to answer these questions with in-depth statistics. Good news is that network is growing at a speed of O(d2) (d is time) after 2006, moreover, network itself and its routing system become more and more stable. And we explore special properties of this preliminary network, We find that distribution of AS degree follows \"Power-Law Distribution\", but AS-level topology cannot be described as \"Small-World Model\" properly. We also propose a method to define the importance of AS and give a simple principle of IPv6 deployment. We even build \"6Stats Project\"[1] to provide data which help deploy IPv6.","PeriodicalId":202059,"journal":{"name":"2011 19th IEEE International Conference on Network Protocols","volume":"75 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":"127331774","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}
Pub Date : 2011-10-17DOI: 10.1109/ICNP.2011.6089074
Xiaoxiao Hou, P. Deshpande, Samir R Das
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.
{"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}
Pub Date : 2011-10-17DOI: 10.1109/ICNP.2011.6089046
Xin Zhang, Zongwei Zhou, Geoffrey Hasker, A. Perrig, V. Gligor
Clear evidence indicates the existence of compromised routers in ISP and enterprise networks. Fault localization (FL) protocols enable a network to localize specific links of compromised routers sabotaging network data delivery and are recognized as an essential means to enhancing network availability in the face of targeted attacks. However, theoretically proven lower bounds have shown that secure FL protocols in the current network infrastructure inevitably incur prohibitive overhead. We observe the current limits are due to a lack of trust relationships among network nodes. We demonstrate that we can achieve much higher FL efficiency by leveraging trusted computing technology to design a trusted network-layer architecture, Tru eN et, with a small Trusted Computing Base (TCB). We intend Tru e N e t to serve as a case study that demonstrates trusted computing's ability in yielding tangible and measurable benefits for secure network protocol designs.
{"title":"Network fault localization with small TCB","authors":"Xin Zhang, Zongwei Zhou, Geoffrey Hasker, A. Perrig, V. Gligor","doi":"10.1109/ICNP.2011.6089046","DOIUrl":"https://doi.org/10.1109/ICNP.2011.6089046","url":null,"abstract":"Clear evidence indicates the existence of compromised routers in ISP and enterprise networks. Fault localization (FL) protocols enable a network to localize specific links of compromised routers sabotaging network data delivery and are recognized as an essential means to enhancing network availability in the face of targeted attacks. However, theoretically proven lower bounds have shown that secure FL protocols in the current network infrastructure inevitably incur prohibitive overhead. We observe the current limits are due to a lack of trust relationships among network nodes. We demonstrate that we can achieve much higher FL efficiency by leveraging trusted computing technology to design a trusted network-layer architecture, Tru eN et, with a small Trusted Computing Base (TCB). We intend Tru e N e t to serve as a case study that demonstrates trusted computing's ability in yielding tangible and measurable benefits for secure network protocol designs.","PeriodicalId":202059,"journal":{"name":"2011 19th IEEE International Conference on Network Protocols","volume":"94 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":"122967399","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：