| Document Date: 2008-09-24 03:39:48
Open Document File Size: 392,42 KBShare Result on Facebook
City Delft / Budapest / / Company BitTorrent / European Grid Research Laboratory / / Country Netherlands / / / Facility Delft University of Technology / / IndustryTerm computation-intensive applications / interoperable brokering solution / search request / bag-of-tasks applications / learning-based search techniques / search keys / proposed solutions / utilized brokers / node search / query routing algorithm / rarest first algorithms / internet routing protocol / inefficient solution / peerto-peer technologies / information systems / computing / peer-topeer networking / search key falls / larger networks / Web technologies / recursive refinement algorithm / overlay network / choke algorithm / i.e. search keys / autonomous infrastructure / suitable solution / / Organization Institute on Resource Management and Scheduling CoreGRID / European Commission / Delft University of Technology / / Position step forward / broker / Grid Meta-Broker / General / / ProgrammingLanguage XML / / Technology promising peerto-peer technologies / XML / choke algorithm / Cycloid protocol / Kademlia algorithm / peer-to-peer technologies / peer-to-peer / Web technologies / recursive refinement algorithm / Bamboo protocol / dynamic good fair Name The Symphony protocol / P2P / query routing algorithm / OSPF internet routing protocol / routing algorithm / promising peer-to-peer technologies / / URL http /
SocialTag |
Investigating peer-to-peer meta-brokering in Grids A. Kert´esz, P. Kacsuk {attila.kertesz, kacsuk}@sztaki.hu MTA SZTAKI Computer and Automation Research Institute H-1518 Budapest, P.O. Box 63, Hungary