Optimizing the Dynamic Distribution of Data-stream for High Speed Communications
The performances of high-speed network communications frequently rest with the distribution of data-stream. In this paper, a dynamic data-stream balancing architecture based on link information is introduced and discussed firstly. Then the algorithms for simultaneously acquiring the passing nodes an...
Main Authors: | Zhao, Z.W., Chen, I-Ming |
---|---|
Format: | Article |
Language: | English |
Published: |
2004
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/7459 |
Similar Items
-
Interlacing families and the Hermitian spectral norm of digraphs
by: Greaves, Gary Royden Watson, et al.
Published: (2021) -
Signed (0,2)-graphs with few eigenvalues and a symmetric spectrum
by: Greaves, Gary Royden Watson, et al.
Published: (2022) -
Density-based clustering of data streams at multiple resolutions
by: Wan, Li
Published: (2013) -
Modeling a simulation for sociotechnical resilience
by: Tantri, Fredy, et al.
Published: (2021) -
Bit-Packing Optimization for StreamIt
by: Agrawal, Kunal, et al.
Published: (2003)