TY - GEN
T1 - Alpaca
T2 - 11th ACM Conference on Emerging Networking Experiments and Technologies, CoNEXT 2015
AU - Kang, Nanxi
AU - Rottenstreich, Ori
AU - Rao, Sanjay
AU - Rexford, Jennifer L.
N1 - Funding Information:
We would like to thank the CoNEXT reviewers and our shepherd Richard Ma. This work was supported by the NSF grant TC-1111520 and the NSF Career Award No.0953622.
Publisher Copyright:
© 2015 ACM.
PY - 2015/12/1
Y1 - 2015/12/1
N2 - In enterprise networks, policies (e.g., QoS or security) are often defined based on the categorization of hosts along dimensions such as the organizational role of the host (faculty vs. student), and department (engineering vs. sales). While current best practices (VLANs) help when hosts are categorized along a single dimension, policy may often need to be expressed along multiple orthogonal dimensions. In this paper, we make three contributions. First, we argue for Attribute-Carrying IPs (ACIPs), where the IP address allocation process in enterprises considers attributes of a host along all policy dimensions. ACIPs enable flexible policy specification in a manner that may not otherwise be feasible owing to the limited size of switch rule-tables. Second, we present Alpaca, algorithms for realizing ACIPs under practical constraints of limited-length IP addresses. Our algorithms can be applied to different switch architectures, and we provide bounds on their performance. Third, we demonstrate the importance and viability of ACIPs on data collected from real campus networks.
AB - In enterprise networks, policies (e.g., QoS or security) are often defined based on the categorization of hosts along dimensions such as the organizational role of the host (faculty vs. student), and department (engineering vs. sales). While current best practices (VLANs) help when hosts are categorized along a single dimension, policy may often need to be expressed along multiple orthogonal dimensions. In this paper, we make three contributions. First, we argue for Attribute-Carrying IPs (ACIPs), where the IP address allocation process in enterprises considers attributes of a host along all policy dimensions. ACIPs enable flexible policy specification in a manner that may not otherwise be feasible owing to the limited size of switch rule-tables. Second, we present Alpaca, algorithms for realizing ACIPs under practical constraints of limited-length IP addresses. Our algorithms can be applied to different switch architectures, and we provide bounds on their performance. Third, we demonstrate the importance and viability of ACIPs on data collected from real campus networks.
UR - http://www.scopus.com/inward/record.url?scp=84995743361&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84995743361&partnerID=8YFLogxK
U2 - 10.1145/2716281.2836092
DO - 10.1145/2716281.2836092
M3 - Conference contribution
AN - SCOPUS:84995743361
T3 - Proceedings of the 11th ACM Conference on Emerging Networking Experiments and Technologies, CoNEXT 2015
BT - Proceedings of the 11th ACM Conference on Emerging Networking Experiments and Technologies, CoNEXT 2015
PB - Association for Computing Machinery, Inc
Y2 - 1 December 2015 through 4 December 2015
ER -