摘要: We argue for the development of efficient methods to update data plane state an SDN, while maintaining desired consistency properties (e.g., no packet should be dropped). highlight inherent trade-off between strength property and dependencies it imposes among rules at different switches; these fundamentally limit how quickly can updated. For one basic property---no loop---we develop algorithm that has provably minimal dependency structure. also sketch a general architecture consistent updates separates twin concerns efficiency.