2497 search results - page 60 / 500 » Requirements for models of achievable routing |
128
click to vote
ISCC
2003
IEEE
15 years 7 months ago
2003
IEEE
Multiple Description (MD) and Layered Coding (LC) are two source-coding approaches proposed for adaptive and robust video streaming over lossy networks. Both streaming methods aim...
115
click to vote
ICCS
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. This paper presents an application-level non-blocking multicast scheme for dynamic DAG scheduling on large-scale distributedmemory systems. The multicast scheme takes int...
126
click to vote
IEICET
2008
15 years 1 months ago
2008
Sensor nodes report the sensed data packets to the sink and depending on the application these packets may have diverse attributes: time-critical (TC) and non time-critical (NTC). ...
114
Voted
ICPADS
2005
IEEE
15 years 7 months ago
2005
IEEE
We show that universal routing can be achieved with low overhead in distributed networks. The validity of our results rests on a new network called the fat-stack. We show that fro...
110
click to vote
ANCS
2007
ACM
15 years 5 months ago
2007
ACM
To realize a path in an InfiniBand network, an address, known as Local IDentifier (LID) in the InfiniBand specification, must be assigned to the destination and used in the forwar...