Search

A set-theoretic expression was created to effectively illustrate Route Server (RS) functionality. The expression, which characterizes the behavior of Inter-domain Policy Routing (IDPR) speaking border routers (BRs), showed that RS storage requirements can be much larger than that of a traditional border router. The effectiveness of other techniques, such as view decomposition, was also revealed in terms of lessening RS storage requirements by a factor of five in some situations.

Several deflection routing techniques which employ packet state information are compared via simulations on a 64-node toroidal network with unidirectional links. The results reveal that deflection methods based on packet age and the amount of deflections perform better than random deflection strategies. In contrast, those based on source-to-destination shortest path distance or current-location-to-destination shortest path distance performed poorly. This holds true regardless of whether nodal input buffers where used or not.

Data communication in wavelength-division multiplexed (WDM) networks occurs via a source-destination pair. A lightpath is created between two nodes in the network and data hops through these nodes. However, only a limited number of lightpaths may be created such that a sequence of lightpaths known as a multi hop path needs to be structured. The most logical and efficient route through this path may be calculated using an algorithm for permutation routing based on shuffle network topology.