625 search results - page 56 / 125 » Semi-preemptive routing on trees |
114
Voted
SODA
2008
ACM
15 years 2 months ago
2008
ACM
Greedy Routing is a class of routing algorithms in which the packets are forwarded in a manner that reduces the distance to the destination at every step. In an attempt to provide...
126
Voted
MMNS
2004
15 years 1 months ago
2004
Existing multicast traffic engineering (TE) solutions tend to use explicit routing through MPLS tunnels. In this paper we shift away from this overlay approach and address the band...
102
Voted
DAC
2008
ACM
16 years 1 months ago
2008
ACM
Clock skew minimization is always very important in the clock tree synthesis. Due to clock gating, the clock tree may include different types of logic gates, e.g., AND gates, OR g...
141
Voted
CN
2004
15 years 12 days ago
2004
In this paper, we introduce a new IP lookup scheme with worst-case search and update time of O(log n), where n is the number of prefixes in the forwarding table. Our scheme is base...
NOCS
2007
IEEE
15 years 6 months ago
2007
IEEE
In this paper we present a new clustered mesh FPGA architecture where each cluster local interconnect is implemented as an MFPGA tree network [6]. Unlike previous clustered mesh a...