hrcak mascot   Srce   HID

Izvorni znanstveni članak
https://doi.org/10.2498/cit.2001.03.06

On Delay versus Congestion in Designing Rearrangeable Multihop Lightwave Networks

Jadranka Skorin-Kapov
Darko Skorin-Kapov
Valter Boljunčić

Puni tekst: engleski, pdf (170 KB) str. 213-218 preuzimanja: 424* citiraj
APA 6th Edition
Skorin-Kapov, J., Skorin-Kapov, D. i Boljunčić, V. (2001). On Delay versus Congestion in Designing Rearrangeable Multihop Lightwave Networks. Journal of computing and information technology, 9 (3), 213-218. https://doi.org/10.2498/cit.2001.03.06
MLA 8th Edition
Skorin-Kapov, Jadranka, et al. "On Delay versus Congestion in Designing Rearrangeable Multihop Lightwave Networks." Journal of computing and information technology, vol. 9, br. 3, 2001, str. 213-218. https://doi.org/10.2498/cit.2001.03.06. Citirano 03.03.2021.
Chicago 17th Edition
Skorin-Kapov, Jadranka, Darko Skorin-Kapov i Valter Boljunčić. "On Delay versus Congestion in Designing Rearrangeable Multihop Lightwave Networks." Journal of computing and information technology 9, br. 3 (2001): 213-218. https://doi.org/10.2498/cit.2001.03.06
Harvard
Skorin-Kapov, J., Skorin-Kapov, D., i Boljunčić, V. (2001). 'On Delay versus Congestion in Designing Rearrangeable Multihop Lightwave Networks', Journal of computing and information technology, 9(3), str. 213-218. https://doi.org/10.2498/cit.2001.03.06
Vancouver
Skorin-Kapov J, Skorin-Kapov D, Boljunčić V. On Delay versus Congestion in Designing Rearrangeable Multihop Lightwave Networks. Journal of computing and information technology [Internet]. 2001 [pristupljeno 03.03.2021.];9(3):213-218. https://doi.org/10.2498/cit.2001.03.06
IEEE
J. Skorin-Kapov, D. Skorin-Kapov i V. Boljunčić, "On Delay versus Congestion in Designing Rearrangeable Multihop Lightwave Networks", Journal of computing and information technology, vol.9, br. 3, str. 213-218, 2001. [Online]. https://doi.org/10.2498/cit.2001.03.06

Sažetak
We investigate design issues of optical networks in light of two conflicting criteria: throughput maximization (or, equivalently, congestion minimization) versus delay minimization. We assume the network has an arbitrary topology, the flow can be split and sent via different routes, and it can be transferred via intermediate nodes. Tabu search heuristic is used to compare solutions with different weights assigned to each of the two criteria. The approach is tested on a benchmark data set, the 14-dimensional NSFNET T1 network with traffic from 1993. The results suggest that (1) some connectivity matrices are quite robust and desirable regarding both criteria simultaneously; (2) forcing minimization of total delay unconditionally can result with significantly inferior throughput. Some decisions strategies are outlined.

Hrčak ID: 44805

URI
https://hrcak.srce.hr/44805

Posjeta: 580 *