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.

Nathanael Van Vorst

dblp:62/3459 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 2011
—ORCID · none

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

Systems, architecture and hardware · 1 · 1 first-authorComputer networks · 1Software engineering, systems software and programming languages · 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
Network performance modeling · 67% Network measurement and analytics · 33%

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

TopicWeightPapersLastEvidence papers
Network performance modeling › network emulation
large-scale emulation
0.112007
An Open and Scalable Emulation Infrastructure for Large-Scale Real-Time Network Simulations · INFOCOM 2007
Network performance modeling
network simulation
0.112007
An Open and Scalable Emulation Infrastructure for Large-Scale Real-Time Network Simulations · INFOCOM 2007
Network measurement and analytics › measurement infrastructure
network testbed
0.112007
An Open and Scalable Emulation Infrastructure for Large-Scale Real-Time Network Simulations · INFOCOM 2007

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

virtual private network · 0.1simulation · 0.1
YearPublicationVenuePosition
2011 How Low Can You Go? Spherical Routing for Scalable Network Simulations
abstract
Memory consumption is a critical problem for large-scale network simulations. Particularly, the large memory footprint needed for maintaining routing tables can severely obturate scalability. We present an approach of composing large-scale network models using sharable model fragments to achieve significant reduction in the amount of memory required for storing forwarding tables in simulation. Our approach, called spherical routing, conducts static routing within spheres according to user-defined policies. Our routing scheme pre-calculates the forwarding table for each routing sphere, and allows spheres with identical sub-structures to share forwarding tables. Through extensive experiments we demonstrate that our approach can achieve several orders of magnitude in memory reduction for large-scale network models.
Nathanael Van Vorst, Ting Li 0024, Jason Liu 0001
MASCOTS1
2009 A real-time network simulation infrastructure based on OpenVPN
Jason Liu 0001, Yue Li 0019, Nathanael Van Vorst, Scott Mann, Keith Hellman
J. Syst. Softw.3
2007 An Open and Scalable Emulation Infrastructure for Large-Scale Real-Time Network Simulations
abstract
We present a software infrastructure that embeds physical hosts in a simulated network. Aiming to create a large-scale real-time virtual network testbed, our real-time interactive simulation approach combines the advantages of both simulation and emulation, by maintaining flexibility of the simulation models and increasing fidelity as real systems are included in the simulation. In our approach, real-world distributed applications and network services can run together with the real-time simulator; real packets are injected into the simulation and subject to the simulated network conditions computed as a result of both real and virtual traffic competing for network resources. A prototype of the proposed emulation infrastructure has been implemented based on virtual private network (VPN). One distinct advantage of our approach is that it does not require special hardware. Furthermore, it is flexible, secure, and scalable-attributes inherited directly from the VPN implementation. We conducted a set of preliminary experiments to assess the performance limitations of our emulation infrastructure. We also present an interesting case study to demonstrate the capability of our approach.
Jason Liu 0001, Scott Mann, Nathanael Van Vorst, Keith Hellman
INFOCOM3