Brief announcement: A randomized algorithm for label assignment in dynamic networks

0Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In large-scale networking environments, such as data centers, a key difficulty is the assignment of labels to network elements. Labels can be assigned statically, e.g. MAC-addresses in traditional Layer 2 networks, or by a central authority as in DHCP in Layer 3 networks. On the other hand, networks requiring a dynamic solution often use a Consensus-based state machine approach. While designing Alias [2], a protocol for automatically assigning hierarchically meaningful addresses in data center networks, we encountered an instance of label assignment with entirely different requirements. In this case, the rules for labels depend on connectivity, and connectivity (and hence, labels) changes over time. Thus, neither static assignment nor a state machine approach is ideal. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Walraed-Sullivan, M., Niranjan Mysore, R., Marzullo, K., & Vahdat, A. (2011). Brief announcement: A randomized algorithm for label assignment in dynamic networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6950 LNCS, pp. 326–327). https://doi.org/10.1007/978-3-642-24100-0_30

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free