{"id":{"repo_id":"umkc","oai_identifier":"oai:mospace.umsystem.edu:10355/8996"},"canonical_url":"https://search.dev.ndltd.org/etd/umkc/oai:mospace.umsystem.edu:10355/8996","repository":{"repo_id":"umkc","name":"University of Missouri - Kansas City","base_url":"https://mospace.umsystem.edu/oai/request"},"display":{"title":"A Study of Locator ID Separation Protocol","abstract":"Locator ID/Separation Protocol (LISP) aims at solving the issues in the current Internet Routing Architecture. The growth of the BGP routing table and Forwarding Information bases on core routers is very high. In addition, the number of BGP messages that are currently being processed by the BGP routers is a worrisome issue. Locator/ID Separation Protocol (LISP) is a recently proposed approach that provides a solution to these problems. By employing LISP, it is anticipated that significant scaling benefits can be achieved among which are the reduction of routing table sizes, traffic engineering capabilities, mobility without address changing. We present an analysis of how much these improvements are. Furthermore, a detailed study of this protocol is carried out and is compared against other solutions that are proposed along with an analysis of LISP as well.","abstract_html":"Locator ID/Separation Protocol (LISP) aims at solving the issues in the current Internet Routing Architecture. The growth of the BGP routing table and Forwarding Information bases on core routers is very high. In addition, the number of BGP messages that are currently being processed by the BGP routers is a worrisome issue. Locator/ID Separation Protocol (LISP) is a recently proposed approach that provides a solution to these problems. By employing LISP, it is anticipated that significant scaling benefits can be achieved among which are the reduction of routing table sizes, traffic engineering capabilities, mobility without address changing. We present an analysis of how much these improvements are. Furthermore, a detailed study of this protocol is carried out and is compared against other solutions that are proposed along with an analysis of LISP as well.","abstract_has_math":false,"creators":["Jain, Varun"],"institution":"University of Missouri--Kansas City","degree_name":"M.S.","degree_level":"Masters","degree_discipline":"Electrical Engineering (UMKC)","degree_department":null,"school":null,"contributors":[],"advisors":["Medhi, Deepankar"],"committee_chairs":[],"committee_members":[],"year":2010,"date_issued":"2010-11-09","date_published":"2010-11-09","updated_at":"2026-07-24T05:16:20Z","subjects":[],"languages":["en_US"],"rights":[],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/10355/8996","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Medhi, Deepankar"]},{"key":"dc:creator","label":"Author","values":["Jain, Varun"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2010-11-09T20:27:25Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2010-11-09T20:27:25Z"]},{"key":"dc:date.issued","label":"Date","values":["2010-11-09"]},{"key":"dc:publisher","label":"Institution","values":["University of Missouri--Kansas City"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Electrical Engineering (UMKC)"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Masters"]},{"key":"thesis:degree_name","label":"Degree Name","values":["M.S."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Missouri--Kansas City"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en_US"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/10355/8996"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Thesis advisor: Dr. Deep Medhi","Title from PDF of title page, viewed on November 9, 2010.","Includes bibliographic references (pages 74-75).","Thesis (M.S.)--School of Computing and Engineering. University of Missouri--Kansas City, 2010.","Vita."]},{"key":"dc:description.abstract","label":"Abstract","values":["Locator ID/Separation Protocol (LISP) aims at solving the issues in the current Internet Routing Architecture. The growth of the BGP routing table and Forwarding Information bases on core routers is very high. In addition, the number of BGP messages that are currently being processed by the BGP routers is a worrisome issue. Locator/ID Separation Protocol (LISP) is a recently proposed approach that provides a solution to these problems. By employing LISP, it is anticipated that significant scaling benefits can be achieved among which are the reduction of routing table sizes, traffic engineering capabilities, mobility without address changing. We present an analysis of how much these improvements are. Furthermore, a detailed study of this protocol is carried out and is compared against other solutions that are proposed along with an analysis of LISP as well."]},{"key":"dc:title","label":"Title","values":["A Study of Locator ID Separation Protocol"]}]}],"canonical_facts":{"dc:contributor.advisor":["Medhi, Deepankar"],"dc:creator":["Jain, Varun"],"dc:date.accessioned":["2010-11-09T20:27:25Z"],"dc:date.available":["2010-11-09T20:27:25Z"],"dc:date.issued":["2010-11-09"],"dc:description":["Thesis advisor: Dr. Deep Medhi","Title from PDF of title page, viewed on November 9, 2010.","Includes bibliographic references (pages 74-75).","Thesis (M.S.)--School of Computing and Engineering. University of Missouri--Kansas City, 2010.","Vita."],"dc:description.abstract":["Locator ID/Separation Protocol (LISP) aims at solving the issues in the current Internet Routing Architecture. The growth of the BGP routing table and Forwarding Information bases on core routers is very high. In addition, the number of BGP messages that are currently being processed by the BGP routers is a worrisome issue. Locator/ID Separation Protocol (LISP) is a recently proposed approach that provides a solution to these problems. By employing LISP, it is anticipated that significant scaling benefits can be achieved among which are the reduction of routing table sizes, traffic engineering capabilities, mobility without address changing. We present an analysis of how much these improvements are. Furthermore, a detailed study of this protocol is carried out and is compared against other solutions that are proposed along with an analysis of LISP as well."],"dc:identifier.uri":["http://hdl.handle.net/10355/8996"],"dc:language.iso":["en_US"],"dc:publisher":["University of Missouri--Kansas City"],"dc:title":["A Study of Locator ID Separation Protocol"],"dc:type":["Thesis"],"thesis:degree_discipline":["Electrical Engineering (UMKC)"],"thesis:degree_level":["Masters"],"thesis:degree_name":["M.S."],"thesis:institution_name":["University of Missouri--Kansas City"]},"updated_at":"2026-07-24T05:16:20Z"}