Results 221 to 230 of about 19,422 (259)
Some of the next articles are maybe not open access.
A minimum interference routing algorithm
2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577), 2004Minimum interference routing is instrumental to MPLS traffic engineering under realistic assumptions of unknown traffic demand. This work presents a new algorithm for minimum interference routing, called light minimum interference routing (LMIR). This algorithm introduces a new approach for critical link identification that reduces the computational ...
Gustavo B. Figueiredo +2 more
openaire +1 more source
Schnyder Greedy Routing Algorithm
2010Geometric routing by using virtual locations is an elegant way for solving network routing problem In its simplest form, greedy routing, a message is forwarded to a neighbor that is closer to the destination One major drawback of this approach is that the virtual coordinates requires Ω(nlogn) bits to represent, which makes this scheme infeasible in ...
Xin He 0005, Huaming Zhang
openaire +1 more source
Delay sensitive routing algorithm
Journal of High Speed Networks, 2014Hybrid Wireless Optical Broadband Access Networks (WOBAN) are the cost effective solution to overcome the increasing demand of the bandwidth. However, there is significant mismatch in the performance of the wireless and optical part. In the wireless part of WOBAN, a packet has to travel through several hops due to which the data packet has to incur a ...
Asad Ali, Kanza Ali
openaire +1 more source
Implementing vehicle routing algorithms
Networks, 1977AbstractHeuristic programming algorithms frequently address large problems and require manipulation and operation on massive data sets. The algorithms can be improved by using efficient data structures. With this in mind, we consider heuristic algorithms for vehicle routing, comparing techniques of Clarke and Wright, Gillett and Miller, and Tyagi, and ...
Bruce L. Golden +2 more
openaire +1 more source
Analysis of permutation routing algorithms
European Journal of Operational Research, 2000zbMATH Open Web Interface contents unavailable due to conflicting licenses.
József Békési +2 more
openaire +2 more sources
Routing algorithms for IBM SP1
1994Scalable multicomputer are based upon interconnection networks that typically provide multiple communication routes between any given pair of processor nodes. Routes must be selected for communication so that the load is distributed evenly among the links and switches to prevent congestion in the network.
Bülent Abali, Cevdet Aykanat
openaire +1 more source
Parallel algorithms for VLSI routing
Integration, 1991Abstract With the increase in the design complexity of VLSI systems, there is an ever increasing need for efficient design automation tools. Parallel processing could open up the way for substantially faster and cost-effective VLSI design tools. In this paper, we review some of the basic parallel algorithms that have been recently developed to handle
openaire +1 more source
Automatic routing algorithm for VLSI
Proceedings of the 22nd ACM/IEEE conference on Design automation - DAC '85, 1985Hiroshi Andou +5 more
openaire +1 more source