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: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
2004
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1721.1/7459 |
| _version_ | 1826204599275487232 |
|---|---|
| author | Zhao, Z.W. Chen, I-Ming |
| author_facet | Zhao, Z.W. Chen, I-Ming |
| author_sort | Zhao, Z.W. |
| collection | MIT |
| description | 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. |
| first_indexed | 2024-09-23T12:58:01Z |
| format | Article |
| id | mit-1721.1/7459 |
| institution | Massachusetts Institute of Technology |
| language | English |
| last_indexed | 2024-09-23T12:58:01Z |
| publishDate | 2004 |
| record_format | dspace |
| spelling | mit-1721.1/74592019-04-12T08:40:35Z Optimizing the Dynamic Distribution of Data-stream for High Speed Communications Zhao, Z.W. Chen, I-Ming Data-stream balancing Adjacency matrix Service metric Link information Non-directional graph fair service 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. Singapore-MIT Alliance (SMA) 2004-12-14T20:34:49Z 2004-12-14T20:34:49Z 2005-01 Article http://hdl.handle.net/1721.1/7459 en Innovation in Manufacturing Systems and Technology (IMST); 362529 bytes application/pdf application/pdf |
| spellingShingle | Data-stream balancing Adjacency matrix Service metric Link information Non-directional graph fair service Zhao, Z.W. Chen, I-Ming Optimizing the Dynamic Distribution of Data-stream for High Speed Communications |
| title | Optimizing the Dynamic Distribution of Data-stream for High Speed Communications |
| title_full | Optimizing the Dynamic Distribution of Data-stream for High Speed Communications |
| title_fullStr | Optimizing the Dynamic Distribution of Data-stream for High Speed Communications |
| title_full_unstemmed | Optimizing the Dynamic Distribution of Data-stream for High Speed Communications |
| title_short | Optimizing the Dynamic Distribution of Data-stream for High Speed Communications |
| title_sort | optimizing the dynamic distribution of data stream for high speed communications |
| topic | Data-stream balancing Adjacency matrix Service metric Link information Non-directional graph fair service |
| url | http://hdl.handle.net/1721.1/7459 |
| work_keys_str_mv | AT zhaozw optimizingthedynamicdistributionofdatastreamforhighspeedcommunications AT cheniming optimizingthedynamicdistributionofdatastreamforhighspeedcommunications |