Sciweavers

SIGCOMM
2010
ACM
13 years 7 months ago
R3: resilient routing reconfiguration
Network resiliency is crucial to IP network operations. Existing techniques to recover from one or a series of failures do not offer performance predictability and may cause serio...
Ye Wang, Hao Wang, Ajay Mahimkar, Richard Alimi, Y...
CCS
2010
ACM
13 years 7 months ago
Demonstrating cognitive packet network resilience to worm attacks
The need for network stability and reliability has led to the growth of autonomic networks [2] that can provide more stable and more reliable communications via on-line measuremen...
Georgia Sakellari, Erol Gelenbe
BPM
2010
Springer
128views Business» more  BPM 2010»
13 years 7 months ago
Content-Aware Resolution Sequence Mining for Ticket Routing
Ticket routing is key to the efficiency of IT problem management. Due to the complexity of many reported problems, problem tickets typically need to be routed among various expert ...
Peng Sun, Shu Tao, Xifeng Yan, Nikos Anerousis, Yi...
CONEXT
2009
ACM
13 years 8 months ago
Improving internet-wide routing protocols convergence with MRPC timers
The behavior of routing protocols during convergence is critical as it impacts end-to-end performance. Network convergence is particularly important in BGP, the current interdomai...
Anthony J. Lambert, Marc-Olivier Buob, Steve Uhlig
SODA
1994
ACM
133views Algorithms» more  SODA 1994»
13 years 8 months ago
Derandomizing Algorithms for Routing and Sorting on Meshes
We describe a new technique that can be used to derandomize a number of randomized algorithms for routing and sorting on meshes. We demonstrate the power of this technique by deri...
Michael Kaufmann, Jop F. Sibeyn, Torsten Suel
WSC
2004
13 years 8 months ago
On-Demand Computation of Policy Based Routes for Large-Scale Network Simulation
Routing table storage demands pose a significant obstacle for large-scale network simulation. On-demand computation of routes can alleviate those problems for models that do not r...
Michael Liljenstam, David M. Nicol
NSDI
2004
13 years 8 months ago
Efficient Routing for Peer-to-Peer Overlays
Most current peer-to-peer lookup schemes keep a small amount of routing state per node, typically logarithmic in the number of overlay nodes. This design assumes that routing info...
Anjali Gupta, Barbara Liskov, Rodrigo Rodrigues
NETWORKING
2004
13 years 8 months ago
A-STAR: A Mobile Ad Hoc Routing Strategy for Metropolis Vehicular Communications
Abstract. One of the major issues that affect the performance of Mobile Ad hoc NETworks (MANET) is routing. Recently, position-based routing for MANET is found to be a very promisi...
Boon-Chong Seet, Genping Liu, Bu-Sung Lee, Chuan H...
NETWORKING
2004
13 years 8 months ago
Hierarchical Routing with QoS Constraints in Optical Transport Networks
Abstract. Optical Transport Networks (OTN) with automatical switching capabilities are named ASON. Hierarchical routing is required in the ASON recommendations to achieve scalabili...
Xavier Masip-Bruin, Sergio Sánchez-Ló...
NETWORKING
2004
13 years 8 months ago
LMPS: Localized Multi-path Selection for QoS Routing in VoIP Networks
Abstract. Localized QoS routing techniques were proposed to achieve acceptable performance without exchanging global state information over the network. In such techniques, the ing...
Khaled M. F. Elsayed, Hassan Fadel, Amin M. Nassar