Using proxies to enhance TCP performance over hybrid fiber coaxial networks

Cohen, Reuven; Ramanathan, S.

doi:10.1016/s0140-3664(97)00160-6

Cited by 16 publications

(5 citation statements)

References 11 publications

(18 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…They showed that in 30%-80% of the cases, there is an alternate routing path with better quality compared to the default routing path. In [7] and later in [1], the authors show that TCP performance is strictly affected by the RTT. Thus, breaking a TCP connection into low-latency sub connections improves the overall connection performance.…”

Section: Literature Surveymentioning

confidence: 99%

Improved Routing Metric In The Overlay Routing Delay Nodes

Wasnik¹

2017

ijecs

View full text Add to dashboard Cite

Abstract-Overlay routing is a very attractive scheme that allows improving certain properties of the routing (such as delay or TCP throughput) without the need to change the standards of the current underlying routing. However, deploying overlay routing requires the placement and maintenance of overlay infrastructure. This gives rise to the following optimization problem: Find a minimal set of overlay nodes such that the required routing properties are satisfied. In this paper, we rigorously study this optimization problem. We show that it is NP-hard and derive a nontrivial approximation algorithm for it, where the approximation ratio depends on specific properties of the problem at hand. We examine the practical aspects of the scheme by evaluating the gain one can get over several real scenarios. The first one is BGP routing, and we show, using up-to-date data reflecting the current BGP routing policy in the Internet, that a relative small number of less than 100 relay servers is sufficient to enable routing over shortest paths from a single source to all autonomous systems (ASs), reducing the average path length of inflated paths by 40%. We also demonstrate that the scheme is very useful for TCP performance improvement (results in an almost optimal placement of overlay nodes) and for Voice-over-IP (VoIP) applications where a small number of overlay nodes can significantly reduce the maximal peer-to-peer delay.

show abstract

Section: Literature Surveymentioning

confidence: 99%

Improved Routing Metric In The Overlay Routing Delay Nodes

Wasnik¹

2017

ijecs

View full text Add to dashboard Cite

show abstract

“…They showed that in 30%-80% of the cases, there is an alternate routing path with better quality compared to the default routing path. In [6] and later in [1] the authors show that TCP performance is strictly affected by the Routd-Trip-Time (RTT). Thus, breaking a TCP connection into low latency sub connections improves the overall connection performance.…”

Section: Related Workmentioning

confidence: 99%

“…Deploying relay nodes on v 6 and v 7 implies that packets from s 1 to t 1 can be routed through the concatenation of the following underlay paths (…”

Section: Model and Problem Definitionmentioning

confidence: 99%

“…, and (v 7 , t 1 ) while packets from s 2 to t 2 can be routed through the concatenation of the following underlay paths (s 2 , v 6 ), 6 , v 7 } is a feasible solution to the corresponding ORRA problem. If all the nodes have an equal weight (i.e.…”

Section: Model and Problem Definitionmentioning

confidence: 99%

“…Using overlay routing to improve TCP performance has been studied in several works in recent years [6], [1]. In particular, the TCP protocol is sensitive to delay, and there is a strict correlation between TCP throughput and the RoundTrip-Time (RTT).…”

Section: B Tcp Throughputmentioning

confidence: 99%

See 2 more Smart Citations

Cost effective resource allocation of overlay routing relay nodes

Cohen

Raz

2011

2011 Proceedings IEEE INFOCOM

View full text Add to dashboard Cite

Overlay routing in a very attractive scheme that allows improving certain properties of the routing without the need to change the standards of the current underlying routing. However, deploying overlay routing requires the placement and maintenance of overlay infrastructure. This gives rise to the following optimization problem: find a minimal set of overlay nodes such that the required routing properties are satisfied.In this paper we rigorously study this optimization problem. We show that it 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. We examine the practical aspects of the scheme by evaluating the gain one can get over two real scenarios. The first one is BGP routing, and we show, using up-to-date data reflecting the current BGP routing policy in the Internet, that a relative small number of less than 100 relay servers are sufficient to enable routing over shorter paths from a single source to all ASes, reducing the average path length of inflated paths by 40%. We also demonstrate that using the scheme for TCP performance improvement, results in an almost optimal placement of overlay nodes.

show abstract