Results 241 to 250 of about 34,561 (298)
Some of the next articles are maybe not open access.
ACM SIGOPS Operating Systems Review, 1999
Click is a new software architecture for building flexible and configurable routers. A Click router is assembled from packet processing modules called elements. Individual elements implement simple router functions like packet classification, queueing, scheduling, and interfacing with network devices.
Robert Morris 0005 +3 more
openaire +2 more sources
Click is a new software architecture for building flexible and configurable routers. A Click router is assembled from packet processing modules called elements. Individual elements implement simple router functions like packet classification, queueing, scheduling, and interfacing with network devices.
Robert Morris 0005 +3 more
openaire +2 more sources
IEEE Network, 1988
An examination is made of data link bridges and internetwork routers, two technologies that provide for the extension and interconnection of local networks, which may occur using high-speed wide-area digital data communications services. The discussion of bridges covers simple bridges, learning bridges, source routing, and quality of service offered by
openaire +2 more sources
An examination is made of data link bridges and internetwork routers, two technologies that provide for the extension and interconnection of local networks, which may occur using high-speed wide-area digital data communications services. The discussion of bridges covers simple bridges, learning bridges, source routing, and quality of service offered by
openaire +2 more sources
Router plugins: a software architecture for next generation routers
ACM SIGCOMM Computer Communication Review, 1998Present day routers typically employ monolithic operating systems which are not easily upgradable and extensible. With the rapid rate of protocol development it is becoming increasingly important to dynamically upgrade router software in an incremental fashion.
Decasper, Dan +3 more
openaire +3 more sources
Integration, 1983
Abstract The channel routing problem is a special case of the wire routing problem when interconnections have to be performed within a rectangular strip having no obstructions, between terminals located on opposite sides of the rectangle. We present here a new channel routing algorithm, based on reduction of the problem to the case of a (2 × n ...
Michael Burstein, Richard N. Pelavin
openaire +3 more sources
Abstract The channel routing problem is a special case of the wire routing problem when interconnections have to be performed within a rectangular strip having no obstructions, between terminals located on opposite sides of the rectangle. We present here a new channel routing algorithm, based on reduction of the problem to the case of a (2 × n ...
Michael Burstein, Richard N. Pelavin
openaire +3 more sources
Papers on Twenty-five years of electronic design automation, 1976
This paper presents an algorithm for interconnecting two sets of terminals across an intervening channel. It is assumed that the routing is done on two distinct levels with all horizontal paths being assigned to one level and all vertical paths to the other. Connections between the levels are made through contact windows.
openaire +2 more sources
This paper presents an algorithm for interconnecting two sets of terminals across an intervening channel. It is assumed that the routing is done on two distinct levels with all horizontal paths being assigned to one level and all vertical paths to the other. Connections between the levels are made through contact windows.
openaire +2 more sources
Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures - SPAA '94, 1994
In this paper we present the Segment router, a novel router design for the interconnection networks of massively parallel computers. The design decisions of the Segment router are motivated by the need to improve the network performance when the traffic consists of messages with widely different lengths.The key novelty of the Segment router is that it ...
openaire +1 more source
In this paper we present the Segment router, a novel router design for the interconnection networks of massively parallel computers. The design decisions of the Segment router are motivated by the need to improve the network performance when the traffic consists of messages with widely different lengths.The key novelty of the Segment router is that it ...
openaire +1 more source
Lottery Router: A Customized Arbitral Priority NOC Router
2008 International Conference on Computer Science and Software Engineering, 2008For the different communications of specific NOC (network on chip) applications, this paper proposes a customized arbitral priority NOC router. This router uses the arbitral mechanism based on lottery algorithm instead of the RR (round robin) algorithm, which is widely used in the arbiter of current NOC routers.
Chang Wu +3 more
openaire +1 more source
Net characterization based channel router: FT router
[1988] IEEE International Conference on Computer-Aided Design (ICCAD-89) Digest of Technical Papers, 2003General heuristic algorithms that have been developed for channel routing fail to fully characterize the 'landscape' of nets to be routed and thus may yield suboptimal solutions. The authors' track-assignment type routing algorithm makes use of an extensive set of net characteristics/relationships to perform a more sophisticated search for an optimal ...
H. Zhu, Robert H. Fujii
openaire +1 more source
2008 IEEE International Conference on Robotics and Automation, 2008
Onur Tekdas, Volkan Isler
openaire +1 more source
Onur Tekdas, Volkan Isler
openaire +1 more source
[1989] Proceedings. The 9th International Conference on Distributed Computing Systems, 2003
C. Daniel Wolfson +2 more
openaire +2 more sources
C. Daniel Wolfson +2 more
openaire +2 more sources