Skip to main content

Joint Optimization of Flow Entry Aggregation and Routing Selection in Software Defined Wireless Access Networks

  • Conference paper
  • First Online:

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

Abstract

Software Defined Wireless Access Networks (SD-WAN) produce large amounts of traffic, which has caused limited flow table space in the TCAM. To solve the issue, this paper enables routing to overlap as many as possible with a minimum transmission delay, and thus traffic can be allocated to common paths to achieve flow entry aggregation. However, overlapping routing and traffic delay are two conflicting factors. An Integer Linear Program (ILP) is first proposed to minimize the total cost by tradeoff of the two factors. Through numerical experiments, this paper shows the effectiveness of the proposed method.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   109.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   139.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

Learn about institutional subscriptions

References

  1. Abujoda, A., Dietrich, D., Papadimitriou, P., et al.: Software-defined wireless access networks for internet access sharing. Comput. Netw. 93(P2), 359–372 (2015)

    Article  Google Scholar 

  2. Sarrar, N., Uhlig, S., Feldmann, A., et al.: Leveraging Zipf’s law for traffic offloading. SIGCOMM Comput. Commun. Rev. 42(1), 16–22 (2012)

    Article  Google Scholar 

  3. Katta, N., Alipourfard, O., Rexford, J., et al.: Infinite cache flow in software-defined networks. In: 3rd ACM SIGCOMM Workshop on Hot Topics in Software Defined Networking (HotSDN), Chicago, Illinois, USA, pp. 175–180 (2014)

    Google Scholar 

  4. Zhang, L., Lin, R., Xu, S., et al.: AHTM: achieving efficient flow table utilization in software defined networks. In: IEEE Global Communications Conference (GLOBECOM), Austin, Texas, USA, pp. 1897–1902 (2014)

    Google Scholar 

  5. Zhang, L., Wang, S., Xu, S., et al.: Timeoutx: an adaptive flow table management method in software defined networks. In: IEEE Global Communications Conference (GLOBECOM), San Diego, CA, USA, pp. 1–6 (2015)

    Google Scholar 

  6. Draves, R., King, C., Venkatachary, S., et al.: Constructing optimal IP routing tables. In: IEEE INFOCOM, New York, USA, vol. 1, pp. 88–97 (1999)

    Google Scholar 

  7. Uzmi, Z.A., Nebel, M., Tariq, A., et al.: Smalta: practical and near-optimal FIB aggregation. In: 7th International Conference on Emerging Networking EXperiments and Technologies (CoNEXT), Tokyo, Japan, pp. 29:1–29:12 (2011)

    Google Scholar 

  8. Meiners, C., Liu, A., Torng, E.: Bit weaving: a non-prefix approach to compressing packet classifiers in TCAMs. IEEE/ACM Trans. Netw. 20(2), 488–500 (2012)

    Article  Google Scholar 

  9. Kang, N., Liu, Z., Rexford, J., et al.: Optimizing the “one big switch” abstraction in software-defined networks. In: 9th International Conference on Emerging Networking EXperiments and Technologies (CoNEXT), Santa Barbara, California, USA, pp. 13–24 (2013)

    Google Scholar 

  10. Kanizo, Y., Hay, D., Keslassy, I.: Palette: distributing tables in software-defined networks. In: IEEE INFOCOM, Turin, Italy, pp. 545–549 (2013)

    Google Scholar 

  11. Moshref, M., Yu, M., Sharma, A., et al.: Scalable rule management for datacenters. In: 10th USENIX Symposium on Networked Systems Design and Implementation (NSDI), Lombard, IL, USA, pp. 157–170 (2013)

    Google Scholar 

  12. Sheu, J.P., Chen, Y.C.: A scalable and bandwidth-efficient multicast algorithm based on segment routing in software-defined networking. In: IEEE International Conference on Communications, pp. 1–6. IEEE (2017)

    Google Scholar 

Download references

Acknowledgment

This research is supported by the National Key R&D Program (Grant No. 2016YFB0201403), the Natural Science Fund of China (NSFC project No. 61701054). It is also supported by Tianjin Key Laboratory of Advanced Networking (TANK), School of Computer Science and Technology, Tianjin University, Tianjin, P. R. China.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Bin Wu .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Zhao, Z., Wu, B., Xiao, J., Hu, Z. (2018). Joint Optimization of Flow Entry Aggregation and Routing Selection in Software Defined Wireless Access Networks. In: Chellappan, S., Cheng, W., Li, W. (eds) Wireless Algorithms, Systems, and Applications. WASA 2018. Lecture Notes in Computer Science(), vol 10874. Springer, Cham. https://doi.org/10.1007/978-3-319-94268-1_75

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-94268-1_75

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-94267-4

  • Online ISBN: 978-3-319-94268-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics