Pranay Anchuri
ABSTRACT
Large-scale websites are predominantly built as a service-oriented architecture. Here, services are specialized for a certain task, run on multiple machines, and communicate with each other to serve a user's request. Reducing latency and improving the cost to serve is quite important, but optimizing this service call graph is particularly challenging due to the volume of data and the graph's non-uniform and dynamic nature.
In this paper, we present a framework to detect hotspots in a service-oriented architecture. The framework is general, in that it can handle arbitrary objective functions. We show that finding the optimal set of hotspots for a metric, such as latency, is NP-complete and propose a greedy algorithm by relaxing some constraints. We use a pattern mining algorithm to rank hotspots based on the impact and consistency. Experiments on real world service call graphs from LinkedIn, the largest online professional social network, show that our algorithm consistently outperforms baseline methods.
- A. Akella, S. Seshan, and A. Shaikh. An empirical evaluation of wide-area internet bottlenecks. In IMC, pages 101--114, 2003. Google Scholar
Digital Library
- N. Amenta, F. Clarke, and K. S. John. A linear-time majority tree algorithm. In Algorithms in Bioinformatics, volume 2812 of Lecture Notes in Computer Science, pages 216--227. Springer Berlin Heidelberg, 2003.Google Scholar
- C. Borgelt. Efficient implementations of apriori and eclat. In Proc. 1st IEEE ICDM Workshop on Frequent Item Set Mining Implementations (FIMI 2003), page 90, 2003.Google Scholar
- U. Brandes. On variants of shortest-path betweenness centrality and their generic computation. Social Networks, 30(2), 2008.Google Scholar
- A. Cuzzocrea, D. Katsaros, Y. Manolopoulos, and A. Papadimitriou. EBC: A topology control algorithm for achieving high qos in sensor networks. In QSHINE, Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, pages 613--626, 2009.Google Scholar
- U. Feige. A threshold of Ln N for approximating set cover. J. ACM, 45(4):634--652, July 1998. Google ScholarDigital Library
- R. Fonseca, G. Porter, R. H. Katz, S. Shenker, and I. Stoica. X-trace: A pervasive network tracing framework. In NSDI, pages 20--20, Berkeley, CA, USA, 2007. USENIX Association. Google ScholarDigital Library
- M. Girvan and M. E. J. Newman. Community structure in social and biological networks. Proceedings of the National Academy of Sciences, 99(12):7821--7826, 2002.Google ScholarCross Ref
- B. Goethals. Survey on frequent pattern mining. Technical report, 2003.Google Scholar
- H. Gou and Y. Yoo. Distributed bottleneck node detection in wireless sensor network. In CIT, pages 218--224. IEEE Computer Society, 2010. Google ScholarDigital Library
- J. Han, H. Cheng, D. Xin, and X. Yan. Frequent pattern mining: Current status and future directions. Data Mining and Knowledge Discovery, 15(1):55--86, Aug. 2007. Google ScholarDigital Library
- K. Harfoush, A. Bestavros, and J. W. Byers. Measuring bottleneck bandwidth of targeted path segments. In INFOCOM, 2003.Google ScholarCross Ref
- N. Hu, L. E. Li, Z. M. Mao, P. Steenkiste, and J. Wang. Locating internet bottlenecks: Algorithms, measurements, and implications. In SIGCOMM, pages 41--54, New York, NY, USA, 2004. ACM. Google ScholarDigital Library
- N. Hu, L. E. Li, Z. M. Mao, P. Steenkiste, and J. Wang. A measurement study of internet bottlenecks. In INFOCOM, pages 1689--1700. IEEE, 2005.Google Scholar
- R. Karp. Reducibility among combinatorial problems. In R. Miller and J. Thatcher, editors, Complexity of Computer Computations, pages 85--103. Plenum Press, 1972.Google ScholarCross Ref
- G. Mann, M. Sandler, D. Krushevskaja, S. Guha, and E. Even-Dar. Modeling the parallel execution of black-box services. In HotCloud, pages 20--20, Berkeley, CA, USA, 2011. USENIX Association. Google ScholarDigital Library
- M. Marzolla and R. Mirandola. Performance prediction of web service workflows. In S. Overhage, C. A. Szyperski, R. Reussner, and J. A. Stafford, editors, QoSA, volume 4880 of Lecture Notes in Computer Science, pages 127--144. Springer, 2007. Google ScholarDigital Library
- N. Moha, F. Palma, M. Nayrolles, B. J. Conseil, G. Yann-Gael, B. Baudry, and J.-M. Jézéquel. Specification and Detection of SOA Antipatterns. In F. T. Chengfei Liu, Heiko Ludwig, editor, Proccedings of the International Conference on Service Oriented Computing (ICSOC), Shanghai, China, Nov. 2012. Google ScholarDigital Library
- K. Ostrowski, G. Mann, and M. Sandler. Diagnosing latency in multi-tier black-box services. In LADIS, 2011.Google Scholar
- V. J. Ribeiro, R. H. Riedi, and R. G. Baraniuk. Spatio-temporal available bandwidth estimation for high-speed networks. In In Proc. of the First Bandwidth Estimation Workshop, 2003.Google Scholar
- R. R. Sambasivan, A. X. Zheng, M. D. Rosa, E. Krevat, S. Whitman, M. Stroucken, W. Wang, L. Xu, and G. R. Ganger. Diagnosing performance changes by comparing request flows. In NSDI, 2011. Google ScholarDigital Library
- B. H. Sigelman, L. A. Barroso, M. Burrows, P. Stephenson, M. Plakal, D. Beaver, S. Jaspan, and C. Shanbhag. Dapper, a large-scale distributed systems tracing infrastructure. Technical report, Google, Inc., 2010.Google Scholar
- S. Sul and T. L. Williams. Fast hashing algorithms to summarize large collections of evolutionary trees, 2008.Google Scholar
- C. Wang, S. Wang, and Y. Wei. A coarse-grained bottleneck detection method with data buffer mechanism for wireless sensor networks. In 2nd International Conference on Computer Science and Network Technology (ICCSNT), pages 2015--2018, 2012.Google ScholarCross Ref
Index Terms
- Hotspot Detection in a Service-Oriented Architecture
Recommendations
Root cause detection in a service-oriented architecture
Performance evaluation reviewLarge-scale websites are predominantly built as a service-oriented architecture. Here, services are specialized for a certain task, run on multiple machines, and communicate with each other to serve a user's request. An anomalous change in a metric of ...
Service-oriented architecture (SOA)concepts and implementations
SIGAda '11: Proceedings of the 2011 ACM annual international conference on Special interest group on the ada programming languageThis tutorial explains how to implement a Service-Oriented Architecture (SOA) for reliable systems using Enterprise Service Bus (ESB) technologies. The first half of the tutorial describes terms of Service-Oriented Architectures (SOA) including service, ...
Functionality-Based Service Matchmaking for Service-Oriented Architecture
ISADS '07: Proceedings of the Eighth International Symposium on Autonomous Decentralized SystemsService matchmaking is a basic feature of Service- Oriented Architecture (SOA). In this paper, a semantic-based flexible service matchmaking approach is presented to efficiently identifying functionalitycompatible services. This approach utilizes SAWOWL-...
Comments