Publicado por LAP LAMBERT Academic Publishing Aug 2010, 2010
ISBN 10: 3838390660 ISBN 13: 9783838390666
Idioma: Inglés
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
EUR 59,00
Convertir monedaCantidad disponible: 2 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Neuware -This book proposes a search technique and a replication scheme for unstructured P2P networks. The proposed search scheme - ¿distributed search technique (DST) is formulated with the aim of achieving effective query load balancing, high hit ratio, low network traffic and adaptive behavior for unstructured P2P networks. DST effectively alleviates the partial coverage problem and the majority of nodes, excluding free-riders, are covered during searching. The duplicate messages are effectively routed. Specialized peers are given importance while routing. The proposed replication scheme known as 'Q-replication' employs Q-learning for the autonomous replication of objects. The Q-replication effectively distributes the popular objects and thereby contributes to the improvement of success rate and fault tolerance without depending on search paths.Books on Demand GmbH, Überseering 33, 22297 Hamburg 160 pp. Englisch.
Publicado por LAP LAMBERT Academic Publishing, 2010
ISBN 10: 3838390660 ISBN 13: 9783838390666
Idioma: Inglés
Librería: moluna, Greven, Alemania
EUR 48,50
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: M THAMPI SABUDr. Sabu M. Thampi is a Professor in the Department of Computer Science and Engineering, Rajagiri School of Engineering and Technology, Kerala, India. He has completed PhD degree in Computer Engineering from National I.
Publicado por LAP LAMBERT Academic Publishing Aug 2010, 2010
ISBN 10: 3838390660 ISBN 13: 9783838390666
Idioma: Inglés
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
EUR 59,00
Convertir monedaCantidad disponible: 2 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This book proposes a search technique and a replication scheme for unstructured P2P networks. The proposed search scheme - distributed search technique (DST) is formulated with the aim of achieving effective query load balancing, high hit ratio, low network traffic and adaptive behavior for unstructured P2P networks. DST effectively alleviates the partial coverage problem and the majority of nodes, excluding free-riders, are covered during searching. The duplicate messages are effectively routed. Specialized peers are given importance while routing. The proposed replication scheme known as 'Q-replication' employs Q-learning for the autonomous replication of objects. The Q-replication effectively distributes the popular objects and thereby contributes to the improvement of success rate and fault tolerance without depending on search paths. 160 pp. Englisch.
Publicado por LAP LAMBERT Academic Publishing, 2010
ISBN 10: 3838390660 ISBN 13: 9783838390666
Idioma: Inglés
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 59,00
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - This book proposes a search technique and a replication scheme for unstructured P2P networks. The proposed search scheme - distributed search technique (DST) is formulated with the aim of achieving effective query load balancing, high hit ratio, low network traffic and adaptive behavior for unstructured P2P networks. DST effectively alleviates the partial coverage problem and the majority of nodes, excluding free-riders, are covered during searching. The duplicate messages are effectively routed. Specialized peers are given importance while routing. The proposed replication scheme known as 'Q-replication' employs Q-learning for the autonomous replication of objects. The Q-replication effectively distributes the popular objects and thereby contributes to the improvement of success rate and fault tolerance without depending on search paths.