Sciweavers

36 search results - page 2 / 8
» Packet Routing in Dynamically Changing Networks: A Reinforce...
Sort
View
GLOBECOM
2008
IEEE
13 years 5 months ago
Autonomous Network Management Using Cooperative Learning for Network-Wide Load Balancing in Heterogeneous Networks
Traditional hop-by-hop dynamic routing makes inefficient use of network resources as it forwards packets along already congested shortest paths while uncongested longer paths may b...
Minsoo Lee, Xiaohui Ye, Dan Marconett, Samuel John...
CAMP
2005
IEEE
13 years 11 months ago
Reinforcement Learning for P2P Searching
— For a peer-to-peer (P2P) system holding massive amount of data, an efficient and scalable search for resource sharing is a key determinant to its practical usage. Unstructured...
Luca Gatani, Giuseppe Lo Re, Alfonso Urso, Salvato...
IFIPTCS
2010
13 years 3 months ago
A Game-Theoretic Approach to Routing under Adversarial Conditions
Abstract. We present a game-theoretic framework for modeling and solving routing problems in dynamically changing networks. The model covers the aspects of reactivity and non-termi...
James Gross, Frank G. Radmacher, Wolfgang Thomas
SIGITE
2005
ACM
13 years 11 months ago
Hands-on approach to teaching computer networking using packet traces
This paper describes a novel approach to teaching computer networking through packet traces of actual network traffic. The paper describes a set of exercises that use packet trace...
Jeanna Neefe Matthews
COMCOM
2008
127views more  COMCOM 2008»
13 years 5 months ago
A dynamic routing protocol for keyword search in unstructured peer-to-peer networks
The idea of building query-oriented routing indices has changed the way of improving keyword search efficiency from the basis as it can learn the content distribution from the que...
Cong Shi, Dingyi Han, Yuanjie Liu, Shicong Meng, Y...