Sciweavers

5079 search results - page 313 / 1016
» Hidden-Action in Network Routing
Sort
View
EUROPAR
2001
Springer
15 years 12 months ago
Optimal Many-to-One Routing on the Mesh with Constant Queues
We present randomized and deterministic algorithms for many-to-one routing on an n-node two-dimensional mesh under the store-and-forward model of packet routing. We consider the g...
Andrea Pietracaprina, Geppino Pucci
167
Voted
STOC
1993
ACM
109views Algorithms» more  STOC 1993»
15 years 11 months ago
Routing permutations on graphs via matchings
We consider a class of routing problems on connected graphs G. Initially, each vertex v of G is occupied by a “pebble” which has a unique destination π(v) in G (so that π is...
Noga Alon, Fan R. K. Chung, Ronald L. Graham
CEC
2009
IEEE
15 years 10 months ago
A simple multi-objective optimization algorithm for the urban transit routing problem
— The urban transit routing problem (UTRP) for public transport systems involves finding a set of efficient transit routes to meet customer demands. The UTRP is an NPHard, high...
Lang Fan, Christine L. Mumford, Dafydd Evans
235
Voted
NDSS
2007
IEEE
16 years 1 months ago
Low-Rate TCP-Targeted DoS Attack Disrupts Internet Routing
Compared to attacks against end hosts, Denial of Service (DoS) attacks against the Internet infrastructure such as those targeted at routers can be more devastating due to their g...
Ying Zhang, Zhuoqing Morley Mao, Jia Wang
PERCOM
2006
ACM
16 years 1 months ago
DHT-based Unicast for Mobile Ad Hoc Networks
As mobile ad hoc networks (MANETs) become ever more popular, it also becomes more and more interesting to build distributed network applications (e.g. data storage, etc.) that hav...
Thomas Zahn, Jochen H. Schiller