Abstract
The problem of discovering the structure of a tree network was addressed by performing flow tests. Some results were also obtained on how to schedule data transmissions on a discovered tree network under different models of network behavior.
Original language | English (US) |
---|---|
Title of host publication | Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms |
Editors | J Schewel |
Pages | 828-829 |
Number of pages | 2 |
State | Published - 2003 |
Event | Configuralble Computing: Technology and Applications - Boston, MA, United States Duration: Nov 2 1998 → Nov 3 1998 |
Other
Other | Configuralble Computing: Technology and Applications |
---|---|
Country/Territory | United States |
City | Boston, MA |
Period | 11/2/98 → 11/3/98 |
ASJC Scopus subject areas
- Chemical Health and Safety
- Software
- Safety, Risk, Reliability and Quality
- Discrete Mathematics and Combinatorics