Outline

  • Abstract
  • Categories and Subject Descriptors
  • Keywords
  • 1. Introduction
  • 2. Cherrypick
  • 2.1 Preliminaries
  • 2.2 Overview of Cherrypick
  • 2.3 Design
  • 3. Evaluation
  • 3.1 Switch Flow Rules
  • 3.2 Packet Header Space
  • 3.3 End Host Resources
  • 4. Discussion
  • 5. Related Work
  • 6. Conclusion
  • Acknowledgments
  • 7. References

رئوس مطالب

  • چکیده
  • مقدمه
  • موارد اولیه
  • مسیریابی مسیرهایی که کوتاه نیستند
  • مدل راه انحرافی
  • بازبینی cherrypick
  • طراحی
  • انتخاب لینک
  • تخصیص شناسه لینک
  • ساختارمجدد مسیر
  • ارزیابی
  • قانون جریان سوییچ
  • فضای سرایند بسته
  • منبع نهایی هاست
  • بحث
  • تعمیم گرایی به سایر توپولوژی های شبکه
  • تاثیر طراحی مسیریابی و شکست لینک
  • تاثیر افت بسته ها
  • تاثیر کنترلر و عدم پیکربندی سوییچ
  • نشانه گذاری بسته
  • کارهای مربوطه
  • نتیجه گیری

Abstract

SDN-enabled datacenter network management and debugging can benefit by the ability to trace packet trajectories. For example, such a functionality allows measuring traffic matrix, detecting traffic anomalies, localizing network faults, etc. Existing techniques for tracing packet trajectories require either large data collection overhead or large amount of data plane resources such as switch flow rules and packet header space. We present CherryPick, a scalable, yet simple technique for tracing packet trajectories. The core idea of our technique is to cherry-pick the links that are key to representing an end-to-end path of a packet, and to embed them into its header on its way to destination. Preliminary evaluation on a fat-tree topology shows that CherryPick requires minimal switch flow rules, while using header space close to state-of-the-art techniques.

Keywords: -

Conclusions

We have presented CherryPick, a simple yet scalable technique for tracing packet trajectories in SDN-enabled datacenter networks. The core idea in CherryPick is that structure in datacenter network topologies enable reconstructing end-to-end paths using a few essential links. To that end, CherryPick “cherry-picks” a subset of links along the packet trajectory and embeds them into the packet header. We applied CherryPick to a fattree topology in this paper and showed that it requires minimal switch flow rules to enable tracing packet trajectories, while requiring packet header space close to state-of-the-art techniques.

دانلود ترجمه تخصصی این مقاله دانلود رایگان فایل pdf انگلیسی