A Construction of Locality-Aware Overlay Network: mOverlay and Its Performance

Zhang, Xin Yan; Zhang, Qian; Zhang, Zhensheng; Song, Guanglei; Zhu, Wenwu

doi:10.1109/jsac.2003.818780

Cited by 121 publications

(98 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Clustering technique is a widely used technique in the research literature [8][9][10]. The fundamental idea is to find nodes that are close to each other, and provide this locality information to applications to achieve better performance.…”

Section: A Physical Network Partitionmentioning

confidence: 99%

See 1 more Smart Citation

Supporting a seamless map in peer-to-peer system for Massively Multiplayer Online Role Playing Games

Jiang

Safaei

2008

2008 33rd IEEE Conference on Local Computer Networks (LCN)

View full text Add to dashboard Cite

This conference paper was originally published as Jiang, X and Safaei, F, Supporting a seamless map in peer-to-peer system for massively multiplayer online role playing games, 33rd IEEE Conference on Local Computer Networks, LCN 2008, Montreal, Canada, 14-17 October 2008. Copyright Institute of Electrical and Electronics Engineers 2008. Original conference paper available here Supporting a seamless map in peer-to-peer system for massively multiplayer online role playing games AbstractMassively Multiplayer Online Role Playing Games feature huge maps that can be partitioned into smaller components called zones to achieve scalability. In peer-to-peer (P2P) systems, those zones can be assigned to peers who are willing to take up the role of zone servers. A seamless map requires inter-zone communications to allow interactions between players across zone boundaries. In assigning zones to peers, it is critical to seek approaches to reduce the inter-zone communication cost in P2P system. In this paper, we formulate the zone assignment problem for P2P system and demonstrate that the problem is NP-hard. We hence propose a lowcost heuristic that partitions the physical network into bins, as well as, aggregating the partitions of the virtual world by clustering neighboring zones in a game map. We then demonstrate that by assigning clustered neighboring zones in the virtual map into peers in common physical network bins, we are able to achieve similar inter-zone communication cost for the zone assignment problem as that can be achieved by the optimization model we formulated, while avoiding the prohibitively high computation cost required by the latter. Disciplines Physical Sciences and Mathematics Publication DetailsThis conference paper was originally published as Jiang, X and Safaei, F, Supporting a seamless map in peer-topeer system for massively multiplayer online role playing games, Abstract -Massively Multiplayer Online Role Playing Games feature huge maps that can be partitioned into smaller components called zones to achieve scalability. In peer-to-peer (P2P) systems, those zones can be assigned to peers who are willing to take up the role of zone servers. A seamless map requires inter-zone communications to allow interactions between players across zone boundaries. In assigning zones to peers, it is critical to seek approaches to reduce the inter-zone communication cost in P2P system. In this paper, we formulate the zone assignment problem for P2P system and demonstrate that the problem is NP-hard. We hence propose a low-cost heuristic that partitions the physical network into bins, as well as, aggregating the partitions of the virtual world by clustering neighboring zones in a game map. We then demonstrate that by assigning clustered neighboring zones in the virtual map into peers in common physical network bins, we are able to achieve similar inter-zone communication cost for the zone assignment problem as that can be achieved by the optimization model we formulated, while avoiding the prohibitively high computa...

show abstract

Section: A Physical Network Partitionmentioning

confidence: 99%

“…The constraints in (8) ensure that each zone in the map can only be assigned to one bin. The constraints in equation (9) ensure that the number of zones assigned to a bin is less than or equal to the number of peers in that bin who are willing to take up the role of the servers for the zones.…”

Section: B Formulationmentioning

confidence: 99%

Supporting a seamless map in peer-to-peer system for Massively Multiplayer Online Role Playing Games

Jiang

Safaei

2008

2008 33rd IEEE Conference on Local Computer Networks (LCN)

View full text Add to dashboard Cite

show abstract

“…However, it is a general concern in the research field [8,9,10] that the uniform distribution of NodeID in Pastry could lead to long hop distance. In addition, large-sized Scribe multicast tree may have nodes subject to excessive stress.…”

Section: Enhancing the Multicast Performance Of Scribementioning

confidence: 99%

“…Clustering technique is a widely discussed topic in the research field [8,9,10]. The idea is to find nodes that are close to each other, and provide this locality information to applications to achieve better performance.…”

Section: B Apply Pns To the Final Hop 1) Motivation And Approachmentioning

confidence: 99%

“…By clustering nodes, this possibility is eliminated because the traffic path is constrained to local links. In this paper, we rely on available techniques [8,9,10] for node clustering. However, we envisage that game distributed design might have specific needs for clustering techniques, for which we will leave it to the future work to investigate.…”

Section: B Apply Pns To the Final Hop 1) Motivation And Approachmentioning

confidence: 99%

See 1 more Smart Citation

Enhancing the multicast performance of structured P2P overlay in supporting Massively Multiplayer Online Games

Jiang

Safaei

Boustead

2007

2007 15th IEEE International Conference on Networks

View full text Add to dashboard Cite

Scribe is a scalable application level multicast infrastructure. We have developed two techniques to improve the performance of Scribe in terms of latency and bandwidth distribution. The first technique identifies that the final hop of Scribe traffic path is largely selected without any proximity consideration and incurs the longest distance traveled. To overcome this, we introduce Proximity Neighbor Selection (PNS) into the final hop for latency improvement. The second technique builds a hierarchical two-level overlay. While PNS can be applied at both levels for latency performance, the bandwidth stress required by applications can now be distributed among the nodes in the higher level overlay. Our simulation using GT-ITM topology has shown that both techniques have improved the latency performance for more than 30 percent, and the two-level overlay has improved the bandwidth distribution up to 2.7 times, comparing with what can be achieved by a standard Scribe overlay. We have developed the techniques in the context of Massively Multiplayer Online Games (MMOGs). While Scribe provides a possible platform for the scalable deployment of MMOGs, game developers may leverage the techniques to enhance the design of real-time interactions between players in the game world. Disciplines Physical Sciences and Mathematics Publication DetailsThis conference paper was originally published as Jiang, X, Safaei, F, Boustead, P, Enhancing the multicast performance of structured P2P overlay in supporting

show abstract

Broadcast Television over the Internet

Paul

2010

Digital Video Distribution in Broadband, Television, Mobile and Converged Networks

View full text Add to dashboard Cite

A Construction of Locality-Aware Overlay Network: mOverlay and Its Performance

Cited by 121 publications

References 17 publications

Supporting a seamless map in peer-to-peer system for Massively Multiplayer Online Role Playing Games

Supporting a seamless map in peer-to-peer system for Massively Multiplayer Online Role Playing Games

Enhancing the multicast performance of structured P2P overlay in supporting Massively Multiplayer Online Games

Broadcast Television over the Internet

Contact Info

Product

Resources

About