Results 1  10
of
1,631
Deriving Traffic Demands for Operational IP networks: Methodology and Experience
 IEEE/ACM TRANSACTIONS ON NETWORKING
, 2001
"... Engineering a large IP backbone network without an accurate, networkwide view of the traffic demands is challenging. Shifts in user behavior, changes in routing policies, and failures of network elements can result in significant (and sudden) fluctuations in load. In this paper, we present a model ..."
Abstract

Cited by 297 (39 self)
 Add to MetaCart
of the necessary data. Specifically, we show how to infer interdomain traffic demands using measurements collected at a smaller number of edge links  the peering links connecting to neighboring providers. We report on our experiences in deriving the traffic demands in the AT&T IP Backbone, by collecting
An Approximate MaxFlow MinCut Theorem for Uniform Multicommodity Flow Problems with Applications to Approximation Algorithms
, 1989
"... In this paper, we consider a multicommodity flow problem where for each pair of vertices, (u,v), we are required to sendf halfunits of commodity (uv) from u to v and f halfunits of commodity (vu) from v to u without violating capacity constraints. Our main result is an algorithm for performing th9 ..."
Abstract

Cited by 246 (12 self)
 Add to MetaCart
9 task provided that the capacity of each cut exceeds the demand across the cut by a b(log n) factor. The condition on cuts is required in the worst case, and is trivially within a i(log n) factor of optimal for any flow problem. The result is of interest because it can be used to construct
ABCD: Eliminating Array Bounds Checks on Demand
, 2000
"... To guarantee execution, Java and other strongly typed languages require bounds checking of array accesses. Because bounds checks may raise exceptions, they block code motion of instructions with side effects, thus preventing many useful code optimizations, such as partial redundancy elimination or i ..."
Abstract

Cited by 148 (7 self)
 Add to MetaCart
heavyweight for the dynamic compilation setting. ABCD is a lightweight algorithm for elimination of &ray Checks on Demand. Its design emphasizes simplicity and efficiency. In essence, ABCD works by adding a few edges to the SSA value graph and performing a simple traversal of the graph. Despite its
Fast Approximation Algorithms for Multicommodity Flow Problems
 JOURNAL OF COMPUTER AND SYSTEM SCIENCES
, 1991
"... All previously known algorithms for solving the multicommodity flow problem with capacities are based on linear programming. The best of these algorithms [15] uses a fast matrix multiplication algorithm and takes O(k 3:5 n 3 m :5 log(nDU )) time for the multicommodity flow problem with inte ..."
Abstract

Cited by 191 (21 self)
 Add to MetaCart
with integer demands and at least O(k 2:5 n 2 m :5 log(nffl \Gamma1 DU )) time to find an approximate solution, where k is the number of commodities, n and m denote the number of nodes and edges in the network, D is the largest demand, and U is the largest edge capacity. Substantially more time
Coil sensitivity encoding for fast MRI. In:
 Proceedings of the ISMRM 6th Annual Meeting,
, 1998
"... New theoretical and practical concepts are presented for considerably enhancing the performance of magnetic resonance imaging (MRI) by means of arrays of multiple receiver coils. Sensitivity encoding (SENSE) is based on the fact that receiver sensitivity generally has an encoding effect complementa ..."
Abstract

Cited by 193 (3 self)
 Add to MetaCart
shape criterion is weaker in favor of the SNR. With both strategies the reconstruction algorithm is numerically demanding in the general case. This is mainly because with hybrid encoding the bulk of the work of reconstruction can usually not be done by fast Fourier transform (FFT). However, it is shown
On Demand Label Switching for Spontaneous Edge Networks
 In Proceedings of ACM Sigcomm Workshop in Future Directions in Network Architecture
, 2004
"... We consider the problem of interconnecting hosts in spontaneous edge networks composed of various types of wired or wireless physical and link layer technologies. All or some hosts in a spontaneous network can be organized as a multihop ad hoc network, connected or not to the global Internet. We arg ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
information on destination reachability. We have designed and implemented Lilith, a prototype of an interconnection node for spontaneous edge networks. We handle network dynamics by establishing MPLS (Multi Protocol Label Switching) label switched paths (LSP) on demand with a reactive ad hoc routing protocol
Walking the tightrope: Responsive yet stable traffic engineering
 In Proc. ACM SIGCOMM
, 2005
"... Current intradomain Traffic Engineering (TE) relies on offline methods, which use long term average traffic demands. It cannot react to realtime traffic changes caused by BGP reroutes, diurnal traffic variations, attacks, or flash crowds. Further, current TE deals with network failures by precompu ..."
Abstract

Cited by 158 (3 self)
 Add to MetaCart
to actual traffic demands and failures. TeXCP uses multiple paths to deliver demands from an ingress to an egress router, adaptively moving traffic from overutilized to underutilized paths. These adaptations are carefully designed such that, though done independently by each edge router based on local
Partitioning Trees with Supply, Demand and EdgeCapacity
, 2011
"... Let T be a tree. Each vertex of T is either a supply vertex or a demand vertex, and is assigned a positive number called the supply or demand. Each demand vertex can receive “power” from exactly one supply vertex through edges in T. Each edge is assigned a positive number called the capacity. One ..."
Abstract
 Add to MetaCart
Let T be a tree. Each vertex of T is either a supply vertex or a demand vertex, and is assigned a positive number called the supply or demand. Each demand vertex can receive “power” from exactly one supply vertex through edges in T. Each edge is assigned a positive number called the capacity. One
Globally distributed content delivery
 Internet Computing, IEEE
, 2002
"... Using more than 12,000 servers in over 1,000 networks, Akamai’s distributed content delivery system fights service bottlenecks and shutdowns by delivering content from the Internet’s edge. As Web sites become popular,they’re increasingly vulnerable tothe flash crowd problem, in which request load ov ..."
Abstract

Cited by 160 (18 self)
 Add to MetaCart
a single location can present serious problems for site scalability, reliability, and performance. We thus devised a system to serve requests from a variable number of surrogate origin servers at the network edge.1 By caching content at the Internet’s edge, we reduce demand on the site’s
The price of routing unsplittable flow
 In Proc. 37th Symp. Theory of Computing (STOC
, 2005
"... The essence of the routing problem in real networks is that the traffic demand from a source to destination must be satisfied by choosing a single path between source and destination. The splittable version of this problem is when demand can be satisfied by many paths, namely a flow from source to d ..."
Abstract

Cited by 140 (3 self)
 Add to MetaCart
, and investigate the ”price of anarchy”, or deterioration of network performance measured in total traffic latency under the selfish user behavior. We show that for linear edge latency functions the price of anarchy is exactly 2.618 for weighted demand and exactly 2.5 for unweighted demand. These results
Results 1  10
of
1,631