A tradeoff between space and efficiency for routing tables

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 1988, Pages 43-52

  Peleg, David ^a   Upfal, Eli ^a,b  

^a STANFORD UNIVERSITY   (United States)

^b IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EFFICIENCY; ELECTRIC NETWORK TOPOLOGY; TELECOMMUNICATION NETWORKS;

GENERAL NETWORKS; HIERARCHICAL ROUTINGS; NETWORK TOPOLOGY; ROUTING INFORMATION; ROUTING MESSAGE; ROUTING SCHEME; SPACE REQUIREMENTS; UPPER AND LOWER BOUNDS;

ROUTING PROTOCOLS;

EID: 33745594334     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/62212.62217     Document Type: Conference Paper

References (0)