Email this article To demonstrate overlay routing using BPG routing, TCP improvement, and VOIP applications
Abstract
If we are just concerned in getting better routing properties among a single source node and a single destination, then the dilemma is not intricate, and judgment the optimal number of nodes becomes in significant because the probable contender for super impose assignment is diminutive, and in general any obligation would be superior. Nevertheless, when we regard as one-to-many or many-to-many circumstances, then a single overlay node could concern the lane possessions of many paths, and thus decide the best locations turn out to be much less insignificant. We thoroughly learn this optimization problem. We demonstrate that it is NP-hard and get a nontrivial approximation algorithm for it, where the approximation relation depends on exact properties of the difficulty at hand. We look at the sensible feature of the system by assess the increase one can get over some genuine scenarios.
References
H. Pucha and Y. C. Hu, “Overlay TCP: Multi-hop overlay transport for high throughput transfers in the Internet,” Purdue University, West Lafayette, IN, USA, Tech. Rep., 2005.
D. Andersen, H. Balakrishnan, F. Kaashoek, and R. Morris, “Resilient overlay networks,” in Proc. 18th ACM SOSP, 2001, pp. 131–145.
S. Savage, T. A. A. Aggarawl, T. Anderson, A. Aggarwal, D. Becker, N. Cardwell, A. Collins, E. Hoffman, J. Snell, A. Vahdat, G. Voelker, and J. Zahorjan, “Detour: A case for informed internet routing and transport,” IEEE Micro, vol. 19, no. 1, pp. 50–59, Jan.–Feb. 1999.
R. Cohen and A. Shochot, “The “global-ISP” paradigm,” Comput. Netw., vol. 51, no. 8, pp. 1908–1921, 2007.
L. Gao and F. Wang, “The extent of as path inflation by routing policies,” in Proc. IEEE GLOBECOM, 2002, vol. 3, pp. 2180–2184.
S. Savage, A. Collins, E. Hoffman, J. Snell, and T. Anderson, “The end-to-end effects of Internet path selection,” in Proc. ACM SIGCOMM, 1999, pp. 289–299.
R. Cohen and S. Ramanathan, “Using proxies to enhance TCP performance over hybrid fiber coaxial networks,” Comput. Commun., vol. 20, no. 16, pp. 1502–1518, Jan. 1998.
N. Spring, R. Mahajan, and T. Anderson, “The causes of path inflation,” in Proc. ACM SIGCOMM, 2003, pp. 113–124.
H. Tangmunarunkit, R. Govindan, S. Shenker, and D. Estrin, “The impact of routing policy on Internet paths,” in Proc. IEEE INFOCOM, 2001, pp. 736–742.
M. Cha, S. Moon, C.-D. Park, and A. Shaikh, “Placing relay nodes for intra-domain path diversity,” in Proc. IEEE INFOCOM, Apr. 2006, pp. 1–12.
M. Kodialam, T. V. Lakshman, and S. Sengupta, “Efficient and robust routing of highly variable traffic,” in Proc. HotNets III, 2004.
S. Roy, H. Pucha, Z. Zhang, Y. C. Hu, and L. Qiu, “On the placement of infrastructure overlay nodes,” IEEE/ACM Trans. Netw., vol. 17, no. 4, pp. 1298–1311, Aug. 2009.
L. Qiu, V. N. Padmanabhan, and G. M. Voelker, “On the placement of Web server replicas,” in Proc. IEEE INFOCOM, 2001, vol. 3, pp. 1587–1596.
E. Cronin, S. Jamin, C. Jin, A. R. Kurc, D. Raz, and Y. Shavitt, “Constrained mirror placement on the Internet,” in Proc. IEEE INFOCOM, 2001, vol. 1, pp. 31–40.
M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco, CA, USA: Freeman, 1979.
Refbacks
- There are currently no refbacks.
Copyright © 2013, All rights reserved.| ijseat.com
International Journal of Science Engineering and Advance Technology is licensed under a Creative Commons Attribution 3.0 Unported License.Based on a work at IJSEat , Permissions beyond the scope of this license may be available at http://creativecommons.org/licenses/by/3.0/deed.en_GB.