First Page | Meta Content | |
---|---|---|
![]() | Document Date: 2011-02-08 05:11:44Open Document File Size: 830,38 KBShare Result on FacebookCityBarcelona / San Diego / /CompanyFord / /CountrySpain / / /EventFDA Phase / /FacilityUniversity of Karlsruhe / /IndustryTermmedium size networks / sensor-actuator networks / large scale networks / large random networks / e.g. sensor-actuator networks / classical shortest path algorithms / random graph networks / ad-hoc networks / sensor-networks / classical routing algorithms / Internet Protocol / telephone network / start-up / node random graph network / random networks / /OrganizationService for Internet Applications / University of Karlsruhe / IFIP International Federation for Information Processing / Universität Karlsruhe / /PersonCurt Cramer / Ittai Abraham / Dahlia Malkhi / Ad-Hoc Routing / Bryan Ford / Hari Balakrishnan / Noam Nisan / M. Frans Kaashoek / Cyril Gavoille / Kendy Kutzner / Mikkel Thorup / Thomas Fuhrmann / Ion Stoica / Don Towsley Tian Bu / Robert Morris / David Karger / / /ProductC++ / /ProgrammingLanguageC++ / /ProvinceOrStateCalifornia / /PublishedMediumThe International Journal / /TechnologyUnmanaged Internet Protocol / 10 1 0.1 0.01 0.001 Our protocol / peer-to-peer / classical routing algorithms / simulation / classical shortest path algorithms / /SocialTag |