The Mobile IPv6 protocol is a major solution to supply mobility services on the Internet. Many networking vendors have already implemented it in their operating systems and equipments. Moreover, it was recently selected to provide permanent IP addresses to end users of WiMAX and 3GPP2. Mobile IPv6 relies on a specific router called the home agent that hides location changes of the mobile nodes from the rest of the Internet. To do so, the mobile nodes' traffic must flow through the home agent. This mandatory deviation produces longer paths and higher communication delays. In order to solve these problems, we describe a new approach to address deployments of Mobile IPv6 based on graph theory and could be applied to any operator's network. In particular, we use notions of centrality in graphs to quantify increases of communication distances induced by dogleg routing and identify relevant home agents locations. We evaluate this approach using real-world network topologies and show that the obtained Mobile IPv6 performance could be close to direct paths ones. The proposed algorithm is generic and can be used to achieve efficient deployments of Mobile IPv6 as well as Home Agent Migration: a new Mobile IPv6 architecture using several distributed home agents.
- Community detection in attributed graphs.Christine Largeron2017, April 25, Room 24-25/405
- affinity index algorithm analysis antipaedo attack bipartite blog network blogs capitalisme social Cascade centrality clustering communities community detection community structure complex network complex networks complex systems compression connected graphs data mining debian degree distribution degree peeling diameter diffusion diffusion phenomena distributed measurements DynamicNetworks dynamics edge-Markovian evolving graph eDonkey ego-centered ego-centered communities email epidemiology event detection evolving graphs evolving networks exploration failure fixed points formal concepts gossip graph graph algorithm graph decompositions Graphs hierarchical clustering honeypot influence influence ranking interaction networks internal links internet Internet topology intrinsic time IP-level ip exchanges lattice leaders link prediction long term communities markovian model measurement mesure d’influence metrics Metrology mobile networks Modelling modularity multi-ego-centered communities multi-scale multipartite graph network dynamics node proximity node similarity opinion dynamics outliers p2p P2P dynamics P2P networks parametric paris paris-traceroute path-vector routing pedophile activity phone power-law radar random graph random walks reachability robustness routing routing tables scale-free security simulation simulations sir social networks spreading spreading cascades stability statistical analysis stochastic process three-state cellular automata time-varying Topology traceroute triangles twitter UDP user profiles viral marketing visualization web wifi