Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Sandro Bassi

dblp:37/6715 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 1994
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 2 · 2 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
2 papers
Routing and switching · 59% Internet architecture and protocols · 23% Network performance modeling · 18%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Interconnection networks and networks-on-chip · 100%

Topics — the 8 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Internet architecture and protocols › ATM networks
ATM switching
0.011994
Multistage shuffle networks with shortest path and deflection routing for high performance ATM switching: the open-loop shuffleout · IEEE Trans. Commun. 1994
Routing and switching › switching systems
output-buffered switch
0.011994
Multistage shuffle networks with shortest path and deflection routing for high performance ATM switching: the open-loop shuffleout · IEEE Trans. Commun. 1994
Interconnection networks and networks-on-chip › switching network
multistage interconnection network
0.011994
Multistage shuffle networks with shortest path and deflection routing for high performance ATM switching: the open-loop shuffleout · IEEE Trans. Commun. 1994
Interconnection networks and networks-on-chip › switching network › multistage interconnection network
shuffle network
0.011994
Multistage shuffle networks with shortest path and deflection routing for high performance ATM switching: the open-loop shuffleout · IEEE Trans. Commun. 1994
Routing and switching › switching networks
multistage interconnection network
0.011992
Performance Analysis of the ATM Shuffleout Switching Architecture Under Non-Uniform Traffic Patterns · INFOCOM 1992
Network performance modeling
switch performance analysis
0.011992
Performance Analysis of the ATM Shuffleout Switching Architecture Under Non-Uniform Traffic Patterns · INFOCOM 1992
Routing and switching › adaptive routing
deflection routing
0.021994
Multistage shuffle networks with shortest path and deflection routing for high performance ATM switching: the open-loop shuffleout · IEEE Trans. Commun. 1994
Performance Analysis of the ATM Shuffleout Switching Architecture Under Non-Uniform Traffic Patterns · INFOCOM 1992
Routing and switching
packet switching
0.011992
Performance Analysis of the ATM Shuffleout Switching Architecture Under Non-Uniform Traffic Patterns · INFOCOM 1992

Methods — techniques the papers use, named apart from their topics

shortest path routing · 0.0self-routing · 0.0analytical modeling · 0.0
YearPublicationVenuePosition
1994 Multistage shuffle networks with shortest path and deflection routing for high performance ATM switching: the open-loop shuffleout
abstract
A new class of switching architectures for broadband packet networks, called shuffleout, is described and analyzed in the paper. Shuffleout is basically an output-queued architecture with a multistage interconnection network built out of unbuffered b/spl times/2b switching elements. Its structure is such that the number of cells that can be concurrently switched from the inlets to each output queue equals the number of stages in the interconnection network. The switching element operates the cell self-routing adopting a shortest path algorithm which, in case of conflict for interstage links, is coupled with deflection routing. The paper presents the basic shuffleout architecture, called open-loop shuffleout, in which the cells that cross the whole interconnection network without entering the addressed output queues are lost. The key target of the proposed architecture is coupling the implementation feasibility of a self-routing switch with the desirable traffic performance typical of output queueing.>
Sandro Bassi, Maurizio Decina, Paolo Giacomazzi, Achille Pattavina
IEEE Trans. Commun.1
1992 Performance Analysis of the ATM Shuffleout Switching Architecture Under Non-Uniform Traffic Patterns
abstract
The authors describe a model for the performance evaluation of the Shuffleout asynchronous transfer mode (ATM) switch under arbitrary nonuniform traffic patterns. Shuffleout is a blocking multistage structure using shortest path routing with deflection, in which output queues are connected to all the stages. The analytical model developed computes the load on each interstage link by tracing all the paths that a packet can follow to reach the addressed switch outlet, that is, by taking into account all the deflections from its shortest path it can receive. Such a model allows the computation not only of the average load per stage but also its distribution over the different links belonging to the interstage pattern. Thus fairness in packet switching by Shuffleout is provided by the model.>
Sandro Bassi, Maurizio Decina, Achille Pattavina
INFOCOM1