Finding all hops shortest paths with quality-of-service constraints
All hops optimal path (AHOP) problem is a problem that identifies the minimum weighted paths between a given source and a destination node for all hop counts. Nowadays, Data networks are increasingly used by streaming applications that require both bandwidth and delay guarantees. As a result, (AHOP)...
Saved in:
主要作者: | |
---|---|
其他作者: | |
格式: | Final Year Project |
語言: | English |
出版: |
2012
|
主題: | |
在線閱讀: | http://hdl.handle.net/10356/49419 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|