Related papers: Analytical correlation of routing table length ind…
In recent years, we have established the iteration theory of the index for symplectic matrix paths and applied it to periodic solution problems of nonlinear Hamiltonian systems. This paper is a survey on these results.
This paper criticises the notion that long-range dependence is an important contributor to the queuing behaviour of real Internet traffic. The idea is questioned in two different ways. Firstly, a class of models used to simulate Internet…
This paper criticises the notion that long-range dependence is an important contributor to the queuing behaviour of real Internet traffic. The idea is questioned in two different ways. Firstly, a class of models used to simulate Internet…
Xiong and Liu [L. Xiong and Z. Liu, Hamiltonian iterated line graphs, Discrete Math. 256 (2002) 407-422] gave a characterization of the graphs $G$ for which the $n$-th iterated line graph $L^n(G)$ is hamiltonian, for $n\ge2$. In this paper,…
We investigate simplified models of computer data networks and examine how the introduction of additional random links influences the performance of these net works. In general, the impact of additional random links on the performance of…
Index maps taking values in the $K$-theory of a mapping cone are defined and discussed. The resulting index theorem can be viewed in analogy with the Freed-Melrose index theorem. The framework of geometric $K$-homology is used in a…
The space-requirement for routing-tables is an important characteristic of routing schemes. For the cost-measure of minimizing the total network load there exist a variety of results that show tradeoffs between stretch and required size for…
Network theory and inverse modeling are two standard tools of applied physics, whose combination is needed when studying the dynamical organization of spatially distributed systems from indirect measurements. However, the associated…
This paper critically examines some propositions and arguments of cs.NI/0508021 regarding applicability of hierarchical routing and perspectives of compact routing. Arguments against the former are found to be inaccurate while the latter is…
The generalized $H(n)$ Hirsch index of order $n$ has been recently introduced and shown to interpolate between the degree and the $K$-core centrality in networks. We provide a detailed analytical characterization of the properties of sets…
In this work, we present an alternative definition of the Le Roux index, which generalizes the Poincar\'e-Hopf index for non-singular planar flows to the broader setting of Brouwer homeomorphisms. This new approach answers a question raised…
Information theory has been taken as a prospective tool for quantifying the complexity of complex networks. In this paper, we first study the information entropy or uncertainty of a path using the information theory. Then we apply the path…
In recent work, Kobayashi observed that the acceptance by an alternating tree automaton A of an infinite tree T generated by a higher-order recursion scheme G may be formulated as the typability of the recursion scheme G in an appropriate…
We investigate individual packet delay in a model of data networks with table-free, partial table and full table routing. We present analytical estimation for the average packet delay in a network with small partial routing table.…
While there exist compact routing schemes designed for grids, trees, and Internet-like topologies that offer routing tables of sizes that scale logarithmically with the network size, we demonstrate in this paper that in view of recent…
We present a novel heuristic algorithm for routing optimization on complex networks. Previously proposed routing optimization algorithms aim at avoiding or reducing link overload. Our algorithm balances traffic on a network by minimizing…
Binary relations are one of the standard ways to encode, characterise and reason about graphs. Relation algebras provide equational axioms for a large fragment of the calculus of binary relations. Although relations are standard tools in…
In this work we propose the use of a hirarchical extension of the polygonality index as a means to characterize and model geographical networks: each node is associated with the spatial position of the nodes, while the edges of the network…
A topological index reflects the physical, chemical and structural properties of a molecule, and its study has an important role in molecular topology, chemical graph theory and mathematical chemistry. It is a natural problem to…
Motivated by the increasing availability of vehicle trajectory data, we propose learn-to-route, a comprehensive trajectory-based routing solution. Specifically, we first construct a graph-like structure from trajectories as the routing…