Comparison of routing algorithms with static and dynamic link cost in software defined networking (SDN)
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 …
Networking (SDN), where a logically centralized controller acquires the global view of the …
[PDF][PDF] Anycasting in connection-oriented computer networks: Models, algorithms and results
K Walkowiak - 2010 - intapi.sciendo.com
Our discussion in this article centers around various issues related to the use of anycasting
in connection-oriented computer networks. Anycast is defined as a one-to-one-of-many …
in connection-oriented computer networks. Anycast is defined as a one-to-one-of-many …
On achieveing bandwidth-aware LSP//spl lambda/SP multiplexing/separation in multi-layer networks
AB Bagula - IEEE Journal on Selected Areas in …, 2007 - ieeexplore.ieee.org
We present a new traffic engineering (TE) model which is based on QoS rerouting and uses
hybrid resilience to improve the recovery performance of multi-layer networks where an …
hybrid resilience to improve the recovery performance of multi-layer networks where an …
[PDF][PDF] Hybrid traffic engineering: the least path interference algorithm
AB Bagula - Proceedings of the 2004 annual research conference …, 2004 - researchgate.net
" $#% &!(#%()" 235 4 2! 7839 5 ACBD CFG7 HI (P Q& 4R 7" U#%" P#%"" 5 76T"(3I (abFY
c#%"(d 7'eP 6f geh7 c (0'(U""(" 6f7"" 70T 8rt 4 31rY 9v! rY 4 (" C3x 7'ey) 71"""(% eW" 7#" …
c#%"(d 7'eP 6f geh7 c (0'(U""(" 6f7"" 70T 8rt 4 31rY 9v! rY 4 (" C3x 7'ey) 71"""(% eW" 7#" …
Comparison of routing algorithms with static and dynamic link cost in SDN
There are several routing algorithms that can be used in the context of Software Defined
Networking (SDN), where a logically centralized controller obtains the global view of the …
Networking (SDN), where a logically centralized controller obtains the global view of the …
Hybrid routing in next generation IP networks
AB Bagula - Computer communications, 2006 - Elsevier
This paper presents a hybrid approach for routing flows in IP networks to achieve an optimal
network configuration maximising bandwidth usage (optimality), minimising re-routing upon …
network configuration maximising bandwidth usage (optimality), minimising re-routing upon …
[PDF][PDF] MPLS 流量工程最小干扰选路算法研究
郑志梅， 崔勇 - 2006 - Citeseer
多协议标记交换(multiprotocol label switching, 简称MPLS) 技术运用显式的标记交换路径(label
switching path, 简称LSP), 使得互联网上流量工程的部署变得简单和高效. 因此, LSP …
switching path, 简称LSP), 使得互联网上流量工程的部署变得简单和高效. 因此, LSP …
QoS dynamic routing in content delivery networks
K Walkowiak - … Technologies, Services, and Protocols; Performance of …, 2005 - Springer
Recently, much research in quality of service (QoS) routing has focused on the unicast
communication technique. However, Content Delivery Network (CDN) approach becomes …
communication technique. However, Content Delivery Network (CDN) approach becomes …
New algorithms for the unsplittable flow problem
K Walkowiak - Computational Science and Its Applications-ICCSA …, 2006 - Springer
In this paper we focus on the unsplittable flow problem (UFP): given a directed network with
arc capacities and a set of connections (requests) defined by origin node, destination node …
arc capacities and a set of connections (requests) defined by origin node, destination node …
A new dynamic routing algorithm based on minimum interference in MPLS networks
M Zhu, W Ye, S Feng - 2008 4th International Conference on …, 2008 - ieeexplore.ieee.org
The LSP routing algorithm in MPLS becomes the core and hot topic of traffic engineering.
This paper presents a new routing scheme that uses the current bandwidth availability and …
This paper presents a new routing scheme that uses the current bandwidth availability and …