Subscribe
Issue No.12 - December (2011 vol.22)
pp: 1978-1985
V. Sarangan , Chennai Innovation Labs., Tata Consultancy Services, Chennai, India
ABSTRACT
Virtual world and other collaborative applications are increasingly becoming popular among Internet users. In such applications, users interact with each other through digital entities or avatars. In order to preserve the user experience, it is important that certain Quality of Service (QoS) requirements (e.g., delay and bandwidth) are satisfied by the interactions. These QoS requirements are usually defined by the application designer. When applications with such QoS requirements are being deployed on a network of servers, an appropriate set of servers capable of satisfying the QoS constraints of the interactions must be identified. This identification process is nothing, but the subgraph homeomorphism problem. In this paper, we present polynomial-time solutions for a special case of this problem viz. subtree homeomorphism problem, wherein the guest and the host graphs are both trees. We also discuss generalizations of the subtree homeomorphism problem and present polynomial-time solutions.
INDEX TERMS
virtual reality, graph theory, groupware, Internet, polynomial time solution, delay constrained subtree homeomorphism problem, virtual world, collaborative application, Internet users, user experience, quality of service, QoS requirements, application designer, QoS constraints, subgraph homeomorphism problem, Virtual environments, User centered design, Bipartite graph, Complexity theory, User interfaces, Avatars, Quality of service, homeomorphic embedding., Virtual worlds, interaction tree, overlay networks, subtree homeomorphism
CITATION
V. Sarangan, "Delay Constrained Subtree Homeomorphism Problem with Applications", IEEE Transactions on Parallel & Distributed Systems, vol.22, no. 12, pp. 1978-1985, December 2011, doi:10.1109/TPDS.2011.110
REFERENCES
 [1] A.S. LaPaugh and R.L. Rivest, "The Subgraph Homeomorphism Problem," STOC '78: Proc. 10th Ann. ACM Symp. Theory of Computing. pp. 40-50, 1978. [2] A. Lingas and M. Wahlén, "An Exact Algorithm for Subgraph Homeomorphism," J. Discrete Algorithms, vol. 7, no. 4, pp. 464-468, Dec. 2009. [3] S. Fortune, J. Hopcroft, and J. Wyllie, "The Directed Subgraph Homeomorphism Problem," Theoretical Computer Science, vol. 10, pp. 111-121, 1980. [4] M.J. Chung, "O($n^{2.5}$ ) Time Algorithms for the Subgraph Homeomorphism Problem on Trees," J. Algorithms, vol. 8, no. 1, pp. 106-112, 1987. [5] M. Koyuturk, A. Grama, and W. Szpankowski, "An Efficient Algorithm for Detecting Frequent Subgraphs in Biological Networks," Proc. Intelligent Systems in Molecular Biology Conf. (ISMB), pp. 200-207. 2004. [6] M. Koyutürk, Y. Kim, S. Subramaniam, W. Szpankowski, and A. Grama, "Detecting Conserved Interaction Patterns in Biological Networks," J. Computational Biology, vol. 13, no. 2, pp. 1299-1322, 2006. [7] N. Nishimura, P. Ragde, and D.M. Thilikos, "Finding Smallest Supertrees under Minor Containment," Int'l J. Foundations of Computer Science, vol. 11, no. 3, pp. 445-465, 2000. [8] J.C.S. Lui and M.F. Chan, "An Efficient Partitioning Algorithm for Distributed Virtual Environment Systems," IEEE Trans. Parallel and Distributed Systems, vol. 13, no. 3, pp. 193-211, Mar. 2002. [9] D.A. Bray and B.R. Konsynski, "Virtual Worlds: Multi-Disciplinary Research Opportunities," ACM SIGMIS Database, vol. 38, no. 4, pp. 17-25, Nov. 2007. [10] D.L. Neyland, Virtual Combat: A Guide to Distributed Interactive Simulation. Stackpole Books, 1997. [11] R.M. Fujimoto, Parallel and Distributed Simulation Systems. Wiley-Interscience, 2000. [12] "Massive Multiplayer On-Line Role Playing Games," http:/www.mmorpg.com, 2011. [13] "Multiplayer On-Line Games," http:/www.mpogd.com, 2011. [14] G. Armitage, M. Claypool, and P. Branch, Networking and Online Games: Understanding and Engineering Multiplayer Online Games. John Wiley and Sons, 2006. [15] R. Bartle, Designing Virtual Worlds. New Riders, 2004. [16] "Entropia Universe," http:/www.entropiauniverse.com, 2011. [17] "Second Life," http:/www.secondlife.com, 2011. [18] J.C.S. Lui and M.F. Chan, "An Efficient Partitioning Algorithm for Distributed Virtual Environment Systems," IEEE Trans. Parallel Distributed Systems, vol. 13, no. 3, pp. 193-211, http://portal.acm.orgcitation.cfm?id=566137.566138 , Mar. 2002. [19] P. Morillo, S. Rueda, J.M. Orduna, and J. Duato, "A Latency-Aware Partitioning Method for Distributed Virtual Environment Systems," IEEE Trans. Parallel Distributed Systems, vol. 18, no. 9, pp. 1215-1226, http://dx.doi.org/10.1109TPDS.2007.1055, Sept. 2007. [20] T. Ballardie, P. Francis, and J. Crowcroft, "Core Based Trees (CBT)," Proc. Comm. Architectures, Protocols and Applications Conf., pp. 85-95, http://doi.acm.org/10.1145166237.166246, 1993. [21] J.E. Hopcroft and R.M. Karp, "An $n^{2.5}$ Algorithm for Maximum Matchings in Bipartite Graphs," SIAM J. Computing, vol. 2, pp. 225-231, 1973.