Stochastic performance evaluation of hierarchical routing for large networks

DOI10.1016/0376-5075(79)90004-7MaRDI QIDQ3862389zbMATH OpenOpenAlexFDO

Authors Farouk Kamoun, Leonard Kleinrock

Publication date 1979

Published in Computer Networks (1976) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0376-5075(79)90004-7

zbMATH Keywords

channel capacitycomputer communication networksdelayhierarchical routinglarge networksnetwork path lengthnetwork performance measuresnodal storagequeueing modelsrouting table lengththroughput

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of software (68N99)

Cited in

(4)

• On approximate distance labels and routing schemes with affine stretch
• On the efficiency of routing in sensor networks
• Interval routing schemes
• Closed-form formulas for cluster sizing for two-level hierarchical networks with source routing

This page was built for publication: Stochastic performance evaluation of hierarchical routing for large networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3862389)