Back to Results
First PageMeta Content
Theoretical computer science / Routing algorithms / Routing / Shortest path problem / Routing and wavelength assignment / Link-state routing protocol / Mathematics / Graph theory / Network theory


Probe Station Selection for Robust Network Monitoring Deepak Jeswani∗‡ , Nakul Korde∗‡ , Dinesh Patil∗‡ , Maitreya Natu‡ , John Augustine† ‡ Tata † School
Add to Reading List

Document Date: 2009-11-13 17:38:42

Open Document

File Size: 176,55 KB

Share Result on Facebook

City

Cincinnati / San Francisco / Barcelona / Tel Aviv / /

Company

IBM / /

Country

Israel / Spain / /

/

Facility

Design Centre / Nanyang Technological University / /

IndustryTerm

actual network / node placement algorithms / polynomial time approximation algorithm / node placement algorithm / greedy algorithm / Internet instrumentation / Internet data analysis / greedy approximation algorithm / combinatorial search / real-systems / adaptive applications / Internet Measurement Conference / probe station selection algorithm / larger networks / approximation algorithms / /

Organization

Research Development and Design Centre / Cooperative association / IMC / Nanyang Technological University / Singapore / /

Person

John Byers / Si / Max Degree / A. Lakhina / Y. Bejerano / A. Medina / I. Matta / Rajeev Rastogi / Dinesh Patil / Deepak Jeswani / John Augustine / /

ProvinceOrState

Ohio / California / /

Technology

past algorithms / proposed algorithm / greedy approximation algorithm / tomography / Random node placement algorithms / SNR algorithm / greedy algorithm / Max Degree algorithm / approximation algorithms / proposed algorithms / Simulation / polynomial time approximation algorithm / Random node placement algorithm / network operations center / using approximation algorithms / probe station selection algorithm / /

URL

http /

SocialTag