Sciweavers

570 search results - page 105 / 114
» Edge Coloring with Delays
Sort
View
COMCOM
1998
106views more  COMCOM 1998»
14 years 11 months ago
Algorithms for delay-constrained low-cost multicast tree construction
With the proliferation of multimedia group applications, the construction of multicast trees satisfying Quality of Service QoS requirements is becoming a problem of prime import...
R. Sriram, Govindarasu Manimaran, C. Siva Ram Murt...
88
Voted
JDCTA
2010
143views more  JDCTA 2010»
14 years 6 months ago
A Potent Model for Unwanted Traffic Detection in QoS Network Domain
Unwanted traffic injection which amplifies the traffic loading and exhausts network resources is counted as network security threat. Despite of the numerous protection systems, th...
Abdulghani Ali, Aman Jantan, Ghassan Ahmed Ali
EDBT
2008
ACM
150views Database» more  EDBT 2008»
15 years 12 months ago
Finding time-dependent shortest paths over large graphs
The spatial and temporal databases have been studied widely and intensively over years. In this paper, we study how to answer queries of finding the best departure time that minim...
Bolin Ding, Jeffrey Xu Yu, Lu Qin
ICCAD
2002
IEEE
161views Hardware» more  ICCAD 2002»
15 years 8 months ago
Non-tree routing for reliability and yield improvement
We propose to introduce redundant interconnects for manufacturing yield and reliability improvement. By introducing redundant interconnects, the potential for open faults is reduc...
Andrew B. Kahng, Bao Liu, Ion I. Mandoiu
IMC
2006
ACM
15 years 5 months ago
Quantifying path exploration in the internet
A number of previous measurement studies [10, 12, 17] have shown the existence of path exploration and slow convergence in the global Internet routing system, and a number of prot...
Ricardo V. Oliveira, Beichuan Zhang, Dan Pei, Rafi...