Advisor Information
Dr. Hesham H. Ali
Presentation Type
Oral Presentation
Abstract
Within the scope of a Wide Area Network (WAN), a large geographical communication network in which a collection of networking devices communicate data to each other, an example being the spanning communication network, known as the Internet, around continents. Within WANs exists a collection of Routers that transfer network packets to other devices. An issue pertinent to WANs is their immeasurable size and density, as we are not sure of the amount, or the scope, of all the devices that exists within the network. By tracing the routes and transits of data that traverses within the WAN, we can identify routers and create both the paths and weights between devices that are communicating. However, there is the issue of hidden routers who transfer data but do not identify themselves to identification requests like Traceroute, and the undocumented edges between Routers. Like a blackbox function that outputs data in a way that we do not know the interior mechanics, we do not know all the internal components that manage the traffic within the WAN. Finding out is called the Anonymous Routing Blackbox Problem, and we will use labelled graphs, vertex and edge coloring, and pathfinding to derive solutions.
Scheduling Link
1
Included in
Databases and Information Systems Commons, Information Security Commons, Other Computer Sciences Commons, Other Mathematics Commons, Systems Architecture Commons
Using Graph Theoretical Methods and Traceroute to Visually Represent Hidden Networks
Within the scope of a Wide Area Network (WAN), a large geographical communication network in which a collection of networking devices communicate data to each other, an example being the spanning communication network, known as the Internet, around continents. Within WANs exists a collection of Routers that transfer network packets to other devices. An issue pertinent to WANs is their immeasurable size and density, as we are not sure of the amount, or the scope, of all the devices that exists within the network. By tracing the routes and transits of data that traverses within the WAN, we can identify routers and create both the paths and weights between devices that are communicating. However, there is the issue of hidden routers who transfer data but do not identify themselves to identification requests like Traceroute, and the undocumented edges between Routers. Like a blackbox function that outputs data in a way that we do not know the interior mechanics, we do not know all the internal components that manage the traffic within the WAN. Finding out is called the Anonymous Routing Blackbox Problem, and we will use labelled graphs, vertex and edge coloring, and pathfinding to derive solutions.