Skip to main content

A Novel Algorithm for Detection of Elephant Flows: Landmark-LRU with Recycle

  • Chapter
  • First Online:
Future Information Communication Technology and Applications

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 235))

  • 177 Accesses

Abstract

Along the trend of ever increasing Internet traffic, flows that occupy network bandwidth heavily over long period of time become serious threats. Elephant Flows, the nickname for these flows, have critical impact to network performance in terms of both delivery time and fairness. They raise complicated issues for management of Internet traffic and services. Identifying these flows efficiently in core network has been an important problem. The Least Recently Used (LRU) and the Landmark LRU schemes are two of the most efficient methods exist. We propose a cache update algorithm, to further improve the Landmark LRU scheme. The proposed scheme improves the accuracy of detecting elephant flow while maintaining efficiency of Landmark LRU. We verify our algorithm by analysis and simulation on wireless network traces captured on university environments.

This research was supported by a Research Grant from Sangmyung University.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Mori T, Uchida M, Kawahara R, Pan J, Goto S (2004) Identifying elephant flows through periodically sampled packets. In: Proceedings of the IMC’04, 4th ACM SIGCOMM conference on Internet measurement, pp 115–120

    Google Scholar 

  2. Smitah A, Kim I, Reddy ALN (2001) Identifying long-term high-bandwidth flows at a router. In: Proceedings of the high performance computing, pp 361–371

    Google Scholar 

  3. Che L, Qui B (2006) Landmark LRU: an efficient scheme for the detection of elephant flows at internet routers. Commun Lett, IEEE 10(7):567–569

    Article  Google Scholar 

  4. Estan C, Varghese G (2002) New directions in traffic measurement and accounting. In: Proceedings of the ACM SIGCOMM’02, pp 323–336

    Google Scholar 

  5. Achanta PG, Reddy ALN (2003) Design, analysis and experience of a partial state router. In: IEEE INFOCOM

    Google Scholar 

  6. Che L, Qui B (2005) Traffic measurement for large internet flows using multi-stage landmark LRU Cache. TENCON 2005 IEEE Reg 10:1–6

    Google Scholar 

  7. RFC 3917. http://www.ietf.org/rfc/rfc3917.txt

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jinoo Joung .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Choi, Y., Joung, J. (2013). A Novel Algorithm for Detection of Elephant Flows: Landmark-LRU with Recycle. In: Jung, HK., Kim, J., Sahama, T., Yang, CH. (eds) Future Information Communication Technology and Applications. Lecture Notes in Electrical Engineering, vol 235. Springer, Dordrecht. https://doi.org/10.1007/978-94-007-6516-0_18

Download citation

  • DOI: https://doi.org/10.1007/978-94-007-6516-0_18

  • Published:

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-94-007-6515-3

  • Online ISBN: 978-94-007-6516-0

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics