@booklet {1698181,
	title = {Routing with Byzantine robustness},
	year = {2005},
	publisher = {Sun Microsystems, Inc.},
	address = {Mountain View, CA, USA},
	abstract = {This paper describes how a network can continue to function in the presence of Byzantine failures. A Byzantine failure is one in which a node, instead of halting (as it would in a fail-stop failure), continues to operate, but incorrectly. It might lie about routing information, perform the routing algorithm itself flawlessly, but then fail to forward some class of packets correctly, or flood the network with garbage traffic. Our goal is to design a network so that as long as one nonfaulty path connects nonfaulty nodes A and B, they will be able to communicate, with some fair share of bandwidth, even if all the other components in the network are maximally malicious. We review work from 1988 that presented a network design that had that property, but required the network to be small enough so that every router could keep state proportional to n2, where n is the total number of nodes in the network. This would work for a network of size on the order of a thousand nodes, but to build a large network, we need to introduce hierarchy. This paper presents a new design, building on the original work, that works with hierarchical networks. This design not only defends against malicious routers, but because it guarantees fair allocation of resources, can mitigate against many other types of denial of service attacks.},
	keywords = {routing},
	url = {http://portal.acm.org/citation.cfm?id=1698181$\#$},
	author = {Perlman, Radia}
}

{"_id":"ieXA4S9R2w57Dd23k","bibbaseid":"perlman-routingwithbyzantinerobustness-2005","downloads":0,"creationDate":"2018-07-03T04:50:27.502Z","title":"Routing with Byzantine robustness","author_short":["Perlman, R."],"year":2005,"bibtype":"booklet","biburl":"https://gnunet.org/bibliography/export/bibtex","bibdata":{"bibtype":"booklet","type":"booklet","title":"Routing with Byzantine robustness","year":"2005","publisher":"Sun Microsystems, Inc.","address":"Mountain View, CA, USA","abstract":"This paper describes how a network can continue to function in the presence of Byzantine failures. A Byzantine failure is one in which a node, instead of halting (as it would in a fail-stop failure), continues to operate, but incorrectly. It might lie about routing information, perform the routing algorithm itself flawlessly, but then fail to forward some class of packets correctly, or flood the network with garbage traffic. Our goal is to design a network so that as long as one nonfaulty path connects nonfaulty nodes A and B, they will be able to communicate, with some fair share of bandwidth, even if all the other components in the network are maximally malicious. We review work from 1988 that presented a network design that had that property, but required the network to be small enough so that every router could keep state proportional to n2, where n is the total number of nodes in the network. This would work for a network of size on the order of a thousand nodes, but to build a large network, we need to introduce hierarchy. This paper presents a new design, building on the original work, that works with hierarchical networks. This design not only defends against malicious routers, but because it guarantees fair allocation of resources, can mitigate against many other types of denial of service attacks.","keywords":"routing","url":"http://portal.acm.org/citation.cfm?id=1698181$#$","author":[{"propositions":[],"lastnames":["Perlman"],"firstnames":["Radia"],"suffixes":[]}],"bibtex":"@booklet {1698181,\n\ttitle = {Routing with Byzantine robustness},\n\tyear = {2005},\n\tpublisher = {Sun Microsystems, Inc.},\n\taddress = {Mountain View, CA, USA},\n\tabstract = {This paper describes how a network can continue to function in the presence of Byzantine failures. A Byzantine failure is one in which a node, instead of halting (as it would in a fail-stop failure), continues to operate, but incorrectly. It might lie about routing information, perform the routing algorithm itself flawlessly, but then fail to forward some class of packets correctly, or flood the network with garbage traffic. Our goal is to design a network so that as long as one nonfaulty path connects nonfaulty nodes A and B, they will be able to communicate, with some fair share of bandwidth, even if all the other components in the network are maximally malicious. We review work from 1988 that presented a network design that had that property, but required the network to be small enough so that every router could keep state proportional to n2, where n is the total number of nodes in the network. This would work for a network of size on the order of a thousand nodes, but to build a large network, we need to introduce hierarchy. This paper presents a new design, building on the original work, that works with hierarchical networks. This design not only defends against malicious routers, but because it guarantees fair allocation of resources, can mitigate against many other types of denial of service attacks.},\n\tkeywords = {routing},\n\turl = {http://portal.acm.org/citation.cfm?id=1698181$\\#$},\n\tauthor = {Perlman, Radia}\n}\n","author_short":["Perlman, R."],"key":"1698181","id":"1698181","bibbaseid":"perlman-routingwithbyzantinerobustness-2005","role":"author","urls":{"Paper":"http://portal.acm.org/citation.cfm?id=1698181$#$"},"keyword":["routing"],"downloads":0},"search_terms":["routing","byzantine","robustness","perlman"],"keywords":["routing"],"authorIDs":[],"dataSources":["FWsPTwsmjtrBtRS3B"]}