research-article

Reducing server and network load with shared buffering

Authors:

Somaya Arianfar,

Pasi Sarolahti,

Jörg OttAuthors Info & Claims

CSWS '12: Proceedings of the 2012 ACM workshop on Capacity sharing

Pages 33 - 38

https://doi.org/10.1145/2413219.2413229

Published: 10 December 2012 Publication History

Abstract

Today, content replication methods are common ways of reducing the network and servers load. Present content replication solutions have different problems, including the need for pre-planning and management, and they are ineffective in case of sudden traffic spikes. In spite of these problems, content replication methods are more popular today than ever, simply because of an increasing need for load reduction. In this paper, we propose a shared buffering model that, unlike current proxy-based content replication methods, is native to the network and can be used to alleviate the stress of sudden traffic spikes on servers and the network. We outline the characteristics of a new transport protocol that uses the shared buffers to offload the server work to the network or reduce the pressure on the overloaded links.

References

[1]

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. NSDI, 2010.

Digital Library

[2]

R. Alimi, A. Rahman, D. Kutscher, and Y. Yang. DECADE Architecture. Internet Draft draft-ietf-decade-arch-07.

[3]

A. Anand, A. Gupta, A. Akella, S. Seshan, and S. Shenker. Packet caches on routers: the implications of universal redundant traffic elimination. In SIGCOMM '08, 2008.

Digital Library

[4]

S. Arianfar, P. Nikander, and J. Ott. On content-centric router design and implications. ReARCH, 2010.

Digital Library

[5]

R. Briscoe. Re-feedback: Freedom with Accountability for Causing Congestion in a Connectionless Internetwork. PhD thesis, UCL, 2009.

[6]

P. B. Danzig, R. S. Hall, and M. F. Schwartz. A case for caching file objects inside internetworks. SIGCOMM Comput. Commun. Rev., 23(4):239--248, 1993.

Digital Library

[7]

S. Ihm and V. S. Pai. Towards understanding modern web traffic. SIGMETRICS Perform. Eval. Rev., 39(1):335--336, June 2011.

Digital Library

[8]

V. Jacobson, D. K. Smetters, J. D. Thornton, M. F. Plass, N. H. Briggs, and R. L. Braynard. Networking Named Content. In Proc. ACM CoNEXT, 2009.

Digital Library

[9]

J. Jiang, V. Sekar, and H. Zhang. Improving fairness, efficiency, and stability in http-based adaptive video streaming with festive. Technical report, Carnegie Mellon University, 2012.

[10]

T. Koponen, M. Chawla, B.-G. Chun, A. Ermolinskiy, K. H. Kim, S. Shenker, and I. Stoica. A data-oriented (and beyond) network architecture. In ACM SIGCOMM '07, 2007.

Digital Library

[11]

C. Labovitz, D. McPherson, S. Iekel-Johnson, J. Oberheide, F. Jahanian, and M. Karir. Internet Observatory Report. Proc. NANOG-47, 2009.

[12]

P. Sarolahti, J. Ott, K. Budigere, and C. Perkins. Poor man's content centric networking (with TCP). Technical Report Publication series SCIENCE + TECHNOLOGY, 5/2011, Aalto University, 2011.

[13]

P. Wendell and M. J. Freedman. Going viral: flash crowds in an open CDN. In Proc. IMC, 2011.

Digital Library

[14]

R. Wetzel. CDN Business Models - Not All Cast from the Same Mold. http://www.netforecast.com/Articles/CDNArticleSameMold.pdf, 2003.

[15]

H. Yin, X. Liu, F. Qiu, N. Xia, C. Lin, H. Zhang, V. Sekar, and G. Min. Inside the bird's nest: measurements of large-scale live VoD from the 2008 olympics. In Proc. IMC, pages 442--455, New York, NY, USA, 2009. ACM.

Digital Library

Cited By

Chen QXie RYu FLiu JHuang TLiu Y(2016)Transport Control Strategies in Named Data Networking: A SurveyIEEE Communications Surveys & Tutorials10.1109/COMST.2016.252816418:3(2052-2083)Online publication date: 1-Jul-2016
https://dl.acm.org/doi/10.1109/COMST.2016.2528164
Shahzad KUmer ANazir B(2015)Reduce VM migration in bandwidth oversubscribed cloud data centres2015 IEEE 12th International Conference on Networking, Sensing and Control10.1109/ICNSC.2015.7116024(140-145)Online publication date: Apr-2015
https://doi.org/10.1109/ICNSC.2015.7116024

Index Terms

Reducing server and network load with shared buffering
1. Networks
  1. Network protocols

Recommendations

A weighted metric based adaptive algorithm for web server load balancing
IITA'09: Proceedings of the 3rd international conference on Intelligent information technology application

We propose a load balancing algorithm that adapts its strategies for allocating Web requests based on the Web servers' status. The system used in our experiment comprises of two components: (1) a Prober and (2) an Allocator. The Prober gathers the ...
A Weighted Metric Based Adaptive Algorithm for Web Server Load Balancing
IITA '09: Proceedings of the 2009 Third International Symposium on Intelligent Information Technology Application - Volume 01

We propose a load balancing algorithm that adapts its strategies for allocating Web requests based on the Web servers’ status. The system used in our experiment comprises of two components: (1) a Prober and (2) an Allocator. The Prober gathers the ...
Server Load Balancing with Network Support: Active Anycast
IWAN '00: Proceedings of the Second International Working Conference on Active Networks

In server load balancing where replicated servers are dispersed geographically and accesses from clients are distributed to replicated servers, a way of distributing the accesses from clients to an adequate server plays an important role from the ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

CSWS '12: Proceedings of the 2012 ACM workshop on Capacity sharing

December 2012

66 pages

ISBN:9781450317801

DOI:10.1145/2413219

Program Chairs:
Bob Briscoe
BT Research & Technology, UK
,
Mirja Kühlewind
IKR, University of Stuttgart, Germany
,
Dirk Kutscher
NEC Laboratories Europe, Heidelberg, Germany

Copyright © 2012 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGCOMM: ACM Special Interest Group on Data Communication

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 10 December 2012

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

CoNEXT '12

Sponsor:

SIGCOMM

CoNEXT '12: Conference on emerging Networking Experiments and Technologies

December 10, 2012

Nice, France

Acceptance Rates

CSWS '12 Paper Acceptance Rate 9 of 17 submissions, 53%;

Overall Acceptance Rate 19 of 40 submissions, 48%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
118
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 25 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Chen QXie RYu FLiu JHuang TLiu Y(2016)Transport Control Strategies in Named Data Networking: A SurveyIEEE Communications Surveys & Tutorials10.1109/COMST.2016.252816418:3(2052-2083)Online publication date: 1-Jul-2016
https://dl.acm.org/doi/10.1109/COMST.2016.2528164
Shahzad KUmer ANazir B(2015)Reduce VM migration in bandwidth oversubscribed cloud data centres2015 IEEE 12th International Conference on Networking, Sensing and Control10.1109/ICNSC.2015.7116024(140-145)Online publication date: Apr-2015
https://doi.org/10.1109/ICNSC.2015.7116024

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents