{"id":{"repo_id":"birmingham","oai_identifier":"oai:etheses.bham.ac.uk:434"},"canonical_url":"https://search.dev.ndltd.org/etd/birmingham/oai:etheses.bham.ac.uk:434","repository":{"repo_id":"birmingham","name":"University of Birmingham","base_url":"https://etheses.bham.ac.uk/cgi/oai2"},"display":{"title":"Chain Routing: A novel routing framework for increasing resilience and stability in the Internet","abstract":"This study investigates the Internet's resilience to instabilities caused by the mismatch of its topological state and routing information. A first numerical analysis proves that the Internet possesses unused path diversity which could be employed to strengthen its resilience to failures. Therefore, a new routing framework called Chain Routing, which takes advantage of such path diversity, is proposed. This novel idea is based in the mathematical concept of complete order, which is a binary relation that is irreflexive, asymmetric, transitive and complete. More important is the fact that complete orders, when represented as a graph, are the most connected digraph that does not contain any cycles. Consequently, a complete order could be applied to route information from a source to a destination with the guarantee that cycles will not develop in a path. A second numerical analysis demonstrates the feasibility of implementing Chain Routing as part of a routing protocol. Finally, an analysis is presented on how network stability could be maintained if a routing protocol integrates complete orders in time and topology.","abstract_html":"This study investigates the Internet's resilience to instabilities caused by the mismatch of its topological state and routing information. A first numerical analysis proves that the Internet possesses unused path diversity which could be employed to strengthen its resilience to failures. Therefore, a new routing framework called Chain Routing, which takes advantage of such path diversity, is proposed. This novel idea is based in the mathematical concept of complete order, which is a binary relation that is irreflexive, asymmetric, transitive and complete. More important is the fact that complete orders, when represented as a graph, are the most connected digraph that does not contain any cycles. Consequently, a complete order could be applied to route information from a source to a destination with the guarantee that cycles will not develop in a path. A second numerical analysis demonstrates the feasibility of implementing Chain Routing as part of a routing protocol. Finally, an analysis is presented on how network stability could be maintained if a routing protocol integrates complete orders in time and topology.","abstract_has_math":false,"creators":["Arjona Villicaña, Pedro David"],"institution":"University of Birmingham","degree_name":"d_ph","degree_level":"d_ph","degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2010,"date_issued":"2010-07","date_published":"2010-07","updated_at":"2026-07-24T01:10:55Z","subjects":["TK Electrical engineering. Electronics Nuclear engineering"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":null,"outbound_label":null,"outbound_source":null},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.sponsor","label":"Sponsor","values":["other"]},{"key":"dc:creator","label":"Author","values":["Arjona Villicaña, Pedro David"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2010-07"]},{"key":"dc:date.issued","label":"Date","values":["2010-07"]},{"key":"dc:publisher.department","label":"Dc Publisher Department","values":["College of Engineering & Physical Sciences","School of Engineering, Department of Electronic, Electrical and Systems Engineering"]},{"key":"dc:publisher.institution","label":"Dc Publisher Institution","values":["University of Birmingham"]},{"key":"dc:relation.isreferencedby","label":"Dc Relation Isreferencedby","values":["http://etheses.bham.ac.uk//id/eprint/434/"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"dc:type.qualificationlevel","label":"Dc Type Qualificationlevel","values":["d_ph"]},{"key":"dc:type.qualificationname","label":"Dc Type Qualificationname","values":["d_ph"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["TK Electrical engineering. Electronics Nuclear engineering"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://etheses.bham.ac.uk//id/eprint/434/1/arjona09PhD.pdf","http://etheses.bham.ac.uk//id/eprint/434/2/Decl_IS_Arjona09Phd.pdf"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["This study investigates the Internet's resilience to instabilities caused by the mismatch of its topological state and routing information. A first numerical analysis proves that the Internet possesses unused path diversity which could be employed to strengthen its resilience to failures. Therefore, a new routing framework called Chain Routing, which takes advantage of such path diversity, is proposed. This novel idea is based in the mathematical concept of complete order, which is a binary relation that is irreflexive, asymmetric, transitive and complete. More important is the fact that complete orders, when represented as a graph, are the most connected digraph that does not contain any cycles. Consequently, a complete order could be applied to route information from a source to a destination with the guarantee that cycles will not develop in a path. A second numerical analysis demonstrates the feasibility of implementing Chain Routing as part of a routing protocol. Finally, an analysis is presented on how network stability could be maintained if a routing protocol integrates complete orders in time and topology."]},{"key":"dc:format","label":"Dc Format","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Chain Routing: A novel routing framework for increasing resilience and stability in the Internet"]}]}],"canonical_facts":{"dc:contributor.sponsor":["other"],"dc:creator":["Arjona Villicaña, Pedro David"],"dc:date":["2010-07"],"dc:date.issued":["2010-07"],"dc:description.abstract":["This study investigates the Internet's resilience to instabilities caused by the mismatch of its topological state and routing information. A first numerical analysis proves that the Internet possesses unused path diversity which could be employed to strengthen its resilience to failures. Therefore, a new routing framework called Chain Routing, which takes advantage of such path diversity, is proposed. This novel idea is based in the mathematical concept of complete order, which is a binary relation that is irreflexive, asymmetric, transitive and complete. More important is the fact that complete orders, when represented as a graph, are the most connected digraph that does not contain any cycles. Consequently, a complete order could be applied to route information from a source to a destination with the guarantee that cycles will not develop in a path. A second numerical analysis demonstrates the feasibility of implementing Chain Routing as part of a routing protocol. Finally, an analysis is presented on how network stability could be maintained if a routing protocol integrates complete orders in time and topology."],"dc:format":["application/pdf"],"dc:identifier.uri":["http://etheses.bham.ac.uk//id/eprint/434/1/arjona09PhD.pdf","http://etheses.bham.ac.uk//id/eprint/434/2/Decl_IS_Arjona09Phd.pdf"],"dc:publisher.department":["College of Engineering & Physical Sciences","School of Engineering, Department of Electronic, Electrical and Systems Engineering"],"dc:publisher.institution":["University of Birmingham"],"dc:relation.isreferencedby":["http://etheses.bham.ac.uk//id/eprint/434/"],"dc:subject":["TK Electrical engineering. Electronics Nuclear engineering"],"dc:title":["Chain Routing: A novel routing framework for increasing resilience and stability in the Internet"],"dc:type":["Thesis"],"dc:type.qualificationlevel":["d_ph"],"dc:type.qualificationname":["d_ph"]},"updated_at":"2026-07-24T01:10:55Z"}