PCRCW
1997
Springer
14 years 3 months ago
1997
Springer
A novel routing scheme is proposed for virtual cutthrough routing that attempts to combine the low routing delay of deterministic routing with the exibility and low queuing delays...
SIGCOMM
1996
ACM
14 years 3 months ago
1996
ACM
The large-scale behavior of routing in the Internet has gone virtually without any formal study, the exceptions being Chinoy's analysis of the dynamics of Internet routing in...
GD
1997
Springer
14 years 3 months ago
1997
Springer
Although routing is a well-studied problem in various contexts, there remain unsolved problems in routing edges for graph layouts. In contrast with techniques from other domains su...
ICCAD
1996
IEEE
14 years 3 months ago
1996
IEEE
Many practical routing problems such as BGA, PGA, pin redistribution and test xture routing involve routing with interchangeable pins. These routing problems, especiallypackage la...
SIGCOMM
1997
ACM
14 years 3 months ago
1997
ACM
Abstract—This paper examines the network interdomain routing information exchanged between backbone service providers at the major U.S. public Internet exchange points. Internet ...
ISPD
1997
ACM
14 years 3 months ago
1997
ACM
We present results which show that a separate global and detailed routing strategy can be competitive with a combined routing process. Under restricted architectural assumptions, ...
DAC
1997
ACM
14 years 3 months ago
1997
ACM
: Academic clock routing research results has often had limited impact on industry practice, since such practical considerations as hierarchical buffering, rise-time and overshoot ...
INFOCOM
1997
IEEE
14 years 3 months ago
1997
IEEE
Abstract—Dynamic routing has been adopted in circuit-switched networks in many parts of the world. Most of the routing algorithms used are least loaded routing (LLR) based for it...
LATIN
1998
Springer
14 years 3 months ago
1998
Springer
We study the performance of packet routing on arrays (or meshes) with bounded buffers in the routing switches, assuming that new packets are continuously inserted at all the nodes....
CP
1998
Springer
14 years 3 months ago
1998
Springer
We use a local search method we term Large Neighbourhood Search (LNS) for solving vehicle routing problems. LNS meshes well with constraint programming technology and is analogous...