On the Placement of Infrastructure Overlay Nodes

@article{Roy2009OnTP,
  title={On the Placement of Infrastructure Overlay Nodes},
  author={S. Roy and H. Pucha and Zheng Zhang and Y. C. Hu and L. Qiu},
  journal={IEEE/ACM Transactions on Networking},
  year={2009},
  volume={17},
  pages={1298-1311}
}
  • S. Roy, H. Pucha, +2 authors L. Qiu
  • Published 2009
  • Computer Science
  • IEEE/ACM Transactions on Networking
Overlay routing has emerged as a promising approach to improving performance and reliability of Internet paths. To fully realize the potential of overlay routing under the constraints of deployment costs in terms of hardware, network connectivity and human effort, it is critical to carefully place infrastructure overlay nodes to balance the tradeoff between performance and resource constraints. In this paper, we investigate approaches to perform intelligent placement of overlay nodes to… Expand
Optimum Resource Allocation of Overlay Routing Relay Nodes in Cost-Effective Basis
Networks operating on the inter-domain level are Overlay Networks. An overlay network is a computer network, which is built on the top of another network. Nodes in the overlay can be thought of asExpand
Cost-Effective Resource Allocation of Overlay Routing Relay Nodes
TLDR
It is demonstrated that the BGP routing scheme is NP-hard and derive a nontrivial approximation algorithm for it, where the approximation ratio depends on specific properties of the problem at hand. Expand
Resource Allocation of Overlay Routing Relay Nodes in Cost Effective Approach
TLDR
It is shown that this optimization problem is NP-hard and derive a nontrivial approximation algorithm for it, where the approximation ratio depends on specific properties of the problem at hand. Expand
Cost effective resource allocation of overlay routing relay nodes
TLDR
It is shown that this optimization problem for overlay routing is NP hard and derive a non-trivial approximation algorithm for it, where the approximation ratio depends on specific properties of the problem at hand. Expand
Achieving effective resilience for QoS-aware application mapping
TLDR
This paper investigates how to provide effective resilience for a QoS-aware overlay mapping so as to make the mapped applications resilient against substrate network failure(s) whilst providing enhanced QoS. Expand
Load-Balanced One-hop Overlay Multipath Routing with Path Diversity
TLDR
Simulations based on a real ISP network and a synthetic Internet topology show that the proposed LB-OOMR algorithm can reduce the network congestion ratio dramatically, and achieve high-quality overlay routing service. Expand
Overlay routing network construction by introducing Super-Relay nodes
TLDR
This work proposes an overlay routing network constructing method that addresses K-Minimum Spanning Tree with Super-Relay nodes algorithm (SR-KMST), and concludes that this approach can provide high-quality overlay routing service, and achieve better robustness by comparing with other algorithms. Expand
Development of a Nontrivial Approximation Algorithm to resolve Optimization Problem of Overlay Routing Resource Allocation
TLDR
This research paper focuses on the minimum number of infrastructure nodes that need to be added in order to maintain a specific property in the overlay routing, and presents a nontrivial approximation algorithm for it. Expand
Understanding the Performance and Bottlenecks of Cloud-Routed Overlay Networks: A Case Study
TLDR
It is shown that a TCP overlay, built on a cloud service provider infrastructure, can provide up to 184% improvement in bandwidth for downloads, and 228% improvement for uploads, and it is found that in the cloud overlay network, the limiting bottleneck in network performance is actually not the overlay itself, but the Internet path to get to the overlay. Expand
Cost-Effective Support Sharing of Overlay Routing Relay Nodes
TLDR
The plan is exceptionally helpful for TCP execution change and for Voice-over-IP (VoIP) applications where a little number of overlay hubs can essentially lessen the maximal distributed deferral. Expand
...
1
2
3
4
...

References

SHOWING 1-10 OF 30 REFERENCES
Overlay Node Placement: Analysis, Algorithms and Impact on Applications
TLDR
This paper investigates approaches to perform intelligent placement of overlay nodes to facilitate resilient routing and TCP performance improvement, and develops several placement algorithms, which offer a wide range of trade-offs in complexity and required knowledge of the client- server location and traffic load. Expand
Topology aware overlay networks
  • J. Han, David Watson, F. Jahanian
  • Computer Science
  • Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.
  • 2005
TLDR
This paper proposes a novel framework for topology-aware overlay networks, aiming to maximize path independence without degrading performance, and develops measurement-based heuristics for placement of overlay nodes inside an ISP and selection of a set of ISPs that conclude that single-hop overlay routing performs as well as multi-hop routing with respect to both availability and performance. Expand
Placing Servers in Overlay Networks
TLDR
The problem of how to optimally place service nodes in a network is studied, balancing the need to minimize the number of nodes, while limiting the distance between users and service nodes, and the design problem is NP-hard. Expand
Enhancing end-to-end availability and performance via topology-aware overlay networks
TLDR
A novel overlay architecture to improve availability and performance of end-to-end communication over the Internet and validate the proposed framework using real Internet outages to show that the architecture is able to provide a significant amount of resilience to real-world failures. Expand
Improving the Reliability of Internet Paths with One-hop Source Routing
TLDR
This research demonstrates that one-hop source routing is easy to implement, adds negligible overhead, and achieves close to the maximum benefit available to indirect routing schemes, without the need for path monitoring, history, or a-priori knowledge of any kind. Expand
On the placement of Web server replicas
  • L. Qiu, V. Padmanabhan, G. Voelker
  • Computer Science
  • Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213)
  • 2001
TLDR
This work develops several placement algorithms that use workload information, such as client latency and request rates, to make informed placement decisions, and evaluates the placement algorithms using both synthetic and real network topologies, as well as Web server traces. Expand
Topology-informed Internet replica placement
TLDR
It is found that topology-informed replica placement methods can achieve average client latencies which are within a factor of 1.1-1.2 of the greedy algorithm, but only if the placement method is designed carefully. Expand
Do We Need Replica Placement Algorithms in Content Delivery Networks
TLDR
It is concluded that a simple delayed-LRU caching scheme outperforms, or at least performs as well as the best replica placement algorithms, and is clearly the preferred option. Expand
The cache location problem
TLDR
There is a surprising consistency over time in the relative amount of web traffic from the server along a path, lending a stability to the TERC location solution and these techniques can be used by network providers to reduce traffic load in their network. Expand
Proxy location problems and their generalizations
  • Sumi Choi, Y. Shavitt
  • Computer Science
  • 23rd International Conference on Distributed Computing Systems Workshops, 2003. Proceedings.
  • 2003
TLDR
The proxy is viewed as a service and generalize the problem of optimally placing proxies to optimally placed any service in the network to study in a unified framework the location problems related to active networks, overlay peer-to-peer networks, as well as, CDNs and caching. Expand
...
1
2
3
...