View Document Preview and Link
Document Date: 2013-12-04 11:29:25 Open Document File Size: 683,16 KB Share Result on Facebook
Company Elsevier Science B.V. / / Country United States / / / Facility Washington University / University of Massachusetts / Campus Box / / IndustryTerm layered graph algorithm / programmable routers / compression algorithm / end systems / programmable networks / layer network / encryption processing / efficient solution / ith intermediate processing step / shortest path algorithm / decryption processing / potential processing site / performance routers / active networking / incompatible end systems / cheaper solution / approximation algorithms / site processing / arbitrary applications / basic processing step / intermediate processing / intermediate processing nodes / needed processing / heuristic algorithm / efficient algorithm / computational services / unicast applications / feasible solution / resource accounting / interactive network design tool / path search / random regular network / purpose processing capabilities / intermediate processing steps / intermediate processing site / decompression processing / realistic algorithms / capacity tracking search / added processing / / Organization Washington University in St. Louis / Washington University / St. Louis / Tilman Wolf b / 1 Department of Computer Science and Engineering / University of Massachusetts / Amherst / Department of Electrical and Computer Engineering / / Person Jonathan Turner / Sumi Choi / / Position author was / Corresponding author / Responsible Editor / / ProvinceOrState Missouri / Massachusetts / / Technology heuristic algorithm / performance routers / image compression / DijkstraÕs shortest path algorithm / DijkstraÕs algorithm / encryption / layered graph algorithm / efficient algorithm / compression algorithm / network routers / approximation algorithms / simulation / following algorithms / / URL www.elsevier.com/locate/comnet / / SocialTag