Name
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. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1109/TPDS.2011.110 | IEEE Trans. Parallel Distrib. Syst. |
Keywords | DocType | Volume |
present polynomial-time solution,subgraph homeomorphism problem,internet user,users interact,problem viz,qos constraint,subtree homeomorphism problem,delay constrained subtree homeomorphism,application designer,polynomial-time solution,qos requirement,user interface,virtual environment,internet,user centered design,quality of service,groupware,overlay networks,virtual reality,graph theory,user experience,bipartite graph,user interfaces,overlay network,virtual worlds | Journal | 22 |
Issue | ISSN | Citations |
12 | 1045-9219 | 0 |
PageRank | References | Authors |
0.34 | 8 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sridhar Radhakrishnan | 1 | 341 | 43.65 |
| Shankar M. Banik | 2 | 55 | 8.42 |
| Venkatesh Sarangan | 3 | 269 | 30.48 |
| Chandra N. Sekharan | 4 | 105 | 12.77 |