Academia.eduAcademia.edu

Outline

Title
Introduction
Inefficiencies of Transport Protocol
Application and Protocol Barriers
Data Deduplication
Protocol Optimization
Conclusion
References
All Topics
Computer Science
Computer Networks

On Wide Area Network Optimization

Profile image of Nirwan AnsariNirwan Ansari

2012, IEEE Communications Surveys & Tutorials

https://doi.org/10.1109/SURV.2011.092311.00071
visibility

…

description

24 pages

link

1 file

Related papers

A Comparative Analysis of WAN Emulators
Eric Gamess

Proceedings of the 7th Latin American Networking Conference (LANC 2012), 2012

Testing network applications and protocols in a real WAN environment can be difficult and complex due to costs and distances. Therefore, many researchers and developers use network simulation or controlled testbeds where the WAN is emulated over cheap and widely spread LAN technologies such as Ethernet. In this paper, we present an up-to-date survey of WAN emulation tools. We discuss their main characteristics and the network parameters they allow to setup and modify. We also present the results of some experiments we conducted with the tools, using both IPv4 and IPv6 traffic, in order to verify their accuracy and analyze the results obtained.

View PDFchevron_right
Scalable Bulk Data Transfer in Wide Area Networks
Jameela Al-jaroodi

International Journal of High Performance Computing Applications, 2003

Bulk data transfer in wide area networks (WAN) requires scalable and high network bandwidth. In this paper, we identify a number of the scalability limitations that affect the full utilization of peak theoretical network bandwidth. In addition, we study and classify different offered approaches to overcome some of the identified limitations and increase network bandwidth among Grid components in WAN. With these limitations in mind, we study and evaluate the scalability and flexibility of a UDP-based multiple-network-interface socket (MuniSocket) model in WAN. The MuniSocket model is a middleware layer between the distributed applications and the multiple networks and system resources available. MuniSocket utilizes existing system resources, network interface cards, and network links to provide a scalable, reliable and high bandwidth network solution for data-intensive distributed applications, thus eliminating most of the identified limitations.

View PDFchevron_right
Benefits and Challenges of Distributing Multimedia over Local and Wide Area Networks
William Eager

The Journal of Instruction Delivery Systems, 1993

Large, decentralized organizations can dramatically increase the use and benefits of multimedia by distributing multi-media communications, information and training over Local Area Networks (LANs)and Wide Area Networks (WANs). This approach empowers employees at remote locations to access the information/training that they need, when they need it, directly at their desktop. This article will show that network delivery of multimedia is an area that has tremendous growth potential; provides examples of practical applications for multimedia delivery over local and wide area networks; and addresses some of the technical issues that must be considered to successfully deliver multimedia over networks.

View PDFchevron_right
Using overlays for efficient data transfer over shared wide-area networks
Rajkumar Kettimuthu

2008

Data-intensive applications frequently transfer large amounts of data over wide-area networks. The performance achieved in such settings can often be improved by routing data via intermediate nodes chosen to increase aggregate bandwidth. We explore the benefits of overlay network approaches by designing and implementing a service-oriented architecture that incorporates two key optimizations -multi-hop path splitting and multi-pathing -within the GridFTP file transfer protocol. We develop a file transfer scheduling algorithm that incorporates the two optimizations in conjunction with the use of available file replicas. The algorithm makes use of information from past GridFTP transfers to estimate network bandwidths and resource availability. The effectiveness of these optimizations is evaluated using several application file transfer patterns: one-to-all broadcast, all-to-one gather, and data redistribution, on a wide-area testbed. The experimental results show that our architecture and algorithm achieve significant performance improvement.

View PDFchevron_right
Network Design for WAN Traffic and Cost Generator
Associate Professor Dr.Khean Ouk

2020

Wide Area Network (WAN) is an interconnected network round the world to share such as voice, data and video. So there are many types of traffic flow in and out of all directions and much type of data is transferring such as email (internal email, external email), Web Access, Database Access, file transfer and Video Conferencing or Online Meeting or Online Learning during the Covid-19. Those types of data can cause more traffic loading during the busy hours or days. As a network designer must optimize the traffic of network flow to avoid the congestion and cost much money. In this research paper focus on the way how to design the best Wide Area Network. To become an expert Network Designer we need a sample problem to study the algorithms and to hone our skills. Real networks carry real traffic and cost real money. If you can't get the actual tariff and traffic, you will have to fill in the missing information. The generators here can be used to create a simple scenario. Solving such problems is the only way to learn the effective network design.

View PDFchevron_right
Achieving high utilization with software-driven WAN
Srikanth Kandula

Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM, 2013

We present SWAN, a system that boosts the utilization of inter-datacenter networks by centrally controlling when and how much traffic each service sends and frequently re-configuring the network's data plane to match current traffic demand. But done simplistically, these reconfigurations can also cause severe, transient congestion because different switches may apply updates at different times. We develop a novel technique that leverages a small amount of scratch capacity on links to apply updates in a provably congestion-free manner, without making any assumptions about the order and timing of updates at individual switches. Further, to scale to large networks in the face of limited forwarding table capacity, SWAN greedily selects a small set of entries that can best satisfy current demand. It updates this set without disrupting traffic by leveraging a small amount of scratch capacity in forwarding tables. Experiments using a testbed prototype and data-driven simulations of two production networks show that SWAN carries 60% more traffic than the current practice.

View PDFchevron_right
Applied techniques for high bandwidth data transfers across wide area networks
Jason Lee

2001

Large distributed systems such as Computational/Data Grids require large amounts of data to be co-located with the computing facilities for processing. Ensuring that the data is there in time for the computation in today's Internet is a massive problem. From our work developing a scalable distributed network cache, we have gained experience with techniques necessary to achieve high data throughput over high bandwidth Wide Area Networks (WAN). In this paper, we discuss several hardware and software design techniques and issues, and then describe their application to an implementation of an enhanced FTP protocol called GridFTP. We also describe results from two applications using these techniques, which were obtained at the Supercomputing 2000 conference.

View PDFchevron_right

References (140)

  1. P. Sevcik and R. Wetzel, "Improving Effective WAN Throughput for Large Data Flows," http://www.silver-peak.com/ assets/download/pdf/Netforecast wp EffectiveThroughput.pdf, November 2008.
  2. T. Grevers Jr. and J. Christner, Application Acceleration and WAN Optimization Fundamentals. Indianapolis, IN: Cisco Press, 2007.
  3. S. Corner, http://www.submitcorner.com/Guide/Bandwidth/001.shtml.
  4. Akamai, http://www.akamai.com/dl/reports/Site Abandonment Final Report.pdf, November 2006.
  5. M. Al-laham and I. M. M. E. Emary, "Comparative study between various algorithms of data compression techniques," International Journal of Computer Science and Network Security, vol. 7, no. 4, April 2007.
  6. S. Sakr, "Xml compression techniques: A survey and comparison," Journal of Computer and System Sciences, vol. 75, no. 5, pp. 303 - 322, 2009.
  7. J. Shukla, M. Alwani, and A. Tiwari, "A survey on lossless image compression methods," in Proc. 2nd International Conference on Computer Engineering and Technology, April 2010, pp. 136-141.
  8. R. J. Clarke, "Image and video compression: a survey," International Journal of Imaging Systems and Technology, vol. 10, pp. 20-32, 1999.
  9. Z. Liu, Y. Saifullah, M. Greis, and S. Sreemanthula, "HTTP Com- pression Techniques," in Proc. IEEE Wireless Communications and Networking Conference, March 2005, pp. 2495 -2500.
  10. N. Mandagere, P. Zhou, M. A. Smith, and S. Uttamchandani, "De- mystifying Data Deduplication," in Proc. Middleware Conference Companion, Leuven, Belgium, 2008, pp. 12-17.
  11. Q. He, Z. Li, and X. Zhang, "Data Deduplication Techniques," in Proc. International Conference on Future Information Technology and Management Engineering (FITME), Oct. 2010, pp. 430 -433.
  12. W. J. Bolosky, S. Corbin, D. Goebel, and J. R. Douceur, "Single In- stance Storage in Windows 2000," in Proc. 4th conference on USENIX Windows Systems Symposium, Seattle, Washington, Aug. 2000, pp. 13- 24.
  13. J. R. Douceur, A. Adya, W. J. Bolosky, D. Simon, and M. Theimer, "Reclaiming Space from Duplicate Files in a Serverless Distributed File System," in Proc. 22 nd International Conference on Distributed Computing Systems, Vienna, Austria, July 2002, pp. 617-624.
  14. N. T. Spring and D. Wetherall, "A protocol-independent technique for eliminating redundant network traffic," in Proc. SIGCOMM, Stock- holm, Sweden, 2000, pp. 87-95.
  15. A. Anand, A. Gupta, A. Akella, S. Seshan, and S. Shenker, "Packet caches on routers: the implications of universal redundant traffic elimination," in Proc. SIGCOMM, Seattle, WA, USA, 2008, pp. 219- 230.
  16. A. Anand, V. Sekar, and A. Akella, "SmartRE: an architecture for coor- dinated network-wide redundancy elimination," SIGCOMM Computer Communication Review, vol. 39, pp. 87-98, August 2009.
  17. B. Aggarwal, A. Akella, A. Anand, A. Balachandran, P. Chitnis, C. Muthukrishnan, R. Ramjee, and G. Varghese, "EndRE: an end- system redundancy elimination service for enterprises," in Proc. 7th USENIX conference on Networked systems design and implementation, San Jose, California, 2010, pp. 28-28.
  18. G. Lu, Y. Jin, and D. Du, "Frequency based chunking for data de- duplication," in Proc. Modeling, Analysis Simulation of Computer and Telecommunication Systems, Aug. 2010, pp. 287 -296.
  19. S. Saha, A. Lukyanenko, and A. Yla-Jaaski, "Combiheader: Minimiz- ing the number of shim headers in redundancy elimination systems," in Proc. INFOCOM workshops on Computer Communications, April 2011, pp. 798 -803.
  20. S. Quinlan and S. Dorward, "Venti: A New Approach to Archival Data Storage," in Proc. 1st USENIX Conference on File and Storage Technologies (FAST), 2002, pp. 89 -101.
  21. A. T. Clements, I. Ahmad, M. Vilayannur, and J. Li, "Decentralized Deduplication in SAN Cluster File Systems," in Proc. USENIX Annual technical conference, San Diego, California, June 2009.
  22. C. Constantinescu, J. Pieper, and T. Li, "Block Size Optimization in Deduplication Systems," in Proc. Data Compression Conference, 2009.
  23. J. J. Hunt, K.-P. Vo, and W. F. Tichy, "An Empirical Study of Delta Algorithms," in Proc. SCM-6 Workshop on System Configuration Management, 1996, pp. 49-66.
  24. S. Iyer, A. Rowstron, and P. Druschel, "Squirrel: a decentralized peer- to-peer web cache," in Proc. 21th annual symposium on Principles of distributed computing, Monterey, California, 2002, pp. 213-222.
  25. L. Xiao, X. Zhang, and Z. Xu, "On reliable and scalable peer-to-peer web document sharing," in Proc. International Parallel and Distributed Processing Symposium (IPDPS), Fort Lauderdale, FL, April 2002, pp. 23-30.
  26. Z. Xu, Y. Hu, and L. Bhuyan, "Exploiting client cache: a scalable and efficient approach to build large web cache," in Proc. 18th International Parallel and Distributed Processing Symposium (IPDPS), April 2004, pp. 55-64.
  27. A. Vakali, "Proxy Cache Replacement Algorithms: A History-Based Approach," World Wide Web, vol. 4, pp. 277-297, 2001.
  28. T. M. Kroeger, D. D. E. Long, and J. C. Mogul, "Exploring the Bounds of Web Latency Reduction from Caching and Prefetching," in Proc. USENIX Symp. on Internet Technologies and Systems, Dec. 1997.
  29. P. Rodriguez, C. Spanner, and E. Biersack, "Analysis of web caching architectures: hierarchical and distributed caching," IEEE/ACM Trans. Netw., vol. 9, no. 4, pp. 404 -418, Aug. 2001.
  30. A. Chankhunthod, P. B. Danzig, C. Neerdaels, M. F. Schwartz, and K. J. Worrell, "A hierarchical internet object cache," in Proc. 1996 annual conference on USENIX Annual Technical Conference, San Diego, CA, 1996.
  31. D.Wessels and K. Claffy, "Application of Internet cache protocol (ICP) version 2," http://tools.ietf.org/html/rfc2187, May 1997.
  32. A. Rousskov and D. Wessels, "Cache digests," in Proc. 3rd Internal- tional WWW Caching Workshop, June 1998, pp. 272-273.
  33. R. Tewari, M. Dahlin, H. Vin, and J. Kay, "Design considerations for distributed caching on the internet," in Proc. 19th International Conference on Distributed Computing Systems, 1999, pp. 273 -284.
  34. D. Karger, A. Sherman, A. Berkheimer, B. Bogstad, R. Dhanidina, K. Iwamoto, B. Kim, L. Matkins, and Y. Yerushalmi, "Web caching with consistent hashing," in Proc. eighth international conference on World Wide Web, Toronto, Canada, 1999, pp. 1203-1213.
  35. L. Fan, P. Cao, J. Almeida, and A. Z. Broder, "Summary cache: a scalable wide-area web cache sharing protocol," IEEE/ACM Trans. Netw., vol. 8, pp. 281-293, June 2000.
  36. K. Leung, E. Wong, and K. Yeung, "Design of distributed video cache system on the internet," in Proc. 23rd International Conference on Distributed Computing Systems Workshops, May 2003, pp. 948 -953.
  37. M. Rabinovich, J. Chase, and S. Gadde, "Not all hits are created equal: cooperative proxy caching over a wide-area network," Computer Networks and ISDN Systems, vol. 30, pp. 2253-2259, November 1998.
  38. J. Ravi, Z. Yu, and W. Shi, "A survey on dynamic web content generation and delivery techniques," Journal of Network Computer Applications, vol. 32, pp. 943-960, September 2009.
  39. M. Abrams, C. R. Standridge, G. Abdulla, E. A. Fox, and S. Williams, "Removal Policies in Network Caches for World-Wide Web Docu- ments," in Proc. SIGCOMM, California, USA, 1996, pp. 293-305.
  40. J. Domenech, J. Sahuquillo, J. Gil, and A. Pont, "The Impact of the Web Prefetching Architecture on the Limits of Reducing User's Perceived Latency," in Proc. IEEE/WIC/ACM International Conference on Web Intelligence, Dec. 2006, pp. 740 -744.
  41. A. Balamash, M. Krunz, and P. Nain, "Performance analysis of a client-side caching/prefetching system for web traffic," Comput. Netw., vol. 51, pp. 3673-3692, September 2007.
  42. V. N. Padmanabhan and J. C. Mogul, "Using predictive prefetching to improve world wide web latency," SIGCOMM Computer Communica- tion Review, vol. 26, pp. 22-36, July 1996.
  43. T. Palpanas, "Web Prefetching Using Partial Match Prediction," Department of Computer Science, University of Toronto, Master's Thesis, March 1998, (available as Technical Report CSRG-376 http://www.cs.toronto.edu/ themis/publications/webprefetch.pdf).
  44. J. Domènech, J. Gil, J. Sahuquillo, and A. Pont, "DDG: An Efficient Prefetching Algorithm for Current Web Generation," in Proc. 1st IEEE Workshop on Hot Topics in Web Systems and Tech, 2006.
  45. R. Kokku, P. Yalagandula, A. Venkataramani, and M. Dahlin, "NPS: A Non-interfering Deployable Web Prefetching System," in Proc. 4th USENIX Symposium on Internet Technologies and Systems, 2003.
  46. A. Balamash, M. Krunz, and P. Nain, "Performance analysis of a client-side caching/prefetching system for web traffic," Comput. Netw., vol. 51, pp. 3673-3692, September 2007.
  47. X. Chen and X. Zhang, "Coordinated data prefetching by utilizing reference information at both proxy and web servers," SIGMETRICS Performance Evaluation Review, vol. 29, pp. 32-38, September 2001.
  48. C. Bouras, A. Konidaris, and D. Kostoulas, "Predictive Prefetching on the Web and Its Potential Impact in the Wide Area," World Wide Web, vol. 7, pp. 143-179, 2004.
  49. L. Fan, P. Cao, W. Lin, and Q. Jacobson, "Web Prefetching Between Low-Bandwidth Clients and Proxies: Potential and Performance," in Proc. ACM SIGMETRICS, Atlanta, Georgia, 1999, pp. 178-187.
  50. J. Pitkow and P. Pirolli, "Mining longest repeating subsequences to predict world wide web surfing," in Proc. 2nd conference on USENIX Symposium on Internet Technologies and Systems, Boulder, Colorado, Oct. 11-14 1999.
  51. X. Chen and X. Zhang, "Popularity-based ppm: an effective web prefetching technique for high accuracy and low storage," in Proc. International Conference on Parallel Processing, 2002, pp. 296 -304.
  52. R. R. Sarukkai, "Link prediction and path analysis using markov chains," in Proc. 9th international World Wide Web conference on Computer networks, Amsterdam, The Netherlands, 2000, pp. 377-386.
  53. M. Deshpande and G. Karypis, "Selective markov models for predict- ing web page accesses," ACM Transactions Internet Technology, vol. 4, pp. 163-184, May 2004.
  54. E. Markatos and C. Chronaki, "A top-10 approach to prefetching on the web," in Proc. INET, Geneva, Switzerland, 1998.
  55. A. Nanopoulos, D. Katsaros, and Y. Manolopoulos, "A data mining algorithm for generalized web prefetching," IEEE Trans. Knowl. Data Eng., vol. 15, no. 5, pp. 1155 -1169, Sep.-Oct. 2003.
  56. A. Songwattana, "Mining web logs for prediction in prefetching and caching," in Proc. Third International Conference on Convergence and Hybrid Information Technology, vol. 2, 2008, pp. 1006 -1011.
  57. J. Dean and M. R. Henzinger, "Finding related pages in the world wide web," in Proc. 8th international conference on World Wide Web, Toronto, Canada, 1999, pp. 1467-1479.
  58. D. Duchamp, "Prefetching hyperlinks," in Proc. USENIX Symposium on Internet Technologies and Systems, Boulder, Colorado, 1999.
  59. T. Ibrahim and C.-Z. Xu, "Neural nets based predictive prefetching to tolerate www latency," in Proc. 20th International Conference on Distributed Computing Systems (ICDCS), April 2000, pp. 636 -643.
  60. B. D. Davison, "Predicting web actions from html content," in Proc. the thirteenth ACM conference on Hypertext and hypermedia, College Park, Maryland, USA, 2002, pp. 159-168.
  61. A. Georgakis and H. Li, "User behavior modeling and content based speculative web page prefetching," Data Knowl. Eng., vol. 59, pp. 770-788, December 2006.
  62. V. N. Padmanabhan and J. C. Mogul, "Improving http latency," Computer Networks and ISDN Systems, vol. 28, pp. 25-35, Dec. 1995.
  63. A. Abhari and A. Serbinski, "HTTP modification to reduce client latency," in Proc. Canadian Conference on Electrical and Computer Engineering (CCECE), May 2008, pp. 1491-1496.
  64. J. Mickens, "Silo: exploiting javascript and dom storage for faster page loads," in Proceedings of the 2010 USENIX conference on Web application development, ser. WebApps'10, Boston, MA, 2010.
  65. I. Cidon, R. Rom, A. Gupta, and C. Schuba, "Hybrid tcp-udp transport for web traffic," in Proc. IEEE International Performance, Computing and Communications Conference, Feb. 1999, pp. 177-184.
  66. M. Rabinovich and H. Wang, "Dhttp: an efficient and cache-friendly transfer protocol for the web," IEEE/ACM Trans. Netw., vol. 12, pp. 1007-1020, December 2004.
  67. F. Yang, Y. Dou, Z. Lei, H. Zou, and K. Zhang, "The Optimization of HTTP Packets Reassembly based on Multi-core Platform," in Proc. 2nd IEEE International Conference on Network Infrastructure and Digital Content, Sept. 2010, pp. 530 -535.
  68. H. Balakrishnan, S. Seshan, E. Amir, and R. H. Katz, "Improving TCP/IP Performance over Wireless Networks," in Proc. 1st annual in- ternational conference on Mobile computing and networking, Berkeley, California, 1995, pp. 2-11.
  69. A. Bakre and B. Badrinath, "I-TCP: indirect TCP for Mobile Hosts," in Proc. 15th International Conference on Distributed Computing Systems, 1995, pp. 136 -143.
  70. A.I. Sundararaj and D. Duchamp, "Analytical Characterization of the Throughput of a Split TCP Connection," Department of Computer Science, Stevens Institute of Technology, Tech. Rep., 2003.
  71. R. Chakravorty, S. Katti, C. J, and P. I, "Flow Aggregation for Enhanced TCP over Wide-Area Wireless," in Proc. INFOCOM, April 1-3 2003, pp. 1754 -1764.
  72. J. Lee, P. Sharma, J. Tourrilhes, R. McGeer, J. Brassil, and A. Bavier, "Network Integrated Transparent TCP Accelerator," in Proc. 24th IEEE International Conference on Advanced Information Networking and Applications (AINA), April 2010, pp. 285 -292.
  73. T. Wolf, S. You, and R. Ramaswamy, "Transparent TCP Acceleration Through Network Processing," in Proc. IEEE Global Telecommunica- tions Conference (GLOBECOM), Dec. 2005, pp. 750-754.
  74. S. Ladiwala, R. Ramaswamy, and T. Wolf, "Transparent TCP Acceler- ation," Computer Communication, vol. 32, pp. 691-702, March 2009.
  75. M. Rabinovich and I. Gokhman, "CIFS Acceleration Techniques," in Proc. Storage Developer Conference, 2009.
  76. Blue Coat, "Blue Coat CIFS Protocol Optimization," http://www.bluecoat.com/doc/398%20-.
  77. Makani Networks, "Makani MAPI Protocol Optimization," http://www.makaninetworks.com/register/docs/makani-mapi.pdf.
  78. Blue Coat, "Blue Coat MAPI Protocol Optimization," http://www.bluecoat.com/doc/397%20-.
  79. P. Rodriguez, S. Mukherjee, and S. Ramgarajan, "Session level tech- niques for improving web browsing performance on wireless links," in Proc. 13th international conference on World Wide Web, New York, NY, USA, 2004, pp. 121-130.
  80. R. Chakravorty, A. Clark, and I. Pratt, "Gprsweb: optimizing the web for gprs links," in Proc. 1st international conference on Mobile systems, applications and services (MobiSys), San Francisco, California, 2003, pp. 317-330.
  81. Common Internet File System (CIFS), http://msdn.microsoft.com/en- us/library/aa302188.aspx.
  82. Server Message Block, http://en.wikipedia.org/wiki/Server Message Block#NetBIOS.
  83. Microsoft, "Messaging Application Programming Interface (MAPI)," http://msdn.microsoft.com/en-us/library/aa142548(v=exchg.65).aspx.
  84. M. Machowinski, "WAN optimization market passes $1 billion in 2008, up 29%; enterprise router market down."
  85. J. Skorupa, "Forecast: Application Acceleration Equipment, Worldwide, 2007-2015, 1Q11 Updated," http://www.gartner.com/DisplayDocument?id=1577015, March 2011.
  86. Google, http://www.chromium.org/spdy/spdy-whitepaper.
  87. T. Berners-Lee, R. Fielding, and H. Frystyk, "Hypertext Transfer Protocol -HTTP/1.0," IETF RFC 1945, May 1996.
  88. R. Fielding et. al , "Hypertext Transfer Protocol -HTTP/1.1," IETF RFC 2616, June 1999.
  89. A. B. King, Speed up Your Site: Web Site Optimization. New Riders, 2003.
  90. A. Anand, C. Muthukrishnan, A. Akella, and R. Ramjee, "Redundancy in network traffic: findings and implications," in Proc. 11th Interna- tional Joint Conference on Measurement and Modeling of Computer Systems, Seattle, WA, USA, 2009, pp. 37-48.
  91. J. Cleary and I. Witten, "Data compression using adaptive coding and partial string matching," IEEE Trans. Commun., vol. 32, no. 4, pp. 396 -402, Apr. 1984.
  92. J. Domènech, J. A. Gil, J. Sahuquillo, and A. Pont, "Web prefetching performance metrics: a survey," Perform. Eval., vol. 63, pp. 988-1004, October 2006.
  93. AKAMAI TECHNOLOGIES, "Akamai reveals 2 seconds as the new threshold of acceptability for ecommerce web page response times," http://www.akamai.com/html/about/press/releases/2009/press 091408. html, Sep. 14, 2009.
  94. V. Paxson, "Growth Trends in Wide-Area TCP Connections," IEEE Network, vol. 8, no. 4, pp. 8 -17, Jul/Aug 1994.
  95. E. Besson, "Performance of TCP in a Wide-Area Network: Influence of Successive Bottlenecks and Exogenous Traffic," in Proc. Global Telecommunications Conference, vol. 3, 2000, pp. 1798 -1804.
  96. M. Mirza, J. Sommers, P. Barford, and X. Zhu, "A Machine Learning Approach to TCP Throughput Prediction," IEEE/ACM Trans. Netw., vol. 18, no. 4, pp. 1026 -1039, Aug. 2010.
  97. N. Rao, S. Poole, S. Hicks, C. Kemper, S. Hodson, G. Hinkel, and J. Lothian, "Experimental Study of Wide-Area 10 Gbps IP Transport Technologies," in Proc. Military Communications Conference (MIL- COM), Oct. 2009, pp. 1 -7.
  98. J. C. Hoe, "Improving the start-up behavior of a congestion control scheme for tcp," in Proc. SIGCOMM, Palo Alto, California, United States, 1996, pp. 270-280.
  99. M. Aron and P. Druschel, "Tcp: Improving start-up dynamics by adaptive timers and congestion control," Rice University, Tech. Rep. TR98-318, 1998.
  100. N. Hu and P. Steenkiste, "Improving tcp startup performance using active measurements: algorithm and evaluation," in Proc. 11th IEEE International Conference on Network Protocols, Nov. 2003, pp. 107 - 118.
  101. R. Wang, G. Pau, K. Yamada, M. Sanadidi, and M. Gerla, "Tcp startup performance in large bandwidth networks," in Proc. INFOCOM, vol. 2, March 2004, pp. 796 -805.
  102. H. Wang and C. Williamson, "A new scheme for tcp congestion con- trol: smooth-start and dynamic recovery," in Proc. Sixth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, July 1998, pp. 69 -76.
  103. S. Floyd, "Limited Slow-Start for TCP with Large Congestion Win- dows," RFC 3742, March 2004.
  104. X. Lu, K. Zhang, C. P. Fu, and C. H. Foh, "A sender-side tcp en- hancement for startup performance in high-speed long-delay networks," in Proc. IEEE Wireless Communications and Networking Conference (WCNC), 2010, pp. 1 -5.
  105. L. Brakmo and L. Peterson, "Tcp vegas: end to end congestion avoidance on a global internet," IEEE J. Sel. Areas Commun., vol. 13, no. 8, pp. 1465 -1480, Oct. 1995.
  106. K. Xu, Y. Tian, and N. Ansari, "TCP-Jersey for wireless IP communi- cations," IEEE J. Sel. Areas Commun., vol. 22, no. 4, pp. 747 -756, May 2004.
  107. K. Xu and N. Ansari, "Stability and fairness of rate estimation-based AIAD congestion control in TCP," IEEE Commun. Lett., vol. 9, no. 4, pp. 378 -380, April 2005.
  108. K. Xu, Y. Tian, and N. Ansari, "Improving TCP Performance in Integrated Wireless Communications Networks," Computer Networks, vol. 47, no. 2, pp. 219-237, February 2005.
  109. H. Nishiyama, N. Ansari, and N. Kato, "Wireless loss-tolerant conges- tion control protocol based on dynamic aimd theory," IEEE Wireless Commun., vol. 17, no. 2, pp. 7 -14, April 2010.
  110. S. Floyd, "Highspeed TCP for large congestion window," IETF RFC 3649, Dec. 2003.
  111. T. Kelly, "Scalable TCP: Improving Performance in Highspeed Wide Area Networks," SIGCOMM Computer Communication Review, vol. 33, pp. 83-91, April 2003.
  112. M. Tekala and R. Szabo, "Evaluation of Scalable TCP," in Proc. 3rd ACS/IEEE International Conference on Computer Systems and Applications, 2005.
  113. D. X. Wei, C. Jin, S. H. Low, and S. Hegde, "FAST TCP: Motiva- tion, Architecture, Algorithms, Performance," IEEE/ACM Trans. Netw., vol. 14, no. 6, pp. 1246 -1259, Dec. 2006.
  114. M. Gerla, B. K. F. Ng, M. Y. Sanadidi, M. Valla, and R. Wang, "TCP Westwood with Adaptive Bandwidth Estimation to Improve Efficiency/Friendliness Tradeoffs," Computer Communications, vol. 27, pp. 41-58, 2003.
  115. L. Xu, K. Harfoush, and I. Rhee, "Binary Increase Congestion Control (BIC) for Fast Long-Distance Networks," in Proc. INFOCOM, vol. 4, March 2004, pp. 2514 -2524.
  116. S. Ha, I. Rhee, and L. Xu, "CUBIC: a New TCP-Friendly High-Speed TCP Variant," SIGOPS Operation System Review, vol. 42, pp. 64-74, July 2008.
  117. J. Brassil, R. McGeer, R. Rajagopalan, P. Sharma, P. Yalagandula, S. Banerjee, D. P. Reed, and S.-J. Lee, "The CHART System: a High-Performance, Fair Transport Architecture Based on Explicit-Rate Signaling," Operating Systems Review, vol. 43, pp. 26-35, Jan. 2009.
  118. W. Feng, P. Balaji, C. Baron, L. Bhuyan, and D. Panda, "Performance characterization of a 10-Gigabit Ethernet TOE," in Proc. 13th Symp. on High Performance Interconnects, Aug. 2005, pp. 58 -63.
  119. N. Carpenter, "SMB/CIFS Performance Over WAN Links," http://blogs.technet.com/b/neilcar/archive/2004/10/26/247903.aspx, 2009. [121] F5 Networks, "F5 WANJet CIFS Acceleration," http://www.f5.com/pdf/white-papers/cifs-wp.pdf.
  120. "F5 WANJet Transparent Data Reduction," http://www.f5.com/pdf/white-papers/wanjet-tdr-wp.pdf.
  121. Makani Networks, "Makani CIFS Acceleration," http://www.makaninetworks.com/register/docs/makani-cifs.pdf.
  122. R. Chakravorty, S. Banerjee, P. Rodriguez, J. Chesterfield, and I. Pratt, "Performance optimizations for wireless wide-area networks: compar- ative study and experimental evaluation," in Proc. 10th annual inter- national conference on Mobile computing and networking (MobiCom), Philadelphia, PA, USA, 2004, pp. 159-173.
  123. G. Apostolopoulos, V. Peris, and D. Saha, "Transport Layer Security: How much does it really cost?" in Proc. IEEE International Conference on Computer Communications (INFOCOM'99), New York, NY, USA, Mar. 1999, pp. 717 -725.
  124. C. Coarfa, P. Druschel, and D. S. Wallach, "Performance analysis of tls web servers," in Proc. Network and Distributed System Security Symposium (NDSS'02), San Diego, CA, USA, Feb. 2002, pp. 553- 558.
  125. K. J. Ma and R. Bartoš, "Analysis of transport optimization tech- niques," in Proc. International Conference on Web Services (ICWS), Sept. 2006, pp. 611 -620.
  126. D. Boneh and H. Shacham, "Fast Variants of RSA," RSA Cryptobytes, vol. 5, no. 1, pp. 1-9, Winter/Spring 2002.
  127. H. Shacham and D. Boneh, "Improving SSL Handshake Performance via Batching," in Proc. CT-RSA 2001, D. Naccache, Ed., vol. 2020, 2001, pp. 28-43.
  128. A. Murat Fiskiran and R. Lee, "Fast parallel table lookups to accelerate symmetric-key cryptography," in Proc. International Conference on Information Technology: Coding and Computing (ITCC), 2005, pp. 526 -531.
  129. V. Gopal, S. Grover, and M. Kounavis, "Fast multiplication techniques for public key cryptography," in Proc. IEEE Symposium on Computers and Communications (ISCC), 2008, pp. 316 -325.
  130. "Speeding Up Secure Web Transactions Using Elliptic Curve Cryptg- raphy," in Proc. 11th Network and Systems Security Symposium, 2004, pp. 231-239.
  131. W. Chelton and M. Benaissa, "Fast elliptic curve cryptography on fpga," IEEE Trans. Very Large Scale Integr. (VLSI) Syst., vol. 16, no. 2, pp. 198 -205, 2008.
  132. Z. Jiahong, X. Tinggang, and F. Xiangyan, "A Fast Hardware Im- plementation of Elliptic Curve Cryptography," in Proc. Information Science and Engineering (ICISE), 2009, pp. 1519 -1522.
  133. C. Peng, Q. Zhang, and C. Tang, "Improved tls handshake protocols using identity-based cryptography," in Proc. International Symposium on Information Engineering and Electronic Commerce (IEEC), May 2009, pp. 135 -139.
  134. C. Castelluccia, E. Mykletun, and G. Tsudik, "Improving secure server performance by re-balancing ssl/tls handshakes," in Proc. ACM Symposium on Information, Computer and Communications Security (ASIACCS), Taipei, Taiwan, 2006, pp. 26-34.
  135. N. Okamoto, S. Kimura, and Y. Ebihara, "An introduction of compres- sion algorithms into SSL/TLS and proposal of compression algorithms specialized for application," in Proc. Advanced Information Networking and Applications (AINA), pp. 817 -820.
  136. S. Hollenbeck, "Transport Layer Security Protocol Compression Meth- ods," RFC 3749, May 2004.
  137. R. Friend, "Transport Layer Security (TLS) Protocol Compression Using Lempel-Ziv-Stac (LZS)," RFC 3943, November 2004.
  138. K. Jang, S. Han, S. Han, S. Moon, and K. Park, "Accelerating SSL with GPUs," in Proc. ACM SIGCOMM, New Delhi, India, 2010, pp. 437-438.
  139. T. Berson, D. Dean, M. Franklin, D. Smetters, and M. Spreitzer, "Cryptography as a Network Service," in Proc. 7th Network and Systems Security Symposium, 2001.
  140. Yan Zhang (S'10) received the B.E. and M.E. degrees in electrical engineering from Shandong University, Jinan, Shandong, China, in 2001 and 2004, respectively. She is currently pursuing the Ph.D. degree in the Department of Electrical and

Related papers

The characterization of a wide area network computation
Christopher Freitas

Parallel Computing, 2003

Distributed parallel computing using message-passing techniques on Networks of Workstations (NOW) has achieved widespread use in the context of Local Area Networks. Recently, the concept of Grid-based computing using Wide Area Networks (WAN) has been proposed as a general solution to distributed high performance computing. The use of computers and resources at different geographic locations connected by a Wide Area Network and executing a real application introduces additional variables that potentially complicate the efficient use of these resources. Presented here are the results of a study that begins to characterize the performance issues of a WAN-based NOW, connecting resources that span an international border.

View PDFchevron_right
WAN-in-Lab: Motivation, Deployment and Experiments
Rajani Sonera

WAN-in-Lab is a hardware testbed for the design, development, testing and evaluation of high speed network protocols. It uses real carrier-class networking hardware to avoid the artifacts introduced by network simulation and emulation, while being localized to allow detailed measurement of network performance. WAN-in-Lab is an open resource, available for use by the networking community. This paper describes the structure of WAN-in-Lab and the rationale behind it, issues encountered, and experimental results that illustrate its applications.

View PDFchevron_right
Network Modeling and Emulation: A New Architecture of Next Generation WANem
Hemanta Kumar Kalita

Typically application developers develop and testing team tests an web based application in a local area network (LAN). And, once everything is completed deployment of the application is done in a wide area network (WAN). This process carries lots of WAN related bugs to the application. This is due to LAN having higher bandwidth (for example, 100 Mbps), lesser delay (~1 ms), almost zero loss, corruption and reordering of packets as compared to WAN. WANem[8] is used to provide real experience of a WAN during application development or testing over LAN environment. Thus, WANem helps both application developers and testers by emulating WAN in a LAN. Next Generation WANem (NxGen WANem) is developed based on existing WANem with enhanced features. With more interactive GUI and modifications on some preexisting commands, the NxGen WANem provides user with facility to model and design a network by dragging the network components available in the interface designed and thereafter emulate the network characteristics. In this paper, we propose an architecture of NxGen WANem.

View PDFchevron_right
CISCO WAN A community over networking journal
Wilbur Jr. Jangao
View PDFchevron_right
Wan Emulator
Jordi Domingo-Pascual, Virgil Dobrota

Testing in real life conditions is not as easy as it first seems, because often it is costly and difficult to reproduce Internet behaviour in controlled environment. WAN Emulator (WANE) proposed herein is a software tool that helps controlling the IP traffic parameters of a network, like delay, packet loss or packet duplication.

View PDFchevron_right

Related topics

  • Computer Science
  • Distributed Computing
  • Metropolitan Area Network
  • Wide Area Network
  • Electrical and Electronic Engine...

    • Cited by

    An adaptive semantics-aware replacement algorithm for web caching
    Carlos Roque

    Journal of Internet Services and Applications, 2015

    As the web expands its overwhelming presence in our daily lives, the pressure to improve the performance of web servers increases. An essential optimization technique that enables Internet-scale web servers to service clients more efficiently and with lower resource demands consists in caching requested web objects on intermediate cache servers. At the core of the cache server operation is the replacement algorithm, which is in charge of selecting, according to a cache replacement policy, the cached pages that should be removed in order to make space for new pages. Traditional replacement policies used in practice take advantage of temporal reference locality by removing the least recently/frequently requested pages from the cache. In this paper we propose a new solution that adds a spatial dimension to the cache replacement process. Our solution is motivated by the observation that users typically browse the Web by successively following the links on the web pages they visit. Our system, called SACS, measures the distance between objects in terms of the number of links necessary to navigate from one object to another. Then, when replacement takes place, objects that are distant from the most recently accessed pages are candidates for removal; the closest an object is to a recently accessed page, the less likely it is to be evicted. We have implemented a cache server using SACS and evaluated our solution against other cache replacement strategies. In this paper we present the details of the design and implementation of SACS and discuss the evaluation results obtained.

    View PDFchevron_right
    580 California St., Suite 400
    San Francisco, CA, 94104
    © 2025 Academia. All rights reserved