Results 1  10
of
137
ShortestPath and HotPotato Routing on Unbuffered Toroidal Networks
 Proc. IEEE Conf. Global Comm
, 1998
"... We probabilistically model dynamic packet routing on unbuffered 2D and 3D toroidal networks. We consider shortestpath routing with packet loss and retransmissions versus a newly proposed alllink busy (ALB) hotpotato routing strategy with packet deflections. Computations of the sustained packet ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
generating rate, node throughput, and average packet latency indicate that the proposed ALB strategy is a much better alternative to a shortestpath routing on unbuffered tori. It achieves an almost optimal sustained packet generating rate, nearoptimal latency, and acceptable node throughput. 1 Introduction
Shortest Paths in Microseconds
"... Computing shortest paths is a fundamental primitive for several social network applications including sociallysensitive ranking, locationaware search, social auctions and social network privacy. Since these applications compute paths in response to a user query, the goal is to minimize latency whil ..."
Abstract
 Add to MetaCart
Computing shortest paths is a fundamental primitive for several social network applications including sociallysensitive ranking, locationaware search, social auctions and social network privacy. Since these applications compute paths in response to a user query, the goal is to minimize latency
ROME: Routing On Metropolitanscale Ethernet
"... Abstract—We present the architecture and protocols of ROME, a layer2 network designed to be backwards compatible with Ethernet and scalable to tens of thousands of switches and millions of end hosts. ROME is based upon a recently developed geographic routing protocol, greedy distance vector (GDV). ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
level eventdriven simulator, in which ROME protocols are implemented in detail, show that ROME protocols are efficient and scalable to metropolitan size. Furthermore, ROME protocols are highly resilient to network dynamics. The routing latency of ROME is only slightly higher than shortestpath latency
1A Scalable and Resilient Layer2 Network with Ethernet Compatibility
, 2013
"... Abstract—We present the architecture and protocols of ROME, a layer2 network designed to be backwards compatible with Ethernet and scalable to tens of thousands of switches and millions of end hosts. Such largescale networks are needed for emerging applications including data center networks, wide ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
. Furthermore, ROME protocols are highly resilient to network dynamics. The routing latency of ROME is only slightly higher than shortestpath latency. To demonstrate scalability, we provide simulation performance results for ROME networks with up to 25,000 switches and 1.25 million hosts. I.
Shortest paths in less than a millisecond
 ACM SIGCOMM Workshop on Online Social Networks (WOSN
, 2012
"... We consider the problem of answering pointtopoint shortest path queries on massive social networks. The goal is to answer queries within tens of milliseconds while minimizing the memory requirements. We present a technique that achieves this goal for an extremely large fraction of path queries by ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
We consider the problem of answering pointtopoint shortest path queries on massive social networks. The goal is to answer queries within tens of milliseconds while minimizing the memory requirements. We present a technique that achieves this goal for an extremely large fraction of path queries
The Directed Minimum Latency Problem
"... We study the directed minimum latency problem: given an nvertex asymmetric metric (V, d) with a root vertex r ∈ V, find a spanning path originating at r that minimizes the sum of latencies at all vertices (the latency of any vertex v ∈ V is the distance from r to v along the path). This problem has ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
for the asymmetric traveling salesman path problem [13, 5]. We prove an upper bound ρ = O ( √ n), which implies (for any fixed ɛ> 0) a polynomial time O(n 1/2+ɛ)approximation algorithm for directed latency. In the special case of metrics induced by shortestpaths in an unweighted directed graph, we give an O
PARALLEL FPGABASED ALL PAIRS SHORTEST PATHS FOR SPARSE NETWORKS:
"... This paper proposes a highly parallel and scalable reconfigurable design for the AllPairs ShortestPaths (APSP) algorithm for very sparse networks. Our work is motivated by a computationally intensive bioinformatics application that employs this memorylatency bound algorithm. The proposed desig ..."
Abstract
 Add to MetaCart
This paper proposes a highly parallel and scalable reconfigurable design for the AllPairs ShortestPaths (APSP) algorithm for very sparse networks. Our work is motivated by a computationally intensive bioinformatics application that employs this memorylatency bound algorithm. The pro
Toward Shortest Backup Paths for IP Fast ReRoute
"... Abstract — The slow convergence under intradomain link or router failures is a challenge for latencysensitive applications in the IP networks. A variety of IP Fast ReRoute (IPFRR) schemes have been proposed to address the issue in the literature. Our paper reviews several of these IPFRR schemes: ..."
Abstract
 Add to MetaCart
to the destination yields the shortest backup paths in the survived subgraph. However, it introduces significant increase of the routing table size, shedding light on the unbalanced tradeoff between the length of the backup path and the routing table size.
An Algorithm for Shortest Paths in Bipartite Digraphs with Concave Weight Matrices and its Applications
"... The traveling salesman problem on an npoint convex polygon and the minimum latency tour problem for n points on a straight line are two basic problems in graph theory and have been studied in the past. Previously, it was known that both problems can be solved in O(n 2 ) time. However, whether ..."
Abstract
 Add to MetaCart
) with X = fx 0 ; : : : ; xn g and Y = fy 0 ; : : : ; ymg, we wish to find the shortest path from x 0 to xn in G. This new problem requires\Omega\Gamma nm) time to solve in general, but we show that it can be solved in O(n+m log n) time if the weight matrices A and B of G are both concave, where for 0
Neither Shortest Path Nor Dominating Set: Aggregation Scheduling by Greedy Growing Tree in Multihop Wireless Sensor Networks
, 2011
"... Abstract—Data aggregation is a fundamental task in multihop wireless sensor networks. Minimumlatency aggregation scheduling (MLAS) seeks to minimize the number of scheduled time slots to perform an aggregation. In this paper, we present the first work on a solvable mathematical formulation of the ..."
Abstract
 Add to MetaCart
of the MLAS problem. The optimal solution of small example networks suggests that an optimal scheduling can be neither shortest path nor dominating set based. Instead of yet another theoretical analysis with provable bounds, our work focuses on reducing the average latency of general random topologies
Results 1  10
of
137