A minimum interference routing algorithm with reduced computational complexity

Figueiredo, Gustavo B.; Fonseca, Nelson L. S. da; Monteiro, José Augusto Suruagy

doi:10.1016/j.comnet.2005.06.015

Cited by 12 publications

(3 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We will not include these algorithms in our evaluations because they have been intensively evaluated and shown that the three algorithms (MIRA, LIOA, ILIOA) that we implement have outperformed them. In addition, we did not include Light Minimum Interference Routing (LMIR) [69] algorithm in our evaluations because of some ambiguities in some steps that did not lead to finding the lowest capacity paths.…”

Section: Least Interference Optimization Algorithm (Lioa)mentioning

confidence: 99%

Comparison of Routing Algorithms With Static and Dynamic Link Cost in Software Defined Networking (SDN)

Akin

Korkmaz

2019

IEEE Access

View full text Add to dashboard Cite

In this paper, we compared the existing routing algorithms in the context of Software Defined Networking (SDN), where a logically centralized controller acquires the global view of the network, selects the paths using a routing algorithm, and installs the determined routing rules to the switches. We divided existing routing algorithms (RA) into three categories: RA with static link cost (RA-SLC), RA with dynamic link cost (RA-DLC), and RA with dynamic link cost and minimum interference (RA-DLCMI). We then implemented various routing algorithms from each category using RYU SDN controller and compared their performances on Mininet emulator. For the network state information (NSI) needed for the routing algorithms, we first consider the idealistic case where the accurate NSI is available, as assumed in the literature. However, since this is not possible in practice, we also considered the practical case where the controller periodically collects the NSI with some inaccuracy. In our experiments, we observed that while RA-DLC and RA-DLCMI give similar performance, RA-SLC falls behind of RA-DLC and RA-DLCMI in the number of accepted flows and total throughput. We also showed that the performance of every algorithm is adversely affected from the inaccuracy of NSI, calling for further research on developing effective NSI collection methods. INDEX TERMS Routing algorithms, network state information accuracy, software defined networking (SDN), traffic engineering.

show abstract

Section: Least Interference Optimization Algorithm (Lioa)mentioning

confidence: 99%

Comparison of Routing Algorithms With Static and Dynamic Link Cost in Software Defined Networking (SDN)

Akin

Korkmaz

2019

IEEE Access

View full text Add to dashboard Cite

show abstract

“…However, in operational networks, the network connectivity degree allows the use of traffic engineering techniques, such as load balancing and minimum interference routing [24,25]. The employment of these techniques can reduce the competition among source-destination pairs leading to a smaller number of source-destination pairs sharing the same links; this reduces the computational efforts demanded by LRC.…”

Section: Inputmentioning

confidence: 99%

“…Table 2 presents both the mean and maximum value obtained. 1 The routing schemes adopted were Dijkstra's algorithm and the light minimum interference algorithm (LMIR) [24]. In a general way, it can be seen that the number of flows going through a given node is highly dependent of the adopted routing strategy.…”

Section: Performance Evaluationmentioning

confidence: 99%

Channel reusability for burst scheduling in OBS networks

Figueiredo

Fonseca

2013

Photon Netw Commun

View full text Add to dashboard Cite

This paper presents a novel channel scheduling policy for optical burst switching networks called least reusable channel (LRC). LRC decides to which interval of the output channel (void) an incoming burst should be allocated on the basis of reuse of the remaining voids. LRC dynamically uses information available to make allocation decisions. It is shown here that LRC produces lower blocking probability and distributes losses more uniformly among routes than do other existing scheduling policies.

show abstract

An exploration of aggregation convergecast scheduling

Souza

Nikolaidis

2013

Ad Hoc Networks

View full text Add to dashboard Cite

A minimum interference routing algorithm with reduced computational complexity

Cited by 12 publications

References 18 publications

Comparison of Routing Algorithms With Static and Dynamic Link Cost in Software Defined Networking (SDN)

Comparison of Routing Algorithms With Static and Dynamic Link Cost in Software Defined Networking (SDN)

Channel reusability for burst scheduling in OBS networks

An exploration of aggregation convergecast scheduling

Contact Info

Product

Resources

About