Title
Load Skew in Cell-Based Interest Management Systems
Abstract
In large, real-time interactive distributed systems such as distributed simulations and multiplayer games, interest management (IM) is often implemented using a cell-based paradigm. In such a paradigm the subscription patterns of interactive clients are mapped on to some set of disjoint regions or cells which are typically hosted within a routing network made up either of dedicated machines or of the clients themselves. These systems often incorporate some mechanism for balancing the load placed on this routing network, on the assumption that interests over this population of cells will be non-uniform. Using a set of reference models for cell-based IM systems found in the research corpus, we evaluate the extent to which this phenomenon takes place. We also evaluate what effects an adaptive algorithm from previous work by Minson, R. and Theodoropoulos, G. (2007) has on this phenomenon.
Year
DOI
Venue
2008
10.1109/DS-RT.2008.41
Vancouver, BC
Keywords
Field
DocType
client-server systems,real-time systems,resource allocation,telecommunication network routing,IM systems,adaptive algorithm,cell-based interest management systems,dedicated machines,distributed simulations,interactive clients,load balancing,load skew,multiplayer games,real-time interactive distributed systems,routing network,Distributed Virtual Environments,Interest Management,Load Balancing,Peer-to-Peer
Population,Peer-to-peer,Reference model,Computer science,Adaptive system,Load balancing (computing),Server,Computer network,Real-time computing,Resource allocation,Adaptive algorithm,Distributed computing
Conference
ISSN
ISBN
Citations 
1550-6525
978-0-7695-3425-1
1
PageRank 
References 
Authors
0.34
11
2
Name
Order
Citations
PageRank
Minson, R.110.34
Theodoropoulos, G.21108.22