Sciweavers

5079 search results - page 161 / 1016
» Hidden-Action in Network Routing
Sort
View
MASCOTS
2000
15 years 8 months ago
Stateless Routing in Network Simulations
The memory resources required by network simulations can grow quadratically with size of the simulated network. In simulations that use routing tables at each node to perform perh...
George F. Riley, Mostafa H. Ammar, Richard Fujimot...
199
Voted
CISS
2010
IEEE
14 years 10 months ago
Minimum cost optimization of multicast wireless networks with network coding
— Minimum cost optimization for multicast with network coding has attracted great research interests. In this paper, based on an information model that differentiates intermediat...
Chengyu Xiong, Xiaohua Li
ISPAN
2005
IEEE
16 years 18 days ago
A Hybrid Algorithm for Dynamic Lightpath Protection in Survivable WDM Optical Networks
- Dynamic lightpath protection in survivable WDM networks requires finding a pair of diverse routes (i.e., a primary route and a backup route that are link-disjoint) that form a cy...
Vinh Trong Le, Son-Hong Ngo, Xiaohong Jiang, Susum...
199
Voted
MMB
2004
Springer
128views Communications» more  MMB 2004»
16 years 11 days ago
Coexistence of Various Topology Aggregation Methods in a Hierarchical Network
Quality of Service (QoS) routing methods are expected to replace existing routing protocols in future QoS-based data networks. QoS routing allows the selection of feasible paths f...
Karol Kowalik, Martin Collier
JCT
1998
99views more  JCT 1998»
15 years 6 months ago
From Hall's Matching Theorem to Optimal Routing on Hypercubes
We introduce a concept of so-called disjoint ordering for any collection of finite sets. It can be viewed as a generalization of a system of distinctive representatives for the s...
Shuhong Gao, Beth Novick, Ke Qiu