Filters








49,556 Hits in 5.1 sec

Routing Flow Through a Strongly Connected Graph

Erlebach, Hagerup
2002 Algorithmica  
It is shown that, for every strongly connected network in which every edge has capacity at least , linear time su ces to send ow from source vertices, each with a given supply, to sink vertices, each with  ...  This problem arises in a new maximumow algorithm of Goldberg and Rao.  ...  The second author is grateful to Peter Sanders and Jesper Tr a for many useful discussions and for proving his rst algorithm incorrect.  ... 
doi:10.1007/s00453-001-0082-y fatcat:xo5mfssd4nganl42dkydmv5gy4

A contract-based model for directed network formation

Ramesh Johari, Shie Mannor, John N. Tsitsiklis
2006 Games and Economic Behavior  
We consider a network game where the nodes of the network wish to form a graph to route traffic between themselves.  ...  We present a model where costs are incurred for routing traffic, as well as for a lack of network connectivity.  ...  We will assume that the routing ≺ ranks routes passing through node 3 higher than routes passing through node 4; thus, for example, when routing from node 1 to node 4, all traffic flows over route 134  ... 
doi:10.1016/j.geb.2005.08.010 fatcat:hr3j5hivl5efdo44ecn6rq7imu

Event processing for complicated routes in VRML 2.0

Masaaki Taniguchi
1998 Proceedings of the third symposium on Virtual reality modeling language - VRML '98  
However it makes browser implementation difficult in routing connections that involve complicated requirements such as simultaneous events in multiple fields of a node, or cyclic dependencies between nodes  ...  VRML 2.0 allows a content creator to dynamically control state changes in a virtual reality world by defining routes of events over VRML 2.0 nodes.  ...  Generating A Dag The first step in deciding the order of evaluation is to divide a route graph by the strongly connected components. The route graph formed by the components is a dag.  ... 
doi:10.1145/271897.274396 dblp:conf/vrml/Taniguchi98 fatcat:yk6wywlztvazdo7vphjh6hy3fi

Charting the Complexity Landscape of Waypoint Routing [article]

Saeed Akhoondian Amiri, Klaus-Tycho Foerster, Riko Jacob, Stefan Schmid
2017 arXiv   pre-print
Modern computer networks support interesting new routing models in which traffic flows from a source s to a destination t can be flexibly steered through a sequence of waypoints, such as (hardware) middleboxes  ...  This paper shows that the waypoint routing problem features a deep combinatorial structure, and we establish interesting connections to several classic graph theoretical problems.  ...  waypoints are not flow-conserving, computing a route through a single waypoint is strongly NP-complete.  ... 
arXiv:1705.00055v2 fatcat:ri57leaobvac3kuihaumcpblzu

Egalitarian Graph Orientations

Glencora Borradaile, Jennifer Iglesias, Theresa Migler, Antonio Ochoa, Gordon Wilfong, Lisa Zhang
2017 Journal of Graph Algorithms and Applications  
We give optimal, polynomial-time algorithms for: finding an orientation that minimizes the lexicographic order of the indegrees and finding a strongly-connected orientation that minimizes the maximum indegree  ...  Given an undirected graph, one can assign directions to each of the edges of the graph, thus orienting the graph.  ...  Given an ear decomposition of a strongly-connected graph, we can define the routing tables using the procedure Routing below. We will define a cyclic ordering L of the vertices.  ... 
doi:10.7155/jgaa.00435 fatcat:yvsblr454fhx5dumeji74agvse

On the Effectiveness of the 2-hop Routing Strategy in Mobile Ad Hoc Networks

M. Garetto, P. Giaccone, E. Leonardi
2007 2007 IEEE International Conference on Communications  
First, we provide a formal definition of optimal routing maximizing the throughput of a mobile ad hoc network, in terms of a multi-commodity flow problem over the associated contact graph.  ...  Then, we relate the effectiveness of the 2-hop routing strategy to structural properties of the contact graph.  ...  Therefore, the routing problem through the mobile ad hoc network adopting S 0 can be formalized in terms of a multi-commodity flow problem on the contact graph.  ... 
doi:10.1109/icc.2007.516 dblp:conf/icc/GarettoGL07 fatcat:vclyuxs4ffftzduwhdtgawsnve

Waypoint Routing in Special Networks

Saeed Akhoondian Amiri, Klaus-Tycho Foerster, Riko Jacob, Mahmoud Parham, Stefan Schmid
2018 2018 IFIP Networking Conference (IFIP Networking) and Workshops  
Waypoint routing is a novel communication model in which traffic is steered through one or multiple so-called waypoints along the route from source to destination.  ...  Finally, we extend the study of waypoint routing to special directed graph classes, in particular bidirected graphs.  ...  Theorem 4: The problem of routing through an arbitrary number of waypoints is strongly NP-complete on undirected graphs of treewidth at most 3.  ... 
doi:10.23919/ifipnetworking.2018.8696560 dblp:conf/networking/AmiriFJP018 fatcat:x3p3knsw25co7lwv63pqh7fscm

On the multiple unicast network coding, conjecture

Michael Langberg, Muriel Medard
2009 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)  
In this paper, we study the multiple unicast network communication problem on undirected graphs.  ...  Loosely speaking, we show that under certain (strong) connectivity requirements the advantage of network coding is indeed bounded by 3.  ...  CONCLUSIONS We have shown that, in undirected graphs that are r-strongly connected, the use of network coding for k-multicast is comparable (within a factor of 3) to the routing rate of an arbitrary set  ... 
doi:10.1109/allerton.2009.5394800 fatcat:7v7bebc6drgzbfduqhyf6xtqxy

On the Capacity Region of MANET: Scheduling and Routing Strategy

M. Garetto, P. Giaccone, E. Leonardi
2009 IEEE Transactions on Vehicular Technology  
We identify the class of scheduling policies achieving maximum throughput and introduce a joint scheduling and routing formulation that maps the problem into a multicommodity flow over an associated contact  ...  Previous capacity results have been derived under the strong assumption that nodes are identical and uniformly visit the entire network area, resulting in a fully connected homogeneous contact graph in  ...  Therefore, the routing problem through the mobile ad hoc network adopting S can be formalized in terms of a multicommodity flow problem on the contact graph.  ... 
doi:10.1109/tvt.2008.2004621 fatcat:jyf23g2czbdchflaevla7kdsme

Page 7582 of Mathematical Reviews Vol. , Issue 94m [page]

1994 Mathematical Reviews  
A network is defined by an ordered pair (G, R), where G is a connected graph and R is a routing of G.  ...  Summary: “For a given connected graph G of order n, a routing R is a set of n(n — 1) simple paths R(x, y) specified for every ordered pair (x,y) of vertices in G.  ... 

Reliability of Connections in Multilayer Networks under Shared Risk Groups and Costs Constraints

D. Coudert, F. Huc, F. Peix, M.-E. Voge
2008 2008 IEEE International Conference on Communications  
The reliability of a connection therefore depends on the number of SRRGs through which it is routed. Consequently, this number has to be minimized.  ...  The main result of our work is a column generation formulation that allows to solve efficiently the problem of maximizing the reliability of a set of connection requests in MPLS/WDM mesh networks with  ...  In such multilayer networks with SRGs, the reliability of a connection is measured as a function of the SRGs through which it is routed.  ... 
doi:10.1109/icc.2008.971 dblp:conf/icc/CoudertHPV08 fatcat:ewvzqzufirhavlwtqgwrfeenpu

Cross-Layer Network Survivability Under Multiple Cross-Layer Metrics

Zhili Zhou, Tachun Lin, Krishnaiyan Thulasiraman, Guoliang Xue, Sartaj Sahni
2015 Journal of Optical Communications and Networking  
the end nodes of a logical link such that the logical topology remains connected after a physical link fails.  ...  Given a cross-layer network with logical and physical topologies, the survivable logical topology routing problem is to route each link in the logical layer with a path in the physical topology between  ...  Constraints (5)-(6) push a flow of value ρ st through the logical layer routing selected for logical link (s, t).  ... 
doi:10.1364/jocn.7.000540 fatcat:q7s44kumazgybpcglleomcdvvm

Analysis of a Forwarding Game without Payments

George Karakostas, Anastasios Viglas
2012 2012 13th International Conference on Parallel and Distributed Computing, Applications and Technologies  
We consider a forwarding game on directed graphs where nodes need to send certain amount of flow (packets) to specific destinations, possibly through several relay nodes.  ...  Somewhat surprisingly, this game has possibly several strategies that allow a significant amount of the flow to be routed while all nodes have a positive outcome, which suggest that in this model the nodes  ...  Powerlaw graphs exhibit a small strongly connected nodes with a long tail of less connected nodes.  ... 
doi:10.1109/pdcat.2012.53 dblp:conf/pdcat/KarakostasV12 fatcat:ndgod72oxbe2zp6dti7vxowb3y

The All-or-Nothing Flow Problem in Directed Graphs with Symmetric Demand Pairs [chapter]

Chandra Chekuri, Alina Ene
2014 Lecture Notes in Computer Science  
A subset M of the pairs is routable if there is a feasible multicommodity flow in G such that, for each pair s i t i ∈ M , the amount of flow from s i to t i is at least one and the amount of flow from  ...  The input consists of a directed graph G = (V, E) and a collection of (unordered) pairs of nodes M = {s 1 t 1 , s 2 t 2 , . . . , s k t k }.  ...  . , K be a topological ordering of the strongly connected components of G − C in which each edge of G − C connecting different strongly connected components is oriented from right to left.  ... 
doi:10.1007/978-3-319-07557-0_19 fatcat:6vl6trtwb5aujbq3m2ctbzneeq

The all-or-nothing flow problem in directed graphs with symmetric demand pairs

Chandra Chekuri, Alina Ene
2014 Mathematical programming  
A subset M of the pairs is routable if there is a feasible multicommodity flow in G such that, for each pair s i t i ∈ M , the amount of flow from s i to t i is at least one and the amount of flow from  ...  The input consists of a directed graph G = (V, E) and a collection of (unordered) pairs of nodes M = {s 1 t 1 , s 2 t 2 , . . . , s k t k }.  ...  . , K be a topological ordering of the strongly connected components of G − C in which each edge of G − C connecting different strongly connected components is oriented from right to left.  ... 
doi:10.1007/s10107-014-0856-z fatcat:l4cjh42tf5evbeprkaikfqwlte
« Previous Showing results 1 — 15 out of 49,556 results