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

Ramin Najmabadi Kia

dblp:52/5532 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 1993
—ORCID · none

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

Computer networks · 2 · 1 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
1 paper
Routing and switching · 100%

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

TopicWeightPapersLastEvidence papers
Routing and switching › routing protocol
distance-vector routing
0.011993
An architecture for virtual circuit/QoS routing · ICNP 1993
Routing and switching
qos routing
0.011993
An architecture for virtual circuit/QoS routing · ICNP 1993
Routing and switching › routing
virtual circuit routing
0.011993
An architecture for virtual circuit/QoS routing · ICNP 1993
Routing and switching › routing › routing control
loop prevention
0.011993
An architecture for virtual circuit/QoS routing · ICNP 1993
Routing and switching
source routing
0.011993
An architecture for virtual circuit/QoS routing · ICNP 1993

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

route recording · 0.0distance vector algorithm · 0.0
YearPublicationVenuePosition
1993 An architecture for virtual circuit/QoS routing
abstract
With the emergence of multimedia applications, networks have to provide more and more bandwidth and should guarantee the quality of the communication between users. To address these issues, high speed architectures based on a virtual circuit model such as ATM have been designed and successfully implemented. The current trends in telecommunication deployment indicate that very large Internets based on such model will be available in the near future. This paper addresses the routing problem in this context and analyzes the existing solutions. It is concluded that the network has to provide precomputed and on-demand routes using a variation of the distance vector algorithm. Among other things, source routing and complete route recording are used to prevent loop formation.>
Alvaro Guillen, Ramin Najmabadi Kia, Bernard Sales
ICNP2
1992 Routing Archtitectures for the Support of the OSI Connection Mode Network Service
Ramin Najmabadi Kia, Bernard Sales
Comput. Networks ISDN Syst.1