Refinements to Minimum Interference Routing for Traffic Engineering

Author

Modi, Bhavesh ; Jotwani, Naresh ; Maitra, Anutosh

Author_Institution

Dhirubhai Ambani Institute of Information and Communication Technology, Gandhinagar, Gujarat, INDIA, Phone: 91-79-30510564, Fax: 91-79-30520010

fYear

2005

fDate

11-13 Dec. 2005

Firstpage

556

Lastpage

560

Abstract

Minimum interference routing algorithm has been proposed earlier for explicit constraint-based routing of flows in networks between specified ingress and egress nodes. In this paper, the limitations of this algorithm are reviewed, and two refinements are presented which take into account the effects of (i) interference of a routed flow with future flows between the same ingress-egress pair, and (ii) degree of criticality of a link for a particular ingress-egress pair. The performance of the proposed algorithms is benchmarked against the original minimum interference routing algorithm, and also against two other algorithms proposed in literature, with encouraging results.

Keywords

minimum interference routing; resource optimization; routing; traffic engineering; Bandwidth; Communication system traffic control; Communications technology; Computer networks; Interference constraints; Joining processes; Multiprotocol label switching; Routing; Telecommunication traffic; Traffic control; minimum interference routing; resource optimization; routing; traffic engineering;

fLanguage

English

Publisher

ieee

Conference_Titel

INDICON, 2005 Annual IEEE

Print_ISBN

0-7803-9503-4

Type

conf

DOI

10.1109/INDCON.2005.1590233

Filename

1590233