A Traffic Engineered Routing Algorithm Based on Fuzzy Logic

Junaid A. Khan, Hussein Alnuweiri

Research output: Contribution to conferencePaper

1 Citation (Scopus)

Abstract

This paper presents a routing algorithm that uses fuzzy logic to solve traffic engineering (TE) routing problem. Current TE routing algorithms are either inefficient or are too computationally expensive that these cannot be treated as practical solutions. The proposed algorithm performs better than many current TE routing algorithms and has time complexity equivalent to Dijkstra's algorithm. Therefore it is suitable to be used in practical routers.

Original languageEnglish
Pages454-457
Number of pages4
Publication statusPublished - 7 Nov 2003
Externally publishedYes
Event2003 IEEE Pacific Rim Conference on Communications Computers and Signal Processing (PACRIM 2003) - Victoria, B.C., Canada
Duration: 28 Aug 200330 Aug 2003

Other

Other2003 IEEE Pacific Rim Conference on Communications Computers and Signal Processing (PACRIM 2003)
CountryCanada
CityVictoria, B.C.
Period28/8/0330/8/03

Fingerprint

Routing algorithms
Fuzzy logic
Routers

ASJC Scopus subject areas

  • Signal Processing
  • Computer Networks and Communications

Cite this

Khan, J. A., & Alnuweiri, H. (2003). A Traffic Engineered Routing Algorithm Based on Fuzzy Logic. 454-457. Paper presented at 2003 IEEE Pacific Rim Conference on Communications Computers and Signal Processing (PACRIM 2003), Victoria, B.C., Canada.

A Traffic Engineered Routing Algorithm Based on Fuzzy Logic. / Khan, Junaid A.; Alnuweiri, Hussein.

2003. 454-457 Paper presented at 2003 IEEE Pacific Rim Conference on Communications Computers and Signal Processing (PACRIM 2003), Victoria, B.C., Canada.

Research output: Contribution to conferencePaper

Khan, JA & Alnuweiri, H 2003, 'A Traffic Engineered Routing Algorithm Based on Fuzzy Logic' Paper presented at 2003 IEEE Pacific Rim Conference on Communications Computers and Signal Processing (PACRIM 2003), Victoria, B.C., Canada, 28/8/03 - 30/8/03, pp. 454-457.
Khan JA, Alnuweiri H. A Traffic Engineered Routing Algorithm Based on Fuzzy Logic. 2003. Paper presented at 2003 IEEE Pacific Rim Conference on Communications Computers and Signal Processing (PACRIM 2003), Victoria, B.C., Canada.
Khan, Junaid A. ; Alnuweiri, Hussein. / A Traffic Engineered Routing Algorithm Based on Fuzzy Logic. Paper presented at 2003 IEEE Pacific Rim Conference on Communications Computers and Signal Processing (PACRIM 2003), Victoria, B.C., Canada.4 p.
@conference{cddf182fff1849128de7aa92a4c3bdb6,
title = "A Traffic Engineered Routing Algorithm Based on Fuzzy Logic",
abstract = "This paper presents a routing algorithm that uses fuzzy logic to solve traffic engineering (TE) routing problem. Current TE routing algorithms are either inefficient or are too computationally expensive that these cannot be treated as practical solutions. The proposed algorithm performs better than many current TE routing algorithms and has time complexity equivalent to Dijkstra's algorithm. Therefore it is suitable to be used in practical routers.",
author = "Khan, {Junaid A.} and Hussein Alnuweiri",
year = "2003",
month = "11",
day = "7",
language = "English",
pages = "454--457",
note = "2003 IEEE Pacific Rim Conference on Communications Computers and Signal Processing (PACRIM 2003) ; Conference date: 28-08-2003 Through 30-08-2003",

}

TY - CONF

T1 - A Traffic Engineered Routing Algorithm Based on Fuzzy Logic

AU - Khan, Junaid A.

AU - Alnuweiri, Hussein

PY - 2003/11/7

Y1 - 2003/11/7

N2 - This paper presents a routing algorithm that uses fuzzy logic to solve traffic engineering (TE) routing problem. Current TE routing algorithms are either inefficient or are too computationally expensive that these cannot be treated as practical solutions. The proposed algorithm performs better than many current TE routing algorithms and has time complexity equivalent to Dijkstra's algorithm. Therefore it is suitable to be used in practical routers.

AB - This paper presents a routing algorithm that uses fuzzy logic to solve traffic engineering (TE) routing problem. Current TE routing algorithms are either inefficient or are too computationally expensive that these cannot be treated as practical solutions. The proposed algorithm performs better than many current TE routing algorithms and has time complexity equivalent to Dijkstra's algorithm. Therefore it is suitable to be used in practical routers.

UR - http://www.scopus.com/inward/record.url?scp=0142168518&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0142168518&partnerID=8YFLogxK

M3 - Paper

SP - 454

EP - 457

ER -