Optimal multi-step k-nearest neighbor search
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
The anatomy of a large-scale hypertextual Web search engine
WWW7 Proceedings of the seventh international conference on World Wide Web 7
Fast Nearest Neighbor Search in Medical Image Databases
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Profile-based Query Routing in a Mobile Social Network
MDM '06 Proceedings of the 7th International Conference on Mobile Data Management
Social network analysis for routing in disconnected delay-tolerant MANETs
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Bubble rap: social-based forwarding in delay tolerant networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
DHT routing using social links
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
| Hi-index | 0.00 |
In many network and IT systems, users submit loosely-defined (or fuzzy) requests to obtain answers, solutions or resources. In this paper, we focus on trouble-shooting problem tickets in an IT service management system. In such a system, problems are typically reported using vague user-generated descriptions of the symptoms (e.g., 'my email is not working!') in a ticket. IT Specialists are then responsible for identifying the troubled component from the reported symptoms. Usually, the ticket is sent to one Specialist at a time until it is resolved hence, an efficient mechanism to select the (next) potential Specialist becomes critical towards a timely resolution of the ticket. In this paper, we introduce a framework to deal with fuzzy requests in a distributed environment. We first show the importance of considering both the traditional graph-based network routing efficiency as well as social network theory to generate important ranking metrics. For each newly arrived ticket, we propose several selection and ranking policies to choose and rank IT Specialists who can potentially resolve the ticket. We evaluate the ranking system with synthetic tickets, generated by an in-depth simulated IT management model that closely mimics an operational system. Our preliminary results suggest the importance of considering both routing efficiency and social connectivity to minimize the resolution time of a ticket.