Rate-Based Dynamic Shortest Path Algorithm for Efficiently Routing Multiple Flows in SDN

Efficient routing necessitates the underlying path selection algorithms to find a path that can satisfy certain Quality-of-Service (QoS) requirements of a given flow while maximizing throughput and minimizing maximum link-load. In the case of routing multiple flows at the same time, finding such mul...

Full description

Bibliographic Details

Published in:	IEEE International Conference on Communications (2003) pp. 1 - 7
Main Authors:	Akin, Erdal, Korkmaz, Turgay
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.05.2019
Subjects:	Analytical models Data models Protocols Security Software Testing
ISSN:	1938-1883
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!