Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
156 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

MIST: An Efficient Approach for Software-Defined Multicast in Wireless Mesh Networks (2312.04418v2)

Published 7 Dec 2023 in cs.NI, cs.SY, and eess.SY

Abstract: Multicasting is a vital information dissemination technique in Software-Defined Networking (SDN). With SDN, a multicast service can incorporate network functions implemented at different nodes, which is referred to as software-defined multicast. Emerging ubiquitous wireless networks for 5G and Beyond (B5G) inherently support multicast. However, the broadcast nature of wireless channels, especially in dense deployments, leads to neighborhood interference as a primary system degradation factor, which introduces a new challenge for software-defined multicast in wireless mesh networks. To tackle this, this paper introduces an innovative approach, based on the idea of minimizing both the total length cost of the multicast tree and the interference at the same time. Accordingly, a novel bicriteria optimization problem is formulated--\emph{Minimum Interference Steiner Tree (MIST)}, which is the edge-weighted variant of the vertex-weighted secluded Steiner tree problem \cite{chechik2013secluded}. To solve the bicriteria problem, instead of resorting to heuristics, this paper employs an innovative approach that is an approximate algorithm for MIST but with guaranteed performance. Specifically, the approach exploits the monotone submodularity property of the interference metric and identifies Pareto optimal solutions for MIST, then converts the problem into the submodular minimization under Steiner tree constraints, and designs a two-stage relaxation algorithm. Simulation results demonstrate and validate the performance of the proposed algorithm.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (27)
  1. Z. AlSaeed, I. Ahmad, and I. Hussain, “Multicasting in software-defined networks: A comprehensive survey,” Journal of Network and Computer Applications, vol. 104, pp. 61–77, 2018.
  2. G. Mirjalily, M. Asgarian, and Z.-Q. Luo, “Interference-aware nfv-enabled multicast service in resource-constrained wireless mesh networks,” IEEE Transactions on Network and Service Management, vol. 19, no. 1, pp. 424–436, 2022.
  3. M. Brazil, R. L. Graham, D. A. Thomas, and M. Zachariasen, “On the history of the euclidean steiner tree problem,” Archive for history of exact sciences, vol. 68, no. 3, pp. 327–354, 2014.
  4. S. L. Hakimi, “Steiner’s problem in graphs and its implications,” Networks, vol. 1, no. 2, pp. 113–133, 1971.
  5. A. Y. Levin, “Algorithm for the shortest connection of a group of graph vertices,” in Doklady Akademii Nauk, vol. 200, no. 4.   Russian Academy of Sciences, 1971, pp. 773–776.
  6. L. H. Sahasrabuddhe and B. Mukherjee, “Light trees: optical multicasting for improved performance in wavelength routed networks,” IEEE Communications Magazine, vol. 37, no. 2, pp. 67–73, 1999.
  7. B. A. A. Nunes, M. Mendonca, X.-N. Nguyen, K. Obraczka, and T. Turletti, “A survey of software-defined networking: Past, present, and future of programmable networks,” IEEE Communications surveys & tutorials, vol. 16, no. 3, pp. 1617–1634, 2014.
  8. W. Gu, X. Zhang, B. Gong, and L. Wang, “A survey of multicast in software-defined networking,” in 5th International Conference on Information Engineering for Mechanics and Materials.   Atlantis Press, 2015, pp. 1096–1100.
  9. E. Chlamtáč, M. Dinitz, and Y. Makarychev, “Minimizing the union: Tight approximations for small set bipartite vertex expansion,” in Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms.   SIAM, 2017, pp. 881–899.
  10. A. Kabra, “Parameterized complexity of minimum k union problem,” Ph.D. dissertation, 2018.
  11. S. Yuan, S. Varma, and J. P. Jue, “Minimum-color path problems for reliability in mesh networks,” in Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies., vol. 4.   IEEE, 2005, pp. 2658–2669.
  12. N. Kumar, “Computing a minimum color path in edge-colored graphs,” in International Symposium on Experimental Algorithms.   Springer, 2019, pp. 35–50.
  13. G. Veltri, Q. Huang, G. Qu, and M. Potkonjak, “Minimal and maximal exposure path algorithms for wireless embedded sensor networks,” in Proceedings of the 1st international conference on Embedded networked sensor systems, 2003, pp. 40–50.
  14. S. Chechik, M. P. Johnson, M. Parter, and D. Peleg, “Secluded connectivity problems,” Algorithmica, vol. 79, pp. 708–741, 2017.
  15. S. Bhore, P. Carmi, S. Kolay, and M. Zehavi, “Parameterized study of steiner tree on unit disk graphs,” Algorithmica, vol. 85, no. 1, pp. 133–152, 2023.
  16. S. Foldes and P. L. Hammer, “The dilworth number of a graph,” in Annals of Discrete Mathematics.   Elsevier, 1978, vol. 2, pp. 211–219.
  17. J. Edmonds, “Submodular functions, matroids, and certain polyhedra,” in Combinatorial Optimization—Eureka, You Shrink! Papers Dedicated to Jack Edmonds 5th International Workshop Aussois, France, March 5–9, 2001 Revised Papers.   Springer, 2003, pp. 11–26.
  18. M. Grötschel, L. Lovász, and A. Schrijver, “The ellipsoid method and its consequences in combinatorial optimization,” Combinatorica, vol. 1, pp. 169–197, 1981.
  19. W. H. Cunningham, “On submodular function minimization,” Combinatorica, vol. 5, no. 3, pp. 185–192, 1985.
  20. S. Iwata, L. Fleischer, and S. Fujishige, “A combinatorial strongly polynomial algorithm for minimizing submodular functions,” Journal of the ACM (JACM), vol. 48, no. 4, pp. 761–777, 2001.
  21. A. Schrijver, “A combinatorial algorithm minimizing submodular functions in strongly polynomial time,” Journal of Combinatorial Theory, Series B, vol. 80, no. 2, pp. 346–355, 2000.
  22. M. X. Goemans, N. J. Harvey, S. Iwata, and V. Mirrokni, “Approximating submodular functions everywhere,” in Proceedings of the twentieth annual ACM-SIAM symposium on Discrete algorithms.   SIAM, 2009, pp. 535–544.
  23. Z. Svitkina and L. Fleischer, “Submodular approximation: Sampling-based algorithms and lower bounds,” SIAM Journal on Computing, vol. 40, no. 6, pp. 1715–1737, 2011.
  24. S. Iwata and K. Nagano, “Submodular function minimization under covering constraints,” in 2009 50th Annual IEEE Symposium on Foundations of Computer Science.   IEEE, 2009, pp. 671–680.
  25. G. Goel, C. Karande, P. Tripathi, and L. Wang, “Approximability of combinatorial problems with multi-agent submodular cost functions,” in 2009 50th Annual IEEE Symposium on Foundations of Computer Science, 2009, pp. 755–764.
  26. C. Koufogiannakis and N. E. Young, “Greedy δ𝛿\deltaitalic_δ-approximation algorithm for covering with arbitrary constraints and submodular cost,” Algorithmica, vol. 66, pp. 113–152, 2013.
  27. A. C.-C. Yao, “Probabilistic computations: Toward a unified measure of complexity,” in 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).   IEEE Computer Society, 1977, pp. 222–227.

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets