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

Pavlin Radoslavov

dblp:24/6452 · DBLP profile ↗
← Back
7ranked-venue papers
3as first author
0since 2021 · last 2006
—ORCID · none

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

Computer networks · 7 · 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 networks
6 papers
Internet architecture and protocols · 75% Routing and switching · 21% Network performance modeling · 4%

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

TopicWeightPapersLastEvidence papers
Internet architecture and protocols › multicast
reliable multicast
0.132006
Incremental deployment strategies for router-assisted reliable multicast · IEEE/ACM Trans. Netw. 2006
A comparison of application-level and router-assisted hierarchical schemes for reliable multicast · IEEE/ACM Trans. Netw. 2004
A Comparison of Application-Level and Router-Assisted Hierarchical Schemes for Reliable Multicast · INFOCOM 2001
Internet architecture and protocols
multicast
0.122006
Incremental deployment strategies for router-assisted reliable multicast · IEEE/ACM Trans. Netw. 2006
A comparison of application-level and router-assisted hierarchical schemes for reliable multicast · IEEE/ACM Trans. Netw. 2004
Internet architecture and protocols › network evolution
incremental deployment
0.122006
Incremental deployment strategies for router-assisted reliable multicast · IEEE/ACM Trans. Netw. 2006
A Framework for Incremental Deployment Strategies for Router-Assisted Services · INFOCOM 2003
Routing and switching › routing
hierarchical routing
0.012004
A comparison of application-level and router-assisted hierarchical schemes for reliable multicast · IEEE/ACM Trans. Netw. 2004
Routing and switching › multicast routing
hierarchical multicast
0.012001
A Comparison of Application-Level and Router-Assisted Hierarchical Schemes for Reliable Multicast · INFOCOM 2001
Routing and switching › multicast routing
inter-domain multicast
0.011998
The MASC/BGMP Architecture for Inter-Domain Multicast Routing · SIGCOMM 1998
Routing and switching
multicast routing
0.011998
The MASC/BGMP Architecture for Inter-Domain Multicast Routing · SIGCOMM 1998
Internet architecture and protocols › multicast
application-layer multicast
0.012004
A comparison of application-level and router-assisted hierarchical schemes for reliable multicast · IEEE/ACM Trans. Netw. 2004
Routing and switching › inter-domain routing
BGP
0.011998
The MASC/BGMP Architecture for Inter-Domain Multicast Routing · SIGCOMM 1998

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

simulation · 0.1comparison study · 0.0sensitivity analysis · 0.0
YearPublicationVenuePosition
2006 Incremental deployment strategies for router-assisted reliable multicast
Xinming He, Christos Papadopoulos, Pavlin Radoslavov
IEEE/ACM Trans. Netw.3
2005 Designing Extensible IP Router Software
Mark Handley, Eddie Kohler, Atanu Ghosh, Orion Hodson, Pavlin Radoslavov
NSDI5
2004 A comparison of application-level and router-assisted hierarchical schemes for reliable multicast
Pavlin Radoslavov, Christos Papadopoulos, Ramesh Govindan, Deborah Estrin
IEEE/ACM Trans. Netw.1
2003 A Framework for Incremental Deployment Strategies for Router-Assisted Services
abstract
Incremental deployment of a new network service or protocol is typically a hard problem, especially when it has to be deployed in the routers. First, an incrementally deployable protocol is needed. Second, a study of the performance impact of incremental deployment should be carried out to evaluate deployment strategies. Choosing the wrong strategy can be disastrous, as it may inhibit reaping the benefits of an otherwise robust service, and prevent widespread adoption. Unfortunately, to date there has been no systematic evaluation of incremental deployment for such services. Our research work is focused on the second aspect, namely the performance impact of incremental deployment of router-assisted services. We take the first step to define a framework for evaluating incrementally deployable services, which consists of three parts: (a) selection and classification of deployment strategies; (b) definition of performance metrics; and (c) systematic evaluation of deployment strategies. As a case study for our framework, we evaluate the performance of router-assisted reliable multicast protocols. Although our framework is still evolving, our results clearly demonstrate that the choice of a strategy has a substantial impact on performance, and thus affirms the need for systematic evaluation of incremental deployment. Our case study includes two router-assisted reliable multicast protocols, namely PGM and LMS. We make several interesting observations: (a) the performance of different deployment strategies varies widely; for example, with some strategies, both PGM and LMS approach full deployment performance with as little as 5% of the routers deployed, but with other strategies up to 80% deployment may be needed to approach the same level; (b) our sensitivity analysis reveals relatively small variation in the results in most cases; and (c) the penalty associated with partial deployment is different for each of these protocols; PGM tends to impact the network, whereas LMS impacts the endpoints.
Xinming He, Christos Papadopoulos, Pavlin Radoslavov
INFOCOM3
2002 Topology-informed Internet replica placement
Pavlin Radoslavov, Ramesh Govindan, Deborah Estrin
Comput. Commun.1
2001 A Comparison of Application-Level and Router-Assisted Hierarchical Schemes for Reliable Multicast
abstract
One approach to achieving scalability in reliable multicast is to use a hierarchy. A hierarchy can be established at the application level, or by using router-assist. With router-assist we have more fine-grain control over the placement of error-recovery functionality, therefore, a hierarchy produced by assistance from the routers is expected to have better performance. In this paper, we test this hypothesis by comparing two schemes, one that uses an application-level hierarchy (ALH) and another that uses router-assisted hierarchy (RAH). Contrary to our expectations, we find that the qualitative performance of ALH is comparable to RAH. We do not model the overhead of creating the hierarchy nor the cost of adding router-assist to the network. Therefore, our conclusions inform rather than close the debate of which approach is better.
Pavlin Radoslavov, Christos Papadopoulos, Ramesh Govindan, Deborah Estrin
INFOCOM1
1998 The MASC/BGMP Architecture for Inter-Domain Multicast Routing
abstract
Multicast routing enables efficient data distribution to multiple recipients. However, existing work has concentrated on extending single-domain techniques to wide-area networks, rather than providing mechanisms to realize inter-domain multicast on a global scale in the Internet. We describe an architecture for inter-domain multicast routing that consists of two complementary protocols. The Multicast Address-Set Claim (MASC) protocol forms the basis for a hierarchical address allocation architecture. It dynamically allocates to domains multicast address ranges from which groups initiated in the domain get their multicast addresses. The Border-Gateway Multicast Protocol (BGMP), run by the border routers of a domain, constructs inter-domain bidirectional shared trees, while allowing any existing multicast routing protocol to be used within individual domains. The resulting shared tree for a group is rooted at the domain whose address range covers the group's address; this domain is typically the group initiator's domain. We demonstrate the feasibility and performance of these complementary protocols through simulation. This architecture, together with existing protocols operating within each domain, is intended as a framework in which to solve the problems facing the current multicast addressing and routing infrastructure.
Pavlin Radoslavov, Dave Thaler, Cengiz Alaettinoglu, Deborah Estrin, Mark Handley
SIGCOMM2