✦ LIBER ✦

Optimal routing in shortest-path data networks

✍ Scribed by K. G. Ramakrishnan; Manoel A. Rodrigues

Publisher: Institute of Electrical and Electronics Engineers
Year: 2002
Tongue: English
Weight: 249 KB
Volume: 6
Category: Article
ISSN: 1089-7089
DOI: 10.1002/bltj.2267

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Shortest path routing and fault-tolerant

Shortest path routing and fault-tolerant routing on de Bruijn networks

✍ Mao, Jyh-Wen; Yang, Chang-Biau 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 170 KB 👁 1 views

In this paper, we study the routing problem for the undirected binary de Bruijn interconnection network. Researchers have never proposed a shortest path routing algorithm on the undirected binary de Bruijn network. We first propose a shortest path routing algorithm, whose time complexity in the bina

Optimal packet fragmentation and routing

Optimal packet fragmentation and routing in computer networks

✍ Orda, Ariel; Rom, Raphael 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 216 KB

The packet fragmentation problem in computer networks is that of breaking a packet into smaller pieces (fragments) due to packet-size limitations along the packet's route. This is a typical internetworking problem. We show that the commonly used simplistic approach whereby the routing and fragmentat

Optimal routings in communication networ

Optimal routings in communication networks with linearly bounded forwarding index

✍ Manoussakis, Yannis; Tuza, Zsolt 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 358 KB

In a given graph with n vertices, a routing is defined as a set of n(n -1) routes, one route connecting each ordered pair of vertices. The load of a vertex is the number of routes going through it. The forwarding index of the graph is the minimum of the largest load taken over all routings. We const

Adaptive least-expected time paths in st

Adaptive least-expected time paths in stochastic, time-varying transportation and data networks

✍ Elise Miller-Hooks 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 295 KB 👁 1 views

iOptimize: A software capability for ana

iOptimize: A software capability for analyzing and optimizing connection-oriented data networks in real time

✍ Naeem Asghar; Randeep S. Bhatia; Rakesh Chandwani; Colin Corcoran; Fang Hao; Jos 📂 Article 📅 2005 🏛 Institute of Electrical and Electronics Engineers 🌐 English ⚖ 212 KB 👁 1 views

This paper describes a service called iOptimize that analyzes and optimizes service providers' connection-oriented data networks. In these networks, online connection routing is used to set up connections quickly, but the simple path selection scheme and the limited information available for online