A New Algorithm for Finding Vertex-Disjoint Paths

Kurt M., BERBERLER M. E., Ugurlu O.

INTERNATIONAL ARAB JOURNAL OF INFORMATION TECHNOLOGY, cilt.12, sa.6, ss.550-555, 2015 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 12 Sayı: 6
  • Basım Tarihi: 2015
  • Dergi Adı: INTERNATIONAL ARAB JOURNAL OF INFORMATION TECHNOLOGY
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.550-555
  • Anahtar Kelimeler: Vertex-disjoint paths, multipath, Ad-Hoc wireless networks
  • Dokuz Eylül Üniversitesi Adresli: Evet

Özet

The fact that the demands which could be labelled as "luxurious" in the past times, have became requirements makes it inevitable that the service providers do new researches and prepare alternative plans under harsh competition conditions. In order to, provide the customers with the services in terms of the committed standards by taking the possible damages on wired and wireless networks into consideration. Finding vertex disjoint paths gives many advantages on the wired or wireless communication especially on Ad-Hoc Networks. In this paper, we suggest a new algorithm that calculates alternative routes which do not contain common vertex (vertex-disjoint path) with problematic route during a point-to-point communication on the network in a short time and it is compared to similar algorithms.