Evaluation of Multicast Routing Algorithms with Fuzzy Sets

• Autorzy: Piechowiak M. , Prokopowicz P.
• Języki publikacji: EN

Abstrakty

EN

The paper presents a proposal of a new methodology that evaluates multicast routing algorithms in packet-switched networks with an application of fuzzy sets. Proposed multicriteria mechanism evaluate representative multicast routing algorithms: KPP, CSPT and MLRA (Multicast Routing Algorithm with Lagrange Relaxation) that minimize cost of paths between source and each destination node using Lagrange relaxation, and finally, minimize the total cost of multicast tree. A wide range of simulation research carried out by the authors, confirmed both the accuracy of new methodology and the effectiveness of the MLRA algorithm proposed by authors in earlier works.

Słowa kluczowe

EN

multicast routing; fuzzy sets; research methodology

• Wydawca: Publishing House of Poznan University of Technology
• Czasopismo: Advances in Electronics and Telecommunications
• Rocznik: 2013
• Tom: Vol. 3, no. 5
• Strony: 44--48
• Opis fizyczny: Bibliogr. 28 poz., rys.

Twórcy

autor

Piechowiak M.

• Kazimierz Wielki University, Bydgoszcz, Poland

autor

Prokopowicz P.

• Kazimierz Wielki University, Bydgoszcz, Poland

Bibliografia

• [1] L. Zadeh, “Fuzzy sets,” Information and Control, pp. 338–353, 1965.
• [2] V. P. Kompella, J. Pasquale, and G. C. Polyzos, “Multicasting for Multimedia Applications,” in INFOCOM, 1992, pp. 2078–2085.
• [3] J. S. Crawford and A. G. Waters, “Heuristics for ATM Multicast Routing,” Proceedings of 6th IFIP Workshop on Performance Modeling and Evaluation of ATM Networks, pp. 5/1–5/18, July 1998.
• [4] P. Santi, “Topology Control in Wireless Ad Hoc and Sensor Networks,” ACM Computing Surveys, vol. 37, pp. 164–194, 2005.
• [5] R. Rajaraman, “Topology Control and Routing in Ad Hoc Networks: A Survey,” ACM SIGACT News, vol. 33, pp. 60–73, 2002.
• [6] “WING - Wireless Mesh Network for Next-Generation Internet,” www.wing-project.org, 2012.
• [7] R. Riggio, T. Rasheed, S. Testi, F. Granelli, and I. Chlamtac, “Interference and Traffic Aware Channel Assignment in WiFibased Wireless Mesh Networks,” Elsevier Ad Hoc Networks, 2010.
• [8] K. Gomez, R. Riggio, T. Rasheed, D. Miorandi, I. Chlamtac, and F. Granelli, “Analysing the Energy Consumption Behaviour of WiFi Networks,” Proceedings of IEEE Greencom 2011, 2011.
• [9] W. Arden and H. Lee, “Analysis of Chordal Ring Network,” IEEE Transactions on Computers, vol. 30, no. 4, pp. 291–295, 1981.
• [10] T. Riaz, J. Gutierrez, J. Pedersen, P. Kiedrowski, and B. Dubalski, “A Hybrid Genetic and Simulated Annealing Algorithm for Chordal Ring Implementation in Large-Scale Networks,” Image Processing and Communications Challenges 3, Advances in Intelligent and Soft Computing, vol. 102, no. 3, pp. 503–510, 2011.
• [11] S. Bujnowski, B. Dubalski, A. Zabludowski, D. Ledzinski, T. Marciniak, and J. Pedersen, “Comparison of Modified Degree 6 Chordal Rings,” Image Processing and Communications Challenges 2, Advances in Intelligent and Soft Computing, vol. 84, no. 2, pp. 435–445, 2010.
• [12] B. Waxmann, “Routing of multipoint connections,” IEEE Journal on Selected Area in Communications, vol. 6, pp. 1617–1622, 1988.
• [13] L. Kou, G. Markowsky, and L. Berman, “A fast algorithm for Steiner trees,” Acta Informatica, vol. 15, pp. 141–145, 1981.
• [14] Q. Zhu, M. Parsa, and J. J. Garcia-Luna-Aceves, “A source-based algorithm for delay-constrained minimum-cost multicasting,” in INFOCOM’95: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume. IEEE Computer Society, 1995, p. 377.
• [15] A. Shaikh and K. G. Shin, “Destination-Driven Routing for Low-Cost Multicast.” IEEE Journal on Selected Areas in Communications, vol. 15, no. 3, pp. 373–381, 1997.
• [16] E. Dijkstra, “A note on two problems in connexion with graphs,” Numerische Mathematik, vol. 1, pp. 269–271, 1959.
• [17] R. Bellman, “On a routing problem,” Quarterly of Applied Mathematics, vol. 16, no. 1, pp. 87–90, 1958.
• [18] Q. Sun and H. Langendoerfer, “Efficient Multicast Routing for Delay-Sensitive Applications,” in Proceedings of the 2-nd Workshop on Protocols for Multimedia Systems (PROMS’95), October 1995, pp. 452–458.
• [19] M. F. Mokbel, W. A. El-Haweet, and M. N. El-Derini, “A delay constrained shortest path algorithm for multicast routing in multimedia applications,” in Proceedings of IEEE Middle East Workshop on Networking. IEEE Computer Society, 199
• [20] M. Piechowiak and P. Zwierzykowski, “Heuristic Algorithm for Multicast Connections in Packet Networks,” in Proceedings of EUROCON 2007 The International Conference on: Computer as a tool, IEEE. Warsaw, Poland: IEEE, September 2007, pp. 948–955.
• [21] K. Ahuja and L. Magnanti, Network Flows: Theory, Algorithms and Applications. Upper Saddle River, New Jersey: Prentice Hall, 1993.
• [22] M. Held and R. Karp, “The traveling salesman problem and minimum spanning trees,” Operation Research, vol. 18, pp. 1138–1162, 1970.
• [23] A. Juttner, B. Szviatovszki, I. Mecs, and Z. Rajko, “Lagrange Relaxation Based Method for the QoS Routing Problem,” IEEE INFOCOM’ 2001, 2001.
• [24] L. Zadeh, “The concept of a linguistic variable and its application to approximate reasoning, part i,” Information Sciences, pp. 199–249, 1975.
• [25] G. Beliakov, A. Pradera, and T. Calvo, “Aggregation functions: A guide for practitioners,” Series: Studies in Fuzziness and Soft Computing, Springer, vol. 221, 2007.
• [26] M. Baczynski and J. Balasubramaniam, “Fuzzy implications,” Series: Studies in Fuzziness and Soft Computing, Physica Verlag Heidelberg, vol. 69, 2008.
• [27] —, “Fuzzy modeling and control,” Series: Studies in Fuzziness and Soft Computing, Physica Verlag Heidelberg, vol. 69, 2001.
• [28] M. Piechowiak, P. Zwierzykowski, and M. Stasiak, “Multicast routing algorithm for packet networks with the application of the lagrange relaxation,” Proceedings of NETWORKS 2010 – 14-th International Telecommunications Network Strategy and Planning Symposium, pp. 197–202, September 2010.