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

J. E. Martinez-Castillo

dblp:143/3358 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2018
—ORCID · none

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

Computer networks · 1

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 · 44% Internet architecture and protocols · 44% Wireless networking · 13%

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

TopicWeightPapersLastEvidence papers
Internet architecture and protocols › information-centric networking
name-based content routing
0.312018
Routing to Multi-Instantiated Destinations: Principles, Practice, and Applications · IEEE Trans. Mob. Comput. 2018
Routing and switching
routing
0.312018
Routing to Multi-Instantiated Destinations: Principles, Practice, and Applications · IEEE Trans. Mob. Comput. 2018
Wireless networking
mobile ad hoc networks
0.112018
Routing to Multi-Instantiated Destinations: Principles, Practice, and Applications · IEEE Trans. Mob. Comput. 2018

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

simulation · 0.3distance-based routing · 0.3
YearPublicationVenuePosition
2018 Routing to Multi-Instantiated Destinations: Principles, Practice, and Applications
abstract
Prior solutions for routing to multi-instantiated destinations simply adapt existing routing algorithms designed for single-instance destinations, or rely on flooding techniques. In this paper, a new approach for routing to multi-instantiated destinations is introduced, and the Multiple Instance Destination Routing (MIDR) framework is presented as an example of the approach. MIDR uses only distance information to multi-instantiated destinations, without routers having to establish overlays, know the network topology, use complete paths to destination instances, or know about all the instances of destinations. MIDR can be used in name-based content routing, IP unicast routing, multicasting, and anycasting; even in scenarios where the network topology is highly dynamic such as in the case of MANETs. It is shown that MIDR provides multiple loop-free paths to destination instances. Extensive simulation-based experiments performed in the context of MANETs show that MIDR outperforms traditional approaches based on unicast protocols and that it scales to large networks.
J. J. Garcia-Luna-Aceves, J. E. Martinez-Castillo, Rolando Menchaca-Méndez
IEEE Trans. Mob. Comput.2