A fuzzy-based path ordering algorithm for QoS routing in non-deterministic communication networks

A. Cohen, E. Korach, M. Last, R. Ohayon

Research output: Contribution to journalArticlepeer-review

21 Scopus citations


We present a novel, fuzzy-based method for path selection under additive quality of service constraints, where the information available for making routing decisions is inaccurate. The goal of the path selection process is to identify a feasible path while minimizing the overall setup time required for establishing a successful connection. Under the assumption that a list of candidate paths already exists, we explore the fuzzy logic approach for this purpose. The performance evaluation of the proposed algorithm is done by a simulation program that compares between the fuzzy logic approach, the optimal solution and a standard approach suggested in the literature, where the main performance metric is the average setup time for successfully establishing a feasible connection. The results show that the fuzzy approach has a lower average setup time for establishing a connection than the standard approach and that it is almost as efficient as the optimal solution.

Original languageEnglish
Pages (from-to)401-417
Number of pages17
JournalFuzzy Sets and Systems
Issue number3
StatePublished - 16 Mar 2005
Externally publishedYes

Bibliographical note

Funding Information:
This research was partially funded by the LSRT consortium under the O7ce of the Chief Scientist, Israeli Ministry of Trade and Industry and was partially supported by the Paul Ivanier Center for Robotics Research and Production Management, Ben-Gurion University of the Negev.


  • Fuzzy constraint satisfaction
  • Fuzzy statistics and data analysis
  • Inaccurate information
  • Multiple criteria evaluation
  • Path ordering algorithm
  • Quality of service
  • Routing


Dive into the research topics of 'A fuzzy-based path ordering algorithm for QoS routing in non-deterministic communication networks'. Together they form a unique fingerprint.

Cite this