Optimizing the Dynamic Distribution of Data-stream for High Speed Communications
Name
IMST020.pdf
Size
354.03 KB
Format
Adobe PDF
Checksum (MD5)
891f0a0d65aae44d6b4ac3118073c2d3
Author(s)
Zhao, Z.W.
Chen, I-Ming
Date Issued
January 2005
Series/Report no.
Innovation in Manufacturing Systems and Technology (IMST);
Abstract
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 and links of a path between any two source-destination nodes rapidly, as well as a dynamic data-stream distribution planning are proposed. Some related topics such as data fragment disposal, fair service, etc. are further studied and discussed. Besides, the performance and efficiency of proposed algorithms, especially for fair service and convergence, are evaluated through a demonstration with regard to the rate of bandwidth utilization. Hoping the discussion presented here can be helpful to application developers in selecting an effective strategy for planning the distribution of data-stream.
Subjects
Data-stream balancing
Adjacency matrix
Service metric
Link information
Non-directional graph
fair service
Persistent DSpace Link
