Forecast-Founded Haze Bandwidth and Cost Decrease Scheme

K manoj kumar, S Srinivasulu

Abstract


In this paper, we present PACK (Predictive ACKs), a novel end-to-end traffic redundancy elimination (TRE) Scheme, designed for Haze computing customers. Haze-Founded TRE needs to apply a judicious use of Haze resources so that the bandwidth cost Decrease combined with the additional cost of TRE computation and storage would be optimized. PACK’s main advantage is its capability of offloading the Hazeserver TRE effort to endclients, thus minimizing the processing costs induced by the TRE algorithm. Unlike previous solutions, PACK does not require the server to continuously maintain clients’ status. This makes PACK very suitable for pervasive computation environments that combine client mobility and server migration to maintain Haze elasticity. PACK is Founded on a novel TRE technique, which allows the client to use newly received chunks to identify previously received chunk chains, which in turn can be used as reliable predictors to future transmitted chunks. We present a fully functional PACK implementation, transparent to all TCP-Founded applications and network devices. Finally, we analyze PACK benefits for Haze users, using traffic traces from various sources.


Keywords


Caching, Haze computing, network optimization, traffic redundancy elimination.

References


E. Zohar, I. Cidon, and O. Mokryn, “The power of Forecast: Haze bandwidth and cost Decrease,” in Proc. SIGCOMM, 2011, pp. 86–97.

M. Armbrust, A. Fox, R. Griffith, A. D. Joseph,

R. Katz, A. Konwinski, G. Lee, D. Patterson,

A. Rabkin, I. Stoica, and M. Zaharia, “A view of Haze computing,” Commun. ACM, vol. 53, no. 4, pp. 50–58, 2010.

U. Manber, “Finding similar files in a large file Scheme,” in Proc. USENIX Winter Tech. Conf., 1994, pp. 1–10.

N. T. Spring and D. Wetherall, “A protocol independent technique for eliminating redundant network traffic,” in Proc. SIGCOMM, 2000, vol. 30, pp. 87–95.

A. Muthitacharoen, B. Chen, and D. Mazières, “A low-bandwidth network file Scheme,” in Proc. SOSP, 2001, pp. 174–187.

E. LevRan, I. Cidon, and I. Z. Ben-Shaul, “Method and apparatus for reducing network traffic over low bandwidth links,” US Patent 7636767, Nov. 2009.

S. Mccanne and M. Demmer,

“ContentFounded segmentation scheme for data compression in storage and transmission including hierarchical segment representation,” US Patent 6828925, Dec. 2004.

R. Williams, “Method for partitioning a block of data into subblocks and for storing and communicating such subblocks,” US Patent 5990810, Nov. 1999.

Juniper Networks, Sunnyvale, CA, USA, “Application acceleration,” 1996 [Online]. Available: http://www.juniper.net/us/ en/productsservices/application-acceleration/

Blue Coat Schemes, Sunnyvale, CA, USA, “MACH5,” 1996 [Online]. Available: http://www.bluecoat.com/products/mach5

Expand Networks, Riverbed Technology, San

Francisco, CA, USA, “Application acceleration and WAN optimization,” 1998 [Online]. Available: http://www.expand.com/technology/ application-

acceleration.aspx

F5, Seattle, WA, USA, “WAN optimization,” 1996 [Online]. Available:http://www.f5.com/solutions/acceleration/wan-optimization/

A. Flint, “The next workplace revolution,” Nov. 2012 [Online]. Available: http://m.theatlanticcities.com/jobsandeconomy/2012/11/ nextworkplacerevolution/3904/

A. Anand, C. Muthukrishnan, A. Akella, and R. Ramjee, “Redundancy in network traffic: Findings and implications,” in Proc. SIGMETRICS, 2009, pp. 37–48.

B. Aggarwal, A. Akella, A. Anand, A. Balachandran, P. Chitnis, C. Muthukrishnan, R. Ramjee, and G. Varghese, “EndRE: An endScheme redundancy elimination service for enterprises,” in Proc. NSDI, 2010, pp. 28–28.

“PACK source code,” 2011 [Online]. Available: http://www.eyalzo. com/projects/pack

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, 2008, pp. 219–230.

A. Anand, V. Sekar, and A. Akella, “SmartRE: An architecture for coordinated network-wide redundancy elimination,” in Proc. SIGCOMM, 2009, vol. 39, pp. 87–98.

A. Gupta, A. Akella, S. Seshan, S. Shenker, and J. Wang, “Understanding and exploiting network traffic redundancy,” UWMadison, Madison, WI, USA, Tech. Rep. 1592, Apr.2007.

M. Zink, K. Suh, Y. Gu, and J. Kurose, “Watch global, cache local: YouTube network traffic at a campus network—Measurements and implications,” in Proc. MMCN, 2008, pp. 1–13.

S. Schleimer, D. S. Wilkerson, and A. Aiken,“Winnowing: Local algorithms for document fingerprinting,” in Proc. SIGMOD, 2003, pp. 76–85.

S. Ihm, K. Park, and V. Pai, “Wide-area network acceleration for the developing world,” in Proc. USENIX ATC, 2010, pp. 18–18.

H. Stevens and C. Pettey, “Gartner says Haze computing will be as influential as e-business,” Gartner Newsroom, Jun. 26, 2008.


Full Text: PDF[FULL TEXT]

Refbacks

  • There are currently no refbacks.


Copyright © 2013, All rights reserved.| ijseat.com

Creative Commons License
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.