Integer Linear Programming Model for Multicast Routing to Minimize Link Cost at Wavelengths

Authors

  • Rizka Fitria Postgraduated Mathematics, Faculty Mathematics and Sciences, Universitas Sumatera Utara, Medan, Indonesia
  • Saib Suwilo Department of Mathematics, Faculty of Mathematics and Sciences, Universitas Sumatera Utara, Medan, Indonesia
  • Elly Rosmaini Postgraduated Mathematics, Faculty Mathematics and Sciences, Universitas Sumatera Utara, Medan, Indonesia

DOI:

10.33395/sinkron.v8i3.12591

Keywords:

Multicast routing, Wavelength, Link cost, Hierarchical structure, Integer linear programming

Abstract

Routing is a technique or process carried out in a packet or information delivery system from a source to a destination or a place that requests the information needed from a source. Routing is done in solving a problem and is well-known is unicast routing. Unicast routing can transmit information from a source to a single destination. However, this is ineffective for an infinite number of requests to be served because the unicast routing system only funnels one destination to one source. So that another route is needed that can handle this, this route is called a multicast route. Multicast routing that can serve multiple destinations with only one source so that a collection of destinations to get the same request in the same time and data. This research will discuss multicast routing to minimize link costs at wavelengths using a hierarchical structure. To help provide reduction or savings on the link by offering an integer linear programming model formulation to minimize link costs at wavelengths. An update from previous studies is to use a hierarchical structure with wavelength conversion taking into account the links that are traversed and the requests that will be served by the source to the destination. Using wavelength conversion so that there are no wavelength continuity problems, so that when sending information you get more path choices and you can save on sending information using a link that will be passed from the source to the intermediate node until it reaches the destination node, with this it will find a path more efficiently so that the goal of minimizing link cost at wavelengths on multicast routing is achieved

 

GS Cited Analysis

Downloads

Download data is not yet available.

Author Biographies

Saib Suwilo, Department of Mathematics, Faculty of Mathematics and Sciences, Universitas Sumatera Utara, Medan, Indonesia

 

 

Elly Rosmaini, Postgraduated Mathematics, Faculty Mathematics and Sciences, Universitas Sumatera Utara, Medan, Indonesia

 

 

References

Bu’ulolo, F., & Mawengkang, H. (n.d.). Integer Optimization Models For Communication Network Design. Computing, 6, 11.

Cerulli, R., Fujishige, S., & Mahjoub, A. R. (2016). Combinatorial Optimization (Vol. 9849). Springer.

Constantinou, C. K., & Ellinas, G. (2013). A heuristic algorithm for multicast routing in sparse-splitting optical WDM networks. 2013 17th International Conference on Optical Networking Design and Modeling (ONDM), 65–69.

Cousin, B., Molnar, M., & Zhou, F. (2010). Light-hierarchies: Optimal multicast routes under optical constraints. 2010 Photonics Global Conference, 1–3.

Graver, J. E. (1975). On the foundations of linear and integer linear programming I. Mathematical Programming, 9(1), 207–226.

Le, D. D., Zhou, F., & Molnár, M. (2015). Minimizing blocking probability for the multicast routing and wavelength assignment problem in WDM networks: Exact solutions and heuristic algorithms. Journal of Optical Communications and Networking, 7(1), 36–48.

Malhotra, R. (2002). IP routing. “ O’Reilly Media, Inc.”

Molnár, M., Le, D. D., Perelló, J., Solé-Pareta, J., & McArdle, C. (2019). Multicast routing from a set of data centers in elastic optical networks. Optical Switching and Networking, 34, 35–46.

Oliveira, C. A. S., & Pardalos, P. M. (2011). Mathematical aspects of network routing optimization. Springer.

Oliveira, C. A. S., Pardalos, P. M., Prokopyev, O. A., & Resende, M. G. C. (2007). Streaming cache placement problems: complexity and algorithms. International Journal of Computational Science and Engineering, 3(3), 173–183.

White, R., Slice, D., & Retana, A. (1900). Optimal Routing Design. Pearson Education India.

Yang, W., Yang, C., & Huang, Y. (2016). Optimal and heuristic algorithms for all‐optical group multicast in resource‐constrained WDM networks. International Journal of Communication Systems, 29(15), 2292–2312.

Yang, Y., & Wang, J. (2004). Designing WDM optical interconnects with full connectivity by using limited wavelength conversion. IEEE Transactions on Computers, 53(12), 1547–1556.

Yu, O., & Cao, Y. (2006). Placement of light splitters and wavelength converters for efficient multicast in all-optical WDM networks. IEICE Transactions on Information and Systems, 89(2), 709–718.

Yu, X., Xiao, G., & Cheng, T. H. (2012). Performance comparisons between lightpath and light-tree schemes in dynamic multicast traffic grooming process. 2012 Photonics Global Conference (PGC), 1–5.

Zhou, F., Molnar, M., & Cousin, B. (2010). Light-hierarchy: The optimal structure for multicast routing in WDM mesh networks. The IEEE Symposium on Computers and Communications, 611–616.

Zhou, F., Molnár, M., & Cousin, B. (2009). Avoidance of multicast incapable branching nodes for multicast routing in WDM networks. Photonic Network Communications, 18, 378–392.

Zhou, Y., & Poo, G.-S. (2005). Optical multicast over wavelength-routed WDM networks: A survey. Optical Switching and Networking, 2(3), 176–197.

Downloads


Crossmark Updates

How to Cite

Fitria, R., Suwilo, S., & Rosmaini, E. . (2023). Integer Linear Programming Model for Multicast Routing to Minimize Link Cost at Wavelengths . Sinkron : Jurnal Dan Penelitian Teknik Informatika, 7(3), 1418-1426. https://doi.org/10.33395/sinkron.v8i3.12591

Most read articles by the same author(s)