Sciweavers

552 search results - page 30 / 111
» Routing complexity of faulty networks
Sort
View
CN
2006
75views more  CN 2006»
13 years 9 months ago
Dynamic online QoS routing schemes: Performance and bounds
Several dynamic QoS routing techniques have been recently proposed for new IP networks based on label forwarding. However, no extensive performance evaluation and comparison is av...
Antonio Capone, Luigi Fratta, Fabio Martignon
SPAA
2003
ACM
14 years 2 months ago
Throughput-centric routing algorithm design
The increasing application space of interconnection networks now encompasses several applications, such as packet routing and I/O interconnect, where the throughput of a routing a...
Brian Towles, William J. Dally, Stephen P. Boyd
JSAC
2006
157views more  JSAC 2006»
13 years 9 months ago
Traffic grooming in path, star, and tree networks: complexity, bounds, and algorithms
We consider the problem of traffic grooming in WDM path, star, and tree networks. Traffic grooming is a variant of the well-known logical topology design, and is concerned with the...
Shu Huang, Rudra Dutta, George N. Rouskas
AICCSA
2005
IEEE
124views Hardware» more  AICCSA 2005»
14 years 2 months ago
On multicast scheduling and routing in multistage Clos networks
Multicast communication, which involves transmitting information from one node to multiple nodes, is a vital operation in both broadband integrated services digital networks (BISD...
Bin Tang
CORR
2010
Springer
215views Education» more  CORR 2010»
13 years 7 months ago
Energy Efficient Clustering and Routing in Mobile Wireless Sensor Network
A critical need in Mobile Wireless Sensor Network (MWSN) is to achieve energy efficiency during routing as the sensor nodes have scarce energy resource. The nodes’ mobility in M...
Getsy S. Sara, Kalaiarasi R, Neelavathy Pari S, Sr...