A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
The work focuses on dynamic weighted general graphs where the vertices of the graph are fixed, but the weights of the edges may change. ... This article studies approximate distributed routing schemes on dynamic communication networks. ... on general dynamic graphs. ...doi:10.1145/1383369.1383372 fatcat:5ddinfi5tjcctpzrms664go4pa
2008 IEEE International Zurich Seminar on Communications
While for homogeneous topologies the performance is comparable to geographical routing with a location service, our scheme comes with guarantees for a far larger class of graphs, including networks with ... Topology based routing schemes (see  and ) do not utilize the underlying geometry of wireless connectivity graphs, but instead compute routes based directly on that graph. ... While for homogeneous topologies the performance is comparable to geographical routing with a location service, our scheme comes with guarantees for a far larger class of graphs, including networks with ...doi:10.1109/izs.2008.4497262 fatcat:tj53twubdjdqlnejzbaisvsviy
Many open questions remain, but we believe the applicability of compact routing techniques to Internet interdomain routing is a research area whose potential payoff for the future of networking is too ... We are fortunate that a sister discipline, theory of distributed computation, has developed routing algorithms that offer promising potential for genuinely scalable routing on realistic Internet-like topologies ... The most vital open problem, the dynamic routing problem, is to construct truly dynamic schemes. All currently existing schemes are static. ...arXiv:cs/0508021v1 fatcat:5ewovi7ri5abxdfuki4kvcmb3m
We finally cross the gap from static to dynamic (optimal stretch) compact routing schemes, thus widening the applicability of such schemes to more realistic dynamic scenarios. ... More precisely, our schemes work on a dynamic set of nodes V in a metric of doubling dimension α = O(log log ∆) (where ∆ is the normalized diameter of the graph), use routing tables, label and packet headers ... shortest-path metric induced by the network: the dynamic graph G maintained by the routing scheme will correspond to the DHT overlay network. ...doi:10.1145/1400751.1400808 dblp:conf/podc/KonjevodRX08 fatcat:rhzpylaqvbeqpayargu4fpvtri
Consider a graph function f on pairs of vertices (for example, f can be the distance function). ... More generally, we address the model in which a query about vertices u and v can access also the labels of c other vertices. We term our generalized model labeling schemes with queries. ... Dynamic 1-query routing labeling schemes for the fixed port model When trying to translate our 1-query routing labeling scheme to the dynamic settings, we again translate using updates. ...doi:10.1016/j.tcs.2008.10.036 fatcat:kbz6erdkfzfmplmsitsmzmmmoe
scheme for high-speed dynamic networks. ... The authors present a family of hierarchical bubble schemes for dynamic routing in high-speed networks. The scheme is based on a hierarchical bubble partition of the network. ...
For each message, BusCast conservatively associates a routing graph rather than a fixed routing path with the message in order to adapt the dynamic of urban traffic. ... The main challenge in realizing this service is to provide efficient routing scheme with privacy preservation under highly dynamic urban traffic condition. ... For example, when k = 6, BusCast generates 9.3 hops traffic per packet when using dynamic contact graph during peak hours. ...doi:10.1109/tvt.2015.2466651 fatcat:frjd53rcffb5vh72b7d4uhytcq
Trusted routing can efficiently deliver data for different routing applications used in military, Fanets and mobile IoT. ... In this paper we propose Trust Aware Scheme for Moving nodes (TASM) which discovers efficient node by computing each node's trust value. ... considered which is essential for MANET routing Fig. 1 . 1 Throughput graph B. ...doi:10.35940/ijrte.f9596.059120 fatcat:mn2ikxgpkngldco6c2ciz2niom
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 ... routing scaling in the presence of network topology dynamics or host mobility. ... Routing schemes specialized for static Internet-like graphs scale essentially indefinitely, but in adding the associated updates required to handle dynamic graphs, we can no longer guarantee the required ...doi:10.1145/1273445.1273450 fatcat:umclhzou6facdf25c3pxnfrrhi
An f-labeling scheme for a family of graphs labels the vertices of all graphs in such that for every graph G∈ and every two vertices u,v∈ G, the value f(u,v) can be inferred by merely inspecting the labels ... This paper introduces a natural generalization: the notion of f-labeling schemes with queries, in which the value f(u,v) can be inferred by inspecting not only the labels of u and v but possibly the labels ... Two general translation methods for extending static labeling schemes on trees to the dynamic setting are considered in the literature. ...arXiv:cs/0609163v1 fatcat:adtz2ulsufcrzddgmzrxjlim4q
We propose three schemes to solve this problem borrowing established results from graph theory. ... We propose a managed VPN architecture for such a service highlighting the novelty in our architecture. ... For a simple case where the subgraph is a tree, this problem boils down to generating Steiner Tree graph with the link weights as a function of the residual capacity. ...doi:10.1109/icc.2006.254783 dblp:conf/icc/RavindranHT06 fatcat:p4v6kidxwjhitmjztfuwzwi5um
, focusing on compact localized schemes for message routing in communication networks. ... The survey concentrates mainly on combinatorial and algorithmic techniques, such as adjacency and distance labeling schemes and interval schemes for routing, and covers complexity results on various applications ... Finally, an interesting direction involves localized labeling schemes for the dynamic distributed setting, namely, distributed online schemes on dynamically changing networks. ...doi:10.1007/s00446-002-0073-5 fatcat:bqydpls23ncnnm57nnhmctnz3m
As a consequence, graphs that allow k-label interval routing schemes under dynamic cost edges have treewidth at most 4k. Similar results are shown for other types of interval routing schemes.” ... We show that for each fixed k > 1, the class of graphs allowing such routing schemes is closed under minor-taking in the domain of connected graphs, and hence has a linear-time recognition algorithm. ...
IFIP Advances in Information and Communication Technology
The second scheme is a more dynamic algorithm where both components, routing and wavelength assignment, are considered simultaneously. ... The first scheme is a simple semi-dynamic constraint-based routing and wavelength assignment (RWA) algorithm that compute solutions to three sub-problems: (a) The routing problem; (b) The constraint-based ... Static Routing Fig. 7 . 7 Dynamic ----~--~----~-~----J Fig. 8. Dynamic RWA schemes in 4 fibersllink network ...doi:10.1007/978-0-387-35491-0_25 fatcat:uonf2wty3zdo3hfgovqflwp2ya
A number of routing algorithms based on learning automata technique have been proposed for communication networks. ... In this paper, a comprehensive study is launched to investigate the performance of LASPA, the first learning automata based solution to the dynamic shortest path routing, across different graph structures ... A number of routing algorithms based on LA theory have been proposed for dynamic shortest path routing in communication networks. ...doi:10.5281/zenodo.1329209 fatcat:3e7zgijwanahzim3injops4rrq
« Previous Showing results 1 — 15 out of 93,623 results