Sciweavers

376 search results - page 59 / 76
» Hardware-Assisted Fast Routing
Sort
View
DAC
2003
ACM
14 years 10 months ago
An O(nlogn) time algorithm for optimal buffer insertion
The classic algorithm for optimal buffer insertion due to van Ginneken has time and space complexity O(n2 ), where n is the number of possible buffer positions. We present a new a...
Weiping Shi, Zhuo Li
ICDCN
2010
Springer
14 years 4 months ago
Channel Assignment in Virtual Cut-through Switching Based Wireless Mesh Networks
Conventional wireless networks employ a contention based channel access mechanism, which not only imposes high latency but also reduces goodput of the network. Lack of interference...
Dola Saha, Aveek Dutta, Dirk Grunwald, Douglas C. ...
DELTA
2008
IEEE
14 years 4 months ago
Testing of a Highly Reconfigurable Processor Core for Dependable Data Streaming Applications
The advances of CMOS technology towards 45 nm, the high costs of ASIC design, power limitations and fast changing application requirements have stimulated the usage of highly reco...
Hans G. Kerkhoff, Jarkko J. M. Huijts
ISCC
2005
IEEE
105views Communications» more  ISCC 2005»
14 years 3 months ago
Enhanced Protection Using Shared Segment Backups in a Multiservice GMPLS-Based Networks
The paper presents a novel protection methodology for setting protected paths in a multiservice GMPLSbased network scenario. By applying the proposed methods, label switched paths...
Anna Urra, Eusebi Calle, José-Luis Marzo
INFOCOM
1996
IEEE
14 years 1 months ago
Flow Labelled IP: A Connectionless Approach to ATM
A number of proposals for supporting IP over ATM are under discussion in the networking community including: LAN emulation, classical IP over ATM, routing over large clouds, and m...
Peter Newman, Thomas L. Lyon, Greg Minshall