Optimization of hierarchical routing protocols

DOI10.1016/S0166-5316(00)00009-2zbMath1052.68530OpenAlexW1980206093MaRDI QIDQ4779361

A. Gravey, Jean-Louis Rougier, Daniel Kofman

Publication date: 24 June 2003

Published in: Performance Evaluation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-5316(00)00009-2

zbMATH Keywords

network performanceclustering process

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Network protocols (68M12)

Related Items (2)

The complexity of routing in~hierarchical PNNI networks ⋮ The expected length of a random line segment in a rectangle.

This page was built for publication: Optimization of hierarchical routing protocols