TY - GEN
T1 - Taming uncertainty in distributed systems with help from the network
AU - Leners, Joshua B.
AU - Gupta, Trinabh
AU - Aguilera, Marcos K.
AU - Walfish, Michael
PY - 2015/4/17
Y1 - 2015/4/17
N2 - Network and process failures cause complexity in distributed applications. When a remote process does not respond, the application cannot tell if the process or network have failed, or if they are just slow. Without this information, applications can lose availability or correctness. To address this problem, we propose Albatross, a service that quickly reports to applications the current status of a remote process-whether it is working and reachable, or not. Albatross is targeted at data centers equipped with software defined networks (SDNs), allowing it to discover and enforce network partitions: Albatross borrows the old observation that it can be better to cause a problem than to live with uncertainty, and applies this idea to networks. When enforcing partitions, Albatross avoids disruption by disconnecting only individual processes (not entire hosts), and by allowing them to reconnect if the application chooses. We show that, under Albatross, distributed applications can bypass the complexity caused by network failures and that they become more available.
AB - Network and process failures cause complexity in distributed applications. When a remote process does not respond, the application cannot tell if the process or network have failed, or if they are just slow. Without this information, applications can lose availability or correctness. To address this problem, we propose Albatross, a service that quickly reports to applications the current status of a remote process-whether it is working and reachable, or not. Albatross is targeted at data centers equipped with software defined networks (SDNs), allowing it to discover and enforce network partitions: Albatross borrows the old observation that it can be better to cause a problem than to live with uncertainty, and applies this idea to networks. When enforcing partitions, Albatross avoids disruption by disconnecting only individual processes (not entire hosts), and by allowing them to reconnect if the application chooses. We show that, under Albatross, distributed applications can bypass the complexity caused by network failures and that they become more available.
UR - http://www.scopus.com/inward/record.url?scp=84929590674&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84929590674&partnerID=8YFLogxK
U2 - 10.1145/2741948.2741976
DO - 10.1145/2741948.2741976
M3 - Conference contribution
AN - SCOPUS:84929590674
T3 - Proceedings of the 10th European Conference on Computer Systems, EuroSys 2015
BT - Proceedings of the 10th European Conference on Computer Systems, EuroSys 2015
PB - Association for Computing Machinery
T2 - 10th European Conference on Computer Systems, EuroSys 2015
Y2 - 21 April 2015 through 24 April 2015
ER -