Results 201 to 210 of about 5,306 (256)

Multipath-Based Segment-by-Segment Routing Protocol in MANETs

2008 The 9th International Conference for Young Computer Scientists, 2008
We propose a multipath-based segment-by-segment routing protocol in mobile ad-hoc networks (M-SSR). In M-SSR, a path is divided into multiple segments, in each of which multiple node-disjoint paths are discovered and routing maintenance can be performed independently.
Guojun Wang, Weijia Jia
exaly   +2 more sources

Prediction Augmented Segment Routing

2021 IEEE 22nd International Conference on High Performance Switching and Routing (HPSR), 2021
With the increasing success of machine learning based approaches for prediction problems, there has been recent effort in improving the performance of online algorithms by augmenting them with machine learning predictions. Since machine learning predictions typically do not offer any performance guarantees, the new approach has to take into ...
Murali S. Kodialam, T. V. Lakshman
openaire   +1 more source

Segmented channel routing

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1993
Novel problems concerning routing in a segmented routing channel are introduced. These problems are fundamental to routing and design automation for field programmable gate arrays (FPGAs), a new type of electrically programmable VLSI. The first known theoretical results on the combinatorial complexity and algorithm design for segmented channel routing ...
Vwani P. Roychowdhury   +2 more
openaire   +1 more source

Segmented channel routing

27th ACM/IEEE Design Automation Conference, 1990
Routing channels in a field-programmable gate array contain predefined wiring segments of various lengths. These may be connected to the pins of the gates or joined end-to-end to form longer segments by programmable switches. A segmented channel routing problem is formulated, and polynomial time algorithms are given for certain special cases.
Jonathan W. Greene   +3 more
openaire   +1 more source

Watchman Routes for Lines and Segments

2012
Given a set $\mathcal L$ of non-parallel lines, a watchman route (tour) for $\mathcal L$ is a closed curve contained in the union of the lines in $\mathcal L$ such that every point on any line is visible (along a line) from at least one point of the route; similarly, we define a watchman route (tour) for a connected set $\mathcal S$ of line segments ...
Dumitrescu, Adrian   +2 more
openaire   +1 more source

Traffic Engineering With Three-Segments Routing

IEEE Transactions on Network and Service Management, 2020
Segment Routing (SR) is a new fertile ground for Traffic Engineering (TE). By decomposing forwarding paths into segments, which specify a list of intermediate delivery points that a packet must visit on its way to the final destination, SR improves TE tasks and enables new solutions for the optimization of network resource utilization.
Vitor Pereira 0001   +2 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy