Results 211 to 220 of about 8,828 (263)

AI-driven routing pipeline in software-defined networks using DQL: a mini review. [PDF]

Front Artif Intell
Goteti D, Reddy VK.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

A Routing Scalability Model for Core-Edge Separation Internet with Hybrid Routing

IEEE Communications Letters, 2011
It has been widely accepted that core-edge separation architecture can improve routing scalability of the Internet. On the other hand, autonomous system (AS) level hybrid routing protocol has been proposed, where AS numbers are used for inter-domain routing instead of IP prefixes. It is expected that the combination of core-edge separation architecture
Ping Dong, Hongke Zhang, Yujing Zeng
exaly   +2 more sources

Routing Games with Edge Priorities

ACM Transactions on Economics and Computation, 2022
Routing games over time are widely studied due to various applications, e.g., transportation, road and air traffic control, logistic in production systems, communication networks like the internet, and financial flows. In this article, we present a new competitive packet routing game with edge priorities motivated by traffic and ...
Robert Scheffler 0001, Martin Strehler 0001, Laura Vargas Koch   +2 more
openaire   +1 more source

Shortest Path Approach to Edge Routing

2013 17th International Conference on Information Visualisation, 2013
Traditionally, drawing of edges is performed together with drawing of nodes. However, there are situations where positions of the nodes are fixed, e.g., when the positions are defined by the user or a separate algorithm. An example of this situation is a database schema editor, where user positions the nodes (i.e., visual representations of definitions
Jirí Dokulil, Jana Katreniaková, David Bednárek   +2 more
openaire   +2 more sources

An edge-based heuristic for Steiner routing

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1994
A new approximation heuristic for finding a rectilinear Steiner tree of a set of nodes is presented. It starts with a rectilinear minimum spanning tree of the nodes and repeatedly connects a node to the nearest point on the rectangular layout of an edge, removing the longest edge of the loop thus formed.
Manjit Borah, Robert Michael Owens, Mary Jane Irwin   +2 more
openaire   +1 more source

Edge Routing with Fixed Node Positions

2008 12th International Conference Information Visualisation, 2008
The two basic problems of graph drawing - drawing of nodes and drawing of edges - are often handled by one algorithm that finds suitable positions for both nodes and edges. However, there are situations where positions of nodes are fixed, for instance if they were defined by the user or the exact position of the nodes is somehow significant.
Jirí Dokulil, Jana Katreniaková
openaire   +1 more source