Computer Science – Discrete Mathematics
Scientific paper
2009-12-08
Internet Mathematics 7, 1 (2011) 45-66
Computer Science
Discrete Mathematics
Scientific paper
10.1080/15427951.2011.560786
Internet is a complex network composed by several networks: the Autonomous Systems, each one designed to transport information efficiently. Routing protocols aim to find paths between nodes whenever it is possible (i.e., the network is not partitioned), or to find paths verifying specific constraints (e.g., a certain QoS is required). As connectivity is a measure related to both of them (partitions and selected paths) this work provides a formal lower bound to it based on core-decomposition, under certain conditions, and low complexity algorithms to find it. We apply them to analyze maps obtained from the prominent Internet mapping projects, using the LaNet-vi open-source software for its visualization.
Alvarez-Hamelin José Ignacio
Busch Jorge Rodolfo
Gastón Beiró Mariano
No associations
LandOfFree
Understanding edge-connectivity in the Internet through core-decomposition does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Understanding edge-connectivity in the Internet through core-decomposition, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Understanding edge-connectivity in the Internet through core-decomposition will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-385529