NBBS PATH SELECTION FRAMEWORK
Yazarlar (5)
| Makale Türü | Özgün Makale (SSCI, AHCI, SCI, SCI-Exp dergilerinde yayınlanan tam makale) | ||
| Dergi Adı | IBM Systems Journal (Q4) | ||
| Dergi ISSN | 0018-8670 | ||
| Dergi Tarandığı Indeksler | SCI | ||
| Makale Dili | İngilizce | Basım Tarihi | 01-1995 |
| Cilt / Sayı / Sayfa | 34 / 4 / 629–639 | DOI | 10.1147/sj.344.0629 |
| Makale Linki | http://ieeexplore.ieee.org/document/5387257/ | ||
| UAK Araştırma Alanları |
Bilgisayar ve İletişim Ağları
|
||
| Özet |
| This paper describes the path selection function in Networking BroadBand Services (NBBS), which is IBM's architecture for high-speed, multimedia networks. The distinguishing feature of a multimedia network is its ability to integrate different applications with different traffic characteristics and service requirements in the network, such as voice, video, and data. In order to meet their service requirements, it is necessary for the network to provide unique quality-of-service (QOS) guarantees to each application. QOS guarantees, specified as multiple end-to-end performance objectives, translate into path and link constraints in the shortest path routing problem. For a general cost function, shortest path routing subject to path constraints is known to be a nonpolynomial- (NP-) complete problem. The NBBS path selection algorithm, a heuristic solution based on the Bellman-Ford algorithm, has a polynomial order of … |
| Anahtar Kelimeler |
BM Sürdürülebilir Kalkınma Amaçları
| Atıf Sayıları | |
| Web of Science | 9 |
| Scopus | 4 |
| Google Scholar | 20 |