Pub Date : 2005-03-13DOI: 10.1109/INFCOM.2005.1498489
S. Yuen, Baochun Li
In overlay multicast, every end host forwards multicast data to other end hosts in order to disseminate data. However, this cooperative behavior cannot be taken for granted, since each overlay node is now a strategic end host. Ideally, a strategyproof mechanism should be provided to motivate cooperations among overlay nodes so that a mutually beneficial multicast tree topology results. In this paper, we apply mechanism design to the overlay multicast problem. We model the overlay network using the two scenarios of variable and single rate sessions, and further design distributed algorithms that motivate each node towards a better multicast tree. Since network parameters and constraints change dynamically in reality, our protocol dynamically adapts to form a better multicast tree. The correctness and performance of each distributed algorithm are verified by extensive implementation results on PlanetLab.
{"title":"Strategyproof mechanisms for dynamic tree formation in overlay networks","authors":"S. Yuen, Baochun Li","doi":"10.1109/INFCOM.2005.1498489","DOIUrl":"https://doi.org/10.1109/INFCOM.2005.1498489","url":null,"abstract":"In overlay multicast, every end host forwards multicast data to other end hosts in order to disseminate data. However, this cooperative behavior cannot be taken for granted, since each overlay node is now a strategic end host. Ideally, a strategyproof mechanism should be provided to motivate cooperations among overlay nodes so that a mutually beneficial multicast tree topology results. In this paper, we apply mechanism design to the overlay multicast problem. We model the overlay network using the two scenarios of variable and single rate sessions, and further design distributed algorithms that motivate each node towards a better multicast tree. Since network parameters and constraints change dynamically in reality, our protocol dynamically adapts to form a better multicast tree. The correctness and performance of each distributed algorithm are verified by extensive implementation results on PlanetLab.","PeriodicalId":20482,"journal":{"name":"Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.","volume":"1 1","pages":"2135-2146 vol. 3"},"PeriodicalIF":0.0,"publicationDate":"2005-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83229484","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 : 2005-03-13DOI: 10.1109/INFCOM.2005.1497908
A. Zemlianov, G. Veciana
In this paper we investigate network design for a wireless service provider using two orthogonal technologies: a WAN technology with uniform spatial coverage and set of LAN access points each with limited coverage. We assume that the system is designed so that users (or their agents) independently and greedily select among the two options based on maximizing a specified utility function which may be a function of the quality of the wireless link, distance to the access points, and/or congestion on system resources. We focus on two complementary aspects of this problem. On the one hand we study system performance under such decision-making strategies. We show convergence of decision-making process to an equilibrium, and that a congestion-sensitive utility can provide substantial (300%) performance improvements over natural proximity-based criterion. On the other hand, we consider various problems associated with dimensioning typically expensive backhaul links, for the WAN and set of LAN hotspots. Our results show how to best jointly exploit technologies with different coverage scales so as to statistically multiplex spatial load fluctuations in order to reduce backhaul costs.
{"title":"Cooperation and decision-making in a wireless multi-provider setting","authors":"A. Zemlianov, G. Veciana","doi":"10.1109/INFCOM.2005.1497908","DOIUrl":"https://doi.org/10.1109/INFCOM.2005.1497908","url":null,"abstract":"In this paper we investigate network design for a wireless service provider using two orthogonal technologies: a WAN technology with uniform spatial coverage and set of LAN access points each with limited coverage. We assume that the system is designed so that users (or their agents) independently and greedily select among the two options based on maximizing a specified utility function which may be a function of the quality of the wireless link, distance to the access points, and/or congestion on system resources. We focus on two complementary aspects of this problem. On the one hand we study system performance under such decision-making strategies. We show convergence of decision-making process to an equilibrium, and that a congestion-sensitive utility can provide substantial (300%) performance improvements over natural proximity-based criterion. On the other hand, we consider various problems associated with dimensioning typically expensive backhaul links, for the WAN and set of LAN hotspots. Our results show how to best jointly exploit technologies with different coverage scales so as to statistically multiplex spatial load fluctuations in order to reduce backhaul costs.","PeriodicalId":20482,"journal":{"name":"Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.","volume":"6 1","pages":"386-397 vol. 1"},"PeriodicalIF":0.0,"publicationDate":"2005-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72938866","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 : 2005-03-13DOI: 10.1109/INFCOM.2005.1497883
A. Behzad, I. Rubin
An ad hoc wireless network with n nodes and m source-destination pairs, using a scheduling based medium access control (MAC) protocol such as time division multiple access (TDMA), and a routing mechanism that may be unicast or multicast based, is considered. Under a given nodal transmit power vector, we define the source-destination throughput vector to be achievable if there exists an associated temporal (based on the channel sharing MAC protocol) and spatial (based on the underlying routing mechanism) joint scheduling-routing scheme that yields the throughput vector. In this paper, we analyze and investigate the effect of nodal transmit power vector on the maximum (or supreme) level of a general (real-valued) function of the source-destination throughput levels. We represent the latter supreme level attained under power vector. We also derive a linear programming (LP) formulation for obtaining the exact solution to the optimization problem that yields the throughput capacity of finite ad hoc wireless networks. Our LP based performance evaluation results identify the magnitude of capacity upgrade that can be realized for networks with random topologies and traffic patterns.
{"title":"Impact of power control on the performance of ad hoc wireless networks","authors":"A. Behzad, I. Rubin","doi":"10.1109/INFCOM.2005.1497883","DOIUrl":"https://doi.org/10.1109/INFCOM.2005.1497883","url":null,"abstract":"An ad hoc wireless network with n nodes and m source-destination pairs, using a scheduling based medium access control (MAC) protocol such as time division multiple access (TDMA), and a routing mechanism that may be unicast or multicast based, is considered. Under a given nodal transmit power vector, we define the source-destination throughput vector to be achievable if there exists an associated temporal (based on the channel sharing MAC protocol) and spatial (based on the underlying routing mechanism) joint scheduling-routing scheme that yields the throughput vector. In this paper, we analyze and investigate the effect of nodal transmit power vector on the maximum (or supreme) level of a general (real-valued) function of the source-destination throughput levels. We represent the latter supreme level attained under power vector. We also derive a linear programming (LP) formulation for obtaining the exact solution to the optimization problem that yields the throughput capacity of finite ad hoc wireless networks. Our LP based performance evaluation results identify the magnitude of capacity upgrade that can be realized for networks with random topologies and traffic patterns.","PeriodicalId":20482,"journal":{"name":"Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.","volume":"409 1","pages":"102-113 vol. 1"},"PeriodicalIF":0.0,"publicationDate":"2005-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77125963","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 : 2005-03-13DOI: 10.1109/INFCOM.2005.1498535
Sudarshan Vasudevan, J. Kurose, D. Towsley
We consider the problem of neighbor discovery in static wireless ad hoc networks with directional antennas. We propose several probabilistic algorithms in which nodes perform random, independent transmissions to discover their one-hop neighbors. Our neighbor discovery algorithms are classified into two groups, viz. Direct-Discovery Algorithms in which nodes discover their neighbors only upon receiving a transmission from their neighbors and Gossip-based algorithms in which nodes gossip about their neighbors' location information to enable faster discovery. We first consider the operation of these algorithms in a slotted, synchronous system and mathematically derive their optimal parameter settings. We show how to extend these algorithms for an asynchronous system and describe their optimal design. Analysis and simulation of the algorithms show that nodes discover their neighbors much faster using gossip-based algorithms than using direct-discovery algorithms. Furthermore, the performance of gossip-based algorithms is insensitive to an increase in node density. The efficiency of a neighbor discovery algorithm also depends on the choice of antenna beamwidth. We discuss in detail how the choice of beamwidth impacts the performance of the discovery process and provide insights into how nodes can configure their beamwidths.
{"title":"On neighbor discovery in wireless networks with directional antennas","authors":"Sudarshan Vasudevan, J. Kurose, D. Towsley","doi":"10.1109/INFCOM.2005.1498535","DOIUrl":"https://doi.org/10.1109/INFCOM.2005.1498535","url":null,"abstract":"We consider the problem of neighbor discovery in static wireless ad hoc networks with directional antennas. We propose several probabilistic algorithms in which nodes perform random, independent transmissions to discover their one-hop neighbors. Our neighbor discovery algorithms are classified into two groups, viz. Direct-Discovery Algorithms in which nodes discover their neighbors only upon receiving a transmission from their neighbors and Gossip-based algorithms in which nodes gossip about their neighbors' location information to enable faster discovery. We first consider the operation of these algorithms in a slotted, synchronous system and mathematically derive their optimal parameter settings. We show how to extend these algorithms for an asynchronous system and describe their optimal design. Analysis and simulation of the algorithms show that nodes discover their neighbors much faster using gossip-based algorithms than using direct-discovery algorithms. Furthermore, the performance of gossip-based algorithms is insensitive to an increase in node density. The efficiency of a neighbor discovery algorithm also depends on the choice of antenna beamwidth. We discuss in detail how the choice of beamwidth impacts the performance of the discovery process and provide insights into how nodes can configure their beamwidths.","PeriodicalId":20482,"journal":{"name":"Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.","volume":"16 1","pages":"2502-2512 vol. 4"},"PeriodicalIF":0.0,"publicationDate":"2005-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85440349","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 : 2005-03-13DOI: 10.1109/INFCOM.2005.1497927
Chun Zhang, Yong Liu, W. Gong, J. Kurose, R. Moll, D. Towsley
Routing optimization is used to find a set of routes that minimizes cost (delay, utilization). Previous work has addressed this problem for the case of a known, static end-to-end traffic matrix. In the Internet, it is difficult to accurately estimate a traffic matrix, and the constantly changing nature of Internet traffic makes it costly to maintain optimal routing by responding to traffic changes. Thus, it is of interest to maintain a set of routes that are "good" for a number of different possible traffic scenarios. In this paper, we explore ways to find an optimal set of routes with multiple traffic matrices to minimize expected cost. We focus on two general approaches, source-destination routing and destination routing. In the case of source-destination routing, we extend existing methods with a single traffic matrix to solve the optimization problem with multiple traffic matrices: we extend the convex optimization solution methods for a single traffic matrix to the multiple traffic matrix case; we also extend the gradient-based solution methods for a single traffic matrix to the multiple traffic matrix case. However, the multiple traffic matrix case requires many more control variables. In the case of destination routing, we encounter many more differences from the single traffic matrix case. The loop-free property, which is valid for the single traffic matrix case, is no longer valid for the multiple traffic matrix case, and it is difficult to extend existing methods for a single traffic matrix to solve the optimization problem with multiple traffic matrices. We show that it is NP-complete even to determine the feasibility of multiple traffic matrices. We thus propose and evaluate a heuristic algorithm for this case.
{"title":"On optimal routing with multiple traffic matrices","authors":"Chun Zhang, Yong Liu, W. Gong, J. Kurose, R. Moll, D. Towsley","doi":"10.1109/INFCOM.2005.1497927","DOIUrl":"https://doi.org/10.1109/INFCOM.2005.1497927","url":null,"abstract":"Routing optimization is used to find a set of routes that minimizes cost (delay, utilization). Previous work has addressed this problem for the case of a known, static end-to-end traffic matrix. In the Internet, it is difficult to accurately estimate a traffic matrix, and the constantly changing nature of Internet traffic makes it costly to maintain optimal routing by responding to traffic changes. Thus, it is of interest to maintain a set of routes that are \"good\" for a number of different possible traffic scenarios. In this paper, we explore ways to find an optimal set of routes with multiple traffic matrices to minimize expected cost. We focus on two general approaches, source-destination routing and destination routing. In the case of source-destination routing, we extend existing methods with a single traffic matrix to solve the optimization problem with multiple traffic matrices: we extend the convex optimization solution methods for a single traffic matrix to the multiple traffic matrix case; we also extend the gradient-based solution methods for a single traffic matrix to the multiple traffic matrix case. However, the multiple traffic matrix case requires many more control variables. In the case of destination routing, we encounter many more differences from the single traffic matrix case. The loop-free property, which is valid for the single traffic matrix case, is no longer valid for the multiple traffic matrix case, and it is difficult to extend existing methods for a single traffic matrix to solve the optimization problem with multiple traffic matrices. We show that it is NP-complete even to determine the feasibility of multiple traffic matrices. We thus propose and evaluate a heuristic algorithm for this case.","PeriodicalId":20482,"journal":{"name":"Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.","volume":"60 1","pages":"607-618 vol. 1"},"PeriodicalIF":0.0,"publicationDate":"2005-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84842870","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 : 2005-03-13DOI: 10.1109/INFCOM.2005.1497873
Godfrey Tan, J. Guttag
Wireless local area networks (WLANs) based on the family of 802.11 technologies are becoming ubiquitous. These technologies support multiple data transmission rates. Transmitting at a lower data rate (by using a more resilient modulation scheme) increases the frame transmission time but reduces the hit error rate. In non-cooperative environments such as public hot-spots or WLANs operated by different enterprises that are physically close to each other, individual nodes attempt to maximize their achieved throughput by adjusting the data rate or frame size used, irrespective of the impact of this on overall system performance. In this paper, we show both analytically using a game theoretic model and through simulation that the existing 802.11 distributed MAC protocol, DCF (for distributed coordination function), as well as its enhanced version, which is being standardized at part of 802.11e, can lead non-cooperative nodes to undesirable Nash equilibriums, in which the wireless channel is inefficiently used. We show that by establishing independence between the allocation of the shared channel resource and the transmission strategies used by individual nodes, an ideal MAC protocol can lead rational nodes to arrive at equilibriums in which all competing nodes achieve higher throughputs tan with DCF.
{"title":"The 802.11 MAC protocol leads to inefficient equilibria","authors":"Godfrey Tan, J. Guttag","doi":"10.1109/INFCOM.2005.1497873","DOIUrl":"https://doi.org/10.1109/INFCOM.2005.1497873","url":null,"abstract":"Wireless local area networks (WLANs) based on the family of 802.11 technologies are becoming ubiquitous. These technologies support multiple data transmission rates. Transmitting at a lower data rate (by using a more resilient modulation scheme) increases the frame transmission time but reduces the hit error rate. In non-cooperative environments such as public hot-spots or WLANs operated by different enterprises that are physically close to each other, individual nodes attempt to maximize their achieved throughput by adjusting the data rate or frame size used, irrespective of the impact of this on overall system performance. In this paper, we show both analytically using a game theoretic model and through simulation that the existing 802.11 distributed MAC protocol, DCF (for distributed coordination function), as well as its enhanced version, which is being standardized at part of 802.11e, can lead non-cooperative nodes to undesirable Nash equilibriums, in which the wireless channel is inefficiently used. We show that by establishing independence between the allocation of the shared channel resource and the transmission strategies used by individual nodes, an ideal MAC protocol can lead rational nodes to arrive at equilibriums in which all competing nodes achieve higher throughputs tan with DCF.","PeriodicalId":20482,"journal":{"name":"Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.","volume":"41 1","pages":"1-11 vol. 1"},"PeriodicalIF":0.0,"publicationDate":"2005-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85122790","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 : 2005-03-13DOI: 10.1109/INFCOM.2005.1498445
F. Baccelli, A. Chaintreau, Zhen Liu, A. Riabov
We consider reliable multicast in overlay networks where nodes have finite-size buffers and are subject to failures. We address issues of end-to-end reliability and throughput scalability in this framework. We propose a simple architecture which consists of using distinct point-to-point TCP connections between adjacent pairs of end-systems, together with a back-pressure control mechanism regulating the transfers of adjacent TCP connections, as well as a back-up buffering system handling node failures. This architecture, that we call the one-to-many TCP overlay, is a natural extension of TCP to the one-to-many case, in that it adapts the rate of the group communication to local congestion in a decentralized way via the window back-pressure mechanism. Using theoretical investigations, experimentations in the Internet, and large network simulations, we show that this architecture provides end-to-end reliability and can tolerate multiple simultaneous node failures, provided the backup buffers are sized appropriately. We also show that under random perturbations caused by cross traffic described in the paper, the throughput of this reliable group communication is always larger than a positive constant, that does not depend on the group size. This scalability result contrasts with known results about the non-scalability of IP-supported multicast for reliable group communication.
{"title":"The one-to-many TCP overlay: a scalable and reliable multicast architecture","authors":"F. Baccelli, A. Chaintreau, Zhen Liu, A. Riabov","doi":"10.1109/INFCOM.2005.1498445","DOIUrl":"https://doi.org/10.1109/INFCOM.2005.1498445","url":null,"abstract":"We consider reliable multicast in overlay networks where nodes have finite-size buffers and are subject to failures. We address issues of end-to-end reliability and throughput scalability in this framework. We propose a simple architecture which consists of using distinct point-to-point TCP connections between adjacent pairs of end-systems, together with a back-pressure control mechanism regulating the transfers of adjacent TCP connections, as well as a back-up buffering system handling node failures. This architecture, that we call the one-to-many TCP overlay, is a natural extension of TCP to the one-to-many case, in that it adapts the rate of the group communication to local congestion in a decentralized way via the window back-pressure mechanism. Using theoretical investigations, experimentations in the Internet, and large network simulations, we show that this architecture provides end-to-end reliability and can tolerate multiple simultaneous node failures, provided the backup buffers are sized appropriately. We also show that under random perturbations caused by cross traffic described in the paper, the throughput of this reliable group communication is always larger than a positive constant, that does not depend on the group size. This scalability result contrasts with known results about the non-scalability of IP-supported multicast for reliable group communication.","PeriodicalId":20482,"journal":{"name":"Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.","volume":"39 1","pages":"1629-1640 vol. 3"},"PeriodicalIF":0.0,"publicationDate":"2005-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85364816","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 : 2005-03-13DOI: 10.1109/INFCOM.2005.1498520
J. Chandrashekar, Z. Duan, Zhi-Li Zhang, Jeffrey Krasky
Slow convergence in the Internet can be directly attributed to the "path exploration" phenomenon, inherent in all path vector protocols. The root cause for path exploration is the dependency among paths propagated through the network. Addressing this problem in BGP is particularly difficult as the AS paths exchanged between BGP routers are highly summarized. In this paper, we describe why path exploration cannot be countered effectively within the existing BGP framework, and propose a simple, novel mechanism - forward edge sequence numbers - to annotate the AS paths with additional "path dependency" information. We then develop an enhanced path vector algorithm, EPIC, shown to limit path exploration and lead to faster convergence. In contrast to other solutions, ours is shown to be correct on a very general model of Internet topology and BGP operation. Using theoretical analysis and simulations, we demonstrate that EPIC can achieve a dramatic improvement in routing convergence, compared to BGP and other existing solutions.
{"title":"Limiting path exploration in BGP","authors":"J. Chandrashekar, Z. Duan, Zhi-Li Zhang, Jeffrey Krasky","doi":"10.1109/INFCOM.2005.1498520","DOIUrl":"https://doi.org/10.1109/INFCOM.2005.1498520","url":null,"abstract":"Slow convergence in the Internet can be directly attributed to the \"path exploration\" phenomenon, inherent in all path vector protocols. The root cause for path exploration is the dependency among paths propagated through the network. Addressing this problem in BGP is particularly difficult as the AS paths exchanged between BGP routers are highly summarized. In this paper, we describe why path exploration cannot be countered effectively within the existing BGP framework, and propose a simple, novel mechanism - forward edge sequence numbers - to annotate the AS paths with additional \"path dependency\" information. We then develop an enhanced path vector algorithm, EPIC, shown to limit path exploration and lead to faster convergence. In contrast to other solutions, ours is shown to be correct on a very general model of Internet topology and BGP operation. Using theoretical analysis and simulations, we demonstrate that EPIC can achieve a dramatic improvement in routing convergence, compared to BGP and other existing solutions.","PeriodicalId":20482,"journal":{"name":"Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.","volume":"12 1","pages":"2337-2348 vol. 4"},"PeriodicalIF":0.0,"publicationDate":"2005-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84436825","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 : 2005-03-13DOI: 10.1109/INFCOM.2005.1498342
Ming Zhong, Kai Shen, J. Seiferas
Existing random membership management algorithms provide each node with a small, uniformly random subset of global participants. However, many applications would benefit more from non-uniform random member subsets. For instance, non-uniform gossip algorithms can provide distance-based propagation bounds and thus information can reach nearby nodes sooner. In another example, Kleinberg shows that networks with random long-links following distance-based non-uniform distributions exhibit better routing performance than those with uniformly randomized topologies. In this paper, we propose a scalable non-uniform random membership management algorithm, which provides each node with a random membership subset with application-specified probability e.g., with probability inversely proportional to distances. Our algorithm is the first non-uniform random membership management algorithm with proved convergence and bounded convergence time. Moreover, our algorithm does not put specific restrictions on the network topologies and thus has wide applicability.
{"title":"Non-uniform random membership management in peer-to-peer networks","authors":"Ming Zhong, Kai Shen, J. Seiferas","doi":"10.1109/INFCOM.2005.1498342","DOIUrl":"https://doi.org/10.1109/INFCOM.2005.1498342","url":null,"abstract":"Existing random membership management algorithms provide each node with a small, uniformly random subset of global participants. However, many applications would benefit more from non-uniform random member subsets. For instance, non-uniform gossip algorithms can provide distance-based propagation bounds and thus information can reach nearby nodes sooner. In another example, Kleinberg shows that networks with random long-links following distance-based non-uniform distributions exhibit better routing performance than those with uniformly randomized topologies. In this paper, we propose a scalable non-uniform random membership management algorithm, which provides each node with a random membership subset with application-specified probability e.g., with probability inversely proportional to distances. Our algorithm is the first non-uniform random membership management algorithm with proved convergence and bounded convergence time. Moreover, our algorithm does not put specific restrictions on the network topologies and thus has wide applicability.","PeriodicalId":20482,"journal":{"name":"Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.","volume":"18 1","pages":"1151-1161 vol. 2"},"PeriodicalIF":0.0,"publicationDate":"2005-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88337590","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 : 2005-03-13DOI: 10.1109/INFCOM.2005.1498333
P. Risbood, S. Acharya, B. Gupta
Service providers are starting to offer next-generation E-Line (point-to-point) and E-LAN (multipoint-to-multipoint) Ethernet services over their existing SONET/SDH networks. While Ethernet typically is "best-effort", these emerging services are expected to be "carrier-class" with strict bandwidth guarantees. Consequently, spanning tree creation, critical to any Ethernet network is fundamentally changed; each tree hop now needs to have sufficient capacity to meet the requisite bandwidth demands. In this paper, we introduce the bandwidth-endowed spanning tree (BEST) problem. Unlike the polynomial complexity of standard spanning tree algorithms, BEST is NP-complete, raising questions about the scalability of these services. We propose offline and online algorithms and study their performance using extensive simulations. We show that leveraging the Virtual Concatenation protocol (ITU-T G.707) is key to practical algorithms that are both effective and efficient. Inspite of the theoretical hardness, the online algorithms we propose are a good match to "optimal", offline integer programming benchmarks, demonstrating the viability of next-generation Ethernet services.
{"title":"The BEST challenge for next-generation Ethernet services","authors":"P. Risbood, S. Acharya, B. Gupta","doi":"10.1109/INFCOM.2005.1498333","DOIUrl":"https://doi.org/10.1109/INFCOM.2005.1498333","url":null,"abstract":"Service providers are starting to offer next-generation E-Line (point-to-point) and E-LAN (multipoint-to-multipoint) Ethernet services over their existing SONET/SDH networks. While Ethernet typically is \"best-effort\", these emerging services are expected to be \"carrier-class\" with strict bandwidth guarantees. Consequently, spanning tree creation, critical to any Ethernet network is fundamentally changed; each tree hop now needs to have sufficient capacity to meet the requisite bandwidth demands. In this paper, we introduce the bandwidth-endowed spanning tree (BEST) problem. Unlike the polynomial complexity of standard spanning tree algorithms, BEST is NP-complete, raising questions about the scalability of these services. We propose offline and online algorithms and study their performance using extensive simulations. We show that leveraging the Virtual Concatenation protocol (ITU-T G.707) is key to practical algorithms that are both effective and efficient. Inspite of the theoretical hardness, the online algorithms we propose are a good match to \"optimal\", offline integer programming benchmarks, demonstrating the viability of next-generation Ethernet services.","PeriodicalId":20482,"journal":{"name":"Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.","volume":"27 1","pages":"1049-1059 vol. 2"},"PeriodicalIF":0.0,"publicationDate":"2005-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89368332","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
扫码关注我们
求助内容：
应助结果提醒方式：