Sciweavers

20 search results - page 3 / 4
» Some Properties of Swapped Interconnection Networks
Sort
View
WG
2001
Springer
15 years 1 months ago
(k, +)-Distance-Hereditary Graphs
In this work we introduce, characterize, and provide algorithmic results for (k, +)–distance-hereditary graphs, k ≥ 0. These graphs can be used to model interconnection networ...
Serafino Cicerone, Gianluca D'Ermiliis, Gabriele D...
IPPS
1998
IEEE
15 years 1 months ago
Optimal Contention-Free Unicast-Based Multicasting in Switch-Based Networks of Workstations
A unicast-based multicasting algorithm is presented for arbitrary interconnection networks arising in switchbased networks of workstations. The algorithm is optimal with respect t...
Ran Libeskind-Hadas, Dominic Mazzoni, Ranjith Raja...
AICCSA
2005
IEEE
124views Hardware» more  AICCSA 2005»
15 years 3 months ago
On multicast scheduling and routing in multistage Clos networks
Multicast communication, which involves transmitting information from one node to multiple nodes, is a vital operation in both broadband integrated services digital networks (BISD...
Bin Tang
SIGMETRICS
2008
ACM
119views Hardware» more  SIGMETRICS 2008»
14 years 9 months ago
Network externalities and the deployment of security features and protocols in the internet
Getting new security features and protocols to be widely adopted and deployed in the Internet has been a continuing challenge. There are several reasons for this, in particular ec...
Marc Lelarge, Jean Bolot
IPPS
2003
IEEE
15 years 2 months ago
BLAM : A High-Performance Routing Algorithm for Virtual Cut-Through Networks
High performance, freedom from deadlocks, and freedom from livelocks are desirable properties of interconnection networks. Unfortunately, these can be conflicting goals because n...
Mithuna Thottethodi, Alvin R. Lebeck, Shubhendu S....