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

Martino DeMarco

dblp:25/6011 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 1998
—ORCID · none

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

Computer networks · 3 · 3 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 architecture, parallel and distributed computing, and storage systems
2 papers
Interconnection networks and networks-on-chip · 78% Electronic design automation · 17% Performance modeling and evaluation · 5%
Computer networks
2 papers
Internet architecture and protocols · 55% Routing and switching · 46%

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

TopicWeightPapersLastEvidence papers
Interconnection networks and networks-on-chip › switching network › multistage interconnection network
banyan network
0.021997
Distributed Routing Protocols for ATM Extended Banyan Networks · IEEE J. Sel. Areas Commun. 1997
Distributed Routing Protocols for ATM Extended Banyan Networks · INFOCOM 1994
Interconnection networks and networks-on-chip › switching network
multistage interconnection network
0.021997
Distributed Routing Protocols for ATM Extended Banyan Networks · IEEE J. Sel. Areas Commun. 1997
Distributed Routing Protocols for ATM Extended Banyan Networks · INFOCOM 1994
Internet architecture and protocols
ATM networks
0.021997
Distributed Routing Protocols for ATM Extended Banyan Networks · IEEE J. Sel. Areas Commun. 1997
Distributed Routing Protocols for ATM Extended Banyan Networks · INFOCOM 1994
Routing and switching
packet switching
0.011997
Distributed Routing Protocols for ATM Extended Banyan Networks · IEEE J. Sel. Areas Commun. 1997
Electronic design automation › physical design
routing
0.011997
Distributed Routing Protocols for ATM Extended Banyan Networks · IEEE J. Sel. Areas Commun. 1997
Interconnection networks and networks-on-chip › flow control
backpressure
0.011994
Distributed Routing Protocols for ATM Extended Banyan Networks · INFOCOM 1994
Interconnection networks and networks-on-chip › switch architecture
packet switch architecture
0.011994
Distributed Routing Protocols for ATM Extended Banyan Networks · INFOCOM 1994

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

queue sharing · 0.0backpressure protocol · 0.0simulation · 0.0queueing analysis · 0.0
YearPublicationVenuePosition
1998 Resource management mechanisms in wireless ATM networks
abstract
The support to ATM services in wireless mobile networks is discussed. A reference model for the network architecture is outlined and a quantitative analysis is presented, in which the efficiency of resource management mechanisms and quality of service support in a wireless ATM network is compared to that of a circuit switched network. The analysis involves mobile users belonging to two different service classes (real-time and non-real-time traffic). This study has been carried out by considering the ATM layer to receive an ideal service from the underlying radio-channel access layer. The results show that ATM resource management improves the blocking performance of the network whenever a consistent portion of the total offered traffic is represented by variable bit rate applications; the QoS is largely improved for non-real-time variable bit rate traffic and is slightly worsened for real-time constant bit rate traffic.
Martino DeMarco, Achille Pattavina, Davide Roda
ICC1
1997 Distributed Routing Protocols for ATM Extended Banyan Networks
abstract
It is well known that a multistage banyan network, which is a single-path blocking structure, becomes rearrangeable nonblocking in a circuit-switching environment if the number of its stages is increased so as to obtain a Benes network. Banyan networks, provided with a shared queue in each switching element, have often been proposed as the core of an interconnection network for an ATM packet switching environment. In this scenario, if the classical interstage backpressure protocols are used, adding stages to a banyan network can even degrade the banyan network performance, in spite of the multipath capability given by the additional stages. A class of new simple interstage protocols is here defined to operate in the added stages of the banyan network so that a sort of sharing of the queueing capability in each added stage is accomplished. Large improvements in the traffic performance of these extended banyan networks are obtained, especially in the region of offered loads providing a low packet loss probability.
Martino DeMarco, Achille Pattavina
IEEE J. Sel. Areas Commun.1
1994 Distributed Routing Protocols for ATM Extended Banyan Networks
abstract
It is well known that a multistage banyan network, which is a single-path blocking structure, becomes rearrangeable non-blocking in a circuit switching environment if the number of its stages is increased so as to obtain a Benes network. Banyan networks, provided with a shared queue in each switching element, have often been proposed as the core of an interconnection network for an ATM packet switching environment. In this scenario, if the classical interstage back-pressure protocols are used, adding stages to a banyan network can even degrade the banyan network performance, in spite of the multipath capability given by the additional stages. A class of new simple interstage protocols is defined to operate in the added stages of the banyan network so that a sort of sharing of the queueing capability in each added stage is accomplished. Large improvements in the traffic performance of these extended banyan networks are obtained, especially in the region of offered loads providing a low packet loss probability.>
Martino DeMarco, Achille Pattavina
INFOCOM1