Sciweavers

1209 search results - page 78 / 242
» Effective bandwidths with priorities
Sort
View
ICDCS
2012
IEEE
11 years 11 months ago
DARD: Distributed Adaptive Routing for Datacenter Networks
Datacenter networks typically have many paths connecting each host pair to achieve high bisection bandwidth for arbitrary communication patterns. Fully utilizing the bisection ban...
Xin Wu, Xiaowei Yang
ICMCS
2005
IEEE
56views Multimedia» more  ICMCS 2005»
14 years 2 months ago
On the rate-distortion performance of dynamic bitstream switching mechanisms
Bitstream switching is an effective way to deal with bandwidth variation in transmitting multimedia over time-varying channels. A number of bitstream switching mechanisms have bee...
Bo Xie, Wenjun Zeng
ICMCS
2000
IEEE
83views Multimedia» more  ICMCS 2000»
14 years 1 months ago
PBS: A Predictive Block Sampling Algorithm for Desktop Multimedia Video Applications
Manipulating digital video using desktop computers, especially in uncompressed form, and communicating it over networks can be time-consuming because of it large bandwidth require...
Joseph Pasquale, Tom Nguyen, Jonathan Kay
INFOCOM
1999
IEEE
14 years 1 months ago
Ring versus Tree Embedding for Real-time Group Multicast
In general topology networks, routing from one node to another over a tree embedded in the network is intuitively a good strategy, since it typically results in a route length of O...
Mario Baldi, Yoram Ofek
CCR
2002
86views more  CCR 2002»
13 years 8 months ago
Hop-by-hop routing algorithms for premium traffic
In Differentiated Service (DiffServ) networks, the routing algorithms used by the premium class traffic, due to the high priority afforded to that traffic, may have a significant ...
Jun Wang, Klara Nahrstedt