Algorithm for efficient generation of link-state updates in ATM networks
Yazarlar (2)
Mohammad Peyravian
Prof. Dr. Oruç Raif ÖNVURAL Maltepe Üniversitesi, Türkiye
| Makale Türü | Özgün Makale (SSCI, AHCI, SCI, SCI-Exp dergilerinde yayınlanan tam makale) | ||
| Dergi Adı | COMPUTER NETWORKS AND ISDN SYSTEMS (Q3) | ||
| Dergi ISSN | 0169-7552 Dergi Bilgileri (1997) | ||
| Dergi Tarandığı Indeksler | SCI | ||
| Makale Dili | İngilizce | Basım Tarihi | 01-1997 |
| Cilt / Sayı / Sayfa | 29 / 2 / 237–247 | DOI | 10.1016/S0169-7552(96)00080-3 |
| Makale Linki | https://linkinghub.elsevier.com/retrieve/pii/S0169755296000803 | ||
| UAK Araştırma Alanları |
Bilgisayar ve İletişim Ağları
|
||
| Özet |
| In the routing framework defined by the ATM Forum Private Network Node Interface (P-NNI) working group, each node broadcasts link-state update (LSU) messages (which include information such as available bandwidth, maximum delay, etc.) about the outgoing links attached to it to other nodes in the network. For each connection request, the source node selects an end-to-end route that meets the quality of service (QoS) requirements of the connection based on the most recent information that it has about network links. Up-to-date information about network links is, therefore, key to making “good” routing decisions. The triggering of LSU broadcasts after adding or removing a single connection on any link would certainly enable optimal paths to be calculated but at a potentially significant cost in processing and bandwidth. A periodic update scheme, on the other hand, might be more preferable since it can be used … |
| Anahtar Kelimeler |
| source routing | link-state update | ATM | simulation | link-state update generation |
BM Sürdürülebilir Kalkınma Amaçları
| Atıf Sayıları | |
| Web of Science | 11 |
| Google Scholar | 31 |