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

Loránd Jakab

dblp:02/2694 · DBLP profile ↗
← Back
7ranked-venue papers
2as first author
0since 2021 · last 2015
—ORCID · none

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

Computer networks · 6 · 2 first-authorGraphics, computer vision, multimedia, augmented reality and games · 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 · 50% Internet architecture and protocols · 50%

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

TopicWeightPapersLastEvidence papers
Internet architecture and protocols › naming and addressing
locator/identifier separation
0.112010
LISP-TREE: A DNS Hierarchy to Support the LISP Mapping System · IEEE J. Sel. Areas Commun. 2010
Routing and switching › routing › routing design
routing architecture
0.112010
LISP-TREE: A DNS Hierarchy to Support the LISP Mapping System · IEEE J. Sel. Areas Commun. 2010
Internet architecture and protocols
domain name system
0.012010
LISP-TREE: A DNS Hierarchy to Support the LISP Mapping System · IEEE J. Sel. Areas Commun. 2010

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

measurement-driven simulation · 0.1
YearPublicationVenuePosition
2015 Location and identity privacy for LISP-MN
abstract
The current Internet architecture was not designed to easily accommodate mobility because IP addresses are used both to identify and locate hosts. The Locator/Identifier Separation Protocol (LISP) decouples them by considering two types of addresses: Endpoint IDentifiers (EIDs) to identify hosts, and Routing LOCators (RLOCs) that identify network attachment points. LISP, with such separation in place, also offers native mobility. In this context, LISP-MN is a particular case of LISP and specifies mobility. Mobility protocols have an inherent issue with privacy since some users may not want to reveal their location or their identity. In this paper, we present an overview of LISP-MN and propose solutions to enable privacy, both in terms of location and identity.
Alberto Rodríguez-Natal, Loránd Jakab, Vina Ermagan, Preethi Natarajan, Fabio Maino, Albert Cabellos-Aparicio
ICC2
2012 Implementing a BGP-free ISP core with LISP
abstract
The sustained growth of the global routing table is exerting an economical strain on ISPs by requiring untimely router upgrades. Notably, it has been speculated that the growth rate of router FIBs is surpassing that of its supporting technology and that the deployment of IPv6 is only to make matters worse. In this paper, we propose LISP-MPS, an architecture based on LISP, that isolates the intra-domain routing of an Autonomous System (AS) from its inter-domain routing. The resulting separation implies the decrease of backbone routing table sizes and enables an AS to control the forwarding of traffic inside its network. For a seamless, cost effective, and incremental deployment, LISP-MPS leverages iBGP to implement the LISP mapping system functionality with minimal modification to a small subset of deployed equipment. Finally, an analysis of realistic topologies shows that, despite changing how packets transit a network, the architecture does not lose resilience to failures. Moreover, we show that it can be a viable alternative to BGP/MPLS deployments due to its low implementation cost.
Florin Coras, Damien Saucez, Loránd Jakab, Albert Cabellos-Aparicio, Jordi Domingo-Pascual
GLOBECOM3
2011 Large-scale measurement experiments of P2P-TV systems insights on fairness and locality
Thomas Silverston, Loránd Jakab, Albert Cabellos-Aparicio, Olivier Fourmaux, Kavé Salamatian, Kenjiro Cho
Signal Process. Image Commun.2
2010 CoreCast: How core/edge separation can help improving inter-domain live streaming
Loránd Jakab, Albert Cabellos-Aparicio, Thomas Silverston, Marc Solé, Florin Coras, Jordi Domingo-Pascual
Comput. Networks1
2010 A collaborative P2P scheme for NAT Traversal Server discovery based on topological information
Rubén Cuevas Rumín, Ángel Cuevas, Albert Cabellos-Aparicio, Loránd Jakab, Carmen Guerrero
Comput. Networks4
2010 LISP-TREE: A DNS Hierarchy to Support the LISP Mapping System
abstract
During the last years, some operators have expressed concerns about the continued growth of the BGP routing tables in the default-free zone. Several proposed solutions for this issue are centered around the idea of separating the network node's identifier from its topological location. Among the existing proposals, the Locator/ID Separation Protocol (LISP) has seen important development and implementation effort. LISP relies on a mapping system to provide bindings between locators and identifiers. The mapping system is a critical protocol component, and its design is still an open issue. In this paper we present a new mapping system: LISP-TREE. It is based on DNS and has a similar hierarchical topology: blocks of identifiers are assigned to the levels of the hierarchy by following the current IP address allocation policies. We also present measurement-driven simulations of mapping systems' performance, assuming a deployment of LISP in the current Internet.
Loránd Jakab, Albert Cabellos-Aparicio, Florin Coras, Damien Saucez, Olivier Bonaventure
IEEE J. Sel. Areas Commun.1
2007 Measurement Based Call Quality Reporting
abstract
Real-time traffic is an important issue when designing networks. The growth in the deployment of voice applications in packet switched networks requires that the network can guarantee a minimum level of quality. At the same time, customers want guaranties that the proper quality of service is provided for their contracted services. In this environment service providers need means of reporting the quality level of their networks. Standardisation bodies define general metrics, such as delay, jitter or losses without giving detailed information regarding the actual user's perception of the traffic. Other approaches such as the mean opinion score (MOS), are too coarse to be significant on best-effort based environments such as the Internet. This work is motivated by the potential change in the quality of service (QoS) parameters found in packet switched networks. Which highlights the inaccuracy of metrics such as MOS, since they were designed for the stable circuit switched networks. This paper proposes a novel approach to on-line voice quality measurement which is more suitable for packet switched networks than the classical alternatives, while keeping the subjective approach of MOS. Moreover, our solution permits the real-time reporting of the voice communication's quality. Along with the specification of this metric, the paper provides an experimental validation of the proposal using a real testbed with real applications. The results show the higher accuracy in reporting using this proposal over the standard metrics currently used.
René Serral-Gracià, Loránd Jakab, Jordi Domingo-Pascual
LCN2