Interconnect optimization for VLSI circuits has received wide attention. To model routing surfaces, multiple circuit layers are freabstracted as a single rectilinear plane, ignori...
In this paper, we propose a new approach for VLSI interconnect global routing that can optimize both congestion and delay, which are often competing objectives. Our approach provi...
Abstract—In this paper we consider routing and wavelength assignment in wavelength-routed all-optical networks with circuitswitching. The conventional approaches to address this ...
Mobile ad hoc networks are collections of mobile nodes without any fixed infrastructure or central co-ordinating mechanism for packet routing. Consequently, routing is a challenge...
The paper studies routing in loss networks in the framework of a non-cooperative game with selfish users. Two solution concepts are considered: the Nash equilibrium, corresponding...
Eitan Altman, Rachid El Azouzi, Vyacheslav M. Abra...
Efficient handling of mobile nodes in a multicast environment is a non-trivial task. Solutions based on bi-directional tunneling introduce encapsulation and triangular routing. Th...
The logic blocks of most modern FPGAs contain clusters of look-up tables and flip flops, yet little is known about good choices for several key architectural parameters related ...
Multicast, an important communication mechanism, is frequently applied in parallel computing. The star graph interconnection network, when compared with the hypercube network, bei...
We study routing and scheduling in packet-switched networks. We assume an adversary that controls the injection time, source, and destination for each packet injected. A set of pat...