Skip to main content

Distributed Counting Along Lossy Paths Without Feedback

  • Conference paper
  • First Online:
Structural Information and Communication Complexity (SIROCCO 2018)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 11085))

Abstract

Network devices need packet counters for a variety of applications. For a large number of concurrent flows, on-chip memories can be too small to support a separate counter per flow. While a single network element might struggle to implement flow accounting on its own, in this work we study alternatives leveraging underutilized resources elsewhere in the network and implement flow accounting on multiple network devices. This paper takes the first step towards understanding the design principles for robust network-wide accounting with lossy unidirectional channels without feedback.

This work was partially supported by a grant from the Cisco University Research Program Fund, an advised fund of Silicon Valley Community Foundation and by the Regional Government of Madrid on Cloud4BigData grant S2013/ICE-2894.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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. Lu, Y., Montanari, A., Prabhakar, B., Dharmapurikar, S., Kabbani, A.: Counter braids: a novel counter architecture for per-flow measurement. In: SIGMETRICS, pp. 121–132 (2008)

    Article  Google Scholar 

  2. Ramabhadran, S., Varghese, G.: Efficient implementation of a statistics counter architecture. In: SIGMETRICS, pp. 261–271 (2003)

    Google Scholar 

  3. Shah, D., Iyer, S., Prabhakar, B., McKeown, N.: Analysis of a statistics counter architecture. In: HOTI, pp. 107–111 (2001)

    Google Scholar 

  4. Wang, N., Ho, K.H., Pavlou, G., Howarth, M.P.: An overview of routing optimization for internet traffic engineering. IEEE Commun. Surv. Tutorials 10(1–4), 36–56 (2008)

    Article  Google Scholar 

  5. Zhao, Q., Xu, J.J., Liu, Z.: Design of a novel statistics counter architecture with optimal space and time efficiency. In: SIGMETRICS/Performance, pp. 323–334 (2006)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Vitalii Demianiuk .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Demianiuk, V., Gorinsky, S., Nikolenko, S., Kogan, K. (2018). Distributed Counting Along Lossy Paths Without Feedback. In: Lotker, Z., Patt-Shamir, B. (eds) Structural Information and Communication Complexity. SIROCCO 2018. Lecture Notes in Computer Science(), vol 11085. Springer, Cham. https://doi.org/10.1007/978-3-030-01325-7_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-01325-7_5

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-01324-0

  • Online ISBN: 978-3-030-01325-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics