Search

Your search keyword '"Golubchik, Leana"' showing total 307 results
Start Over Author "Golubchik, Leana"
307 results on '"Golubchik, Leana"'

53. When Are Cyber Blackouts in Modern Service Networks Likely?

Author

Pal, Ranjan, primary, Psounis, Konstantinos, additional, Crowcroft, Jon, additional, Kelly, Frank, additional, Hui, Pan, additional, Tarkoma, Sasu, additional, Kumar, Abhishek, additional, Kelly, John, additional, Chatterjee, Aritra, additional, Golubchik, Leana, additional, Sastry, Nishanth, additional, and Nag, Bodhibrata, additional

Published
2020
Full Text
View/download PDF

55. AMBROSia: An Autonomous Model-Based Reactive Observing System

Author

Caron, David, primary, Das, Abhimanyu, additional, Dhariwal, Amit, additional, Golubchik, Leana, additional, Govindan, Ramesh, additional, Kempe, David, additional, Oberg, Carl, additional, Sharma, Abhishek, additional, Stauffer, Beth, additional, Sukhatme, Gaurav, additional, and Zhang, Bin, additional

Published
2007
Full Text
View/download PDF

61. Data Migration on Parallel Disks

Author

Golubchik, Leana, primary, Khuller, Samir, additional, Kim, Yoo-Ah, additional, Shargorodskaya, Svetlana, additional, and Wan, Yung-Chun (Justin), additional

Published
2004
Full Text
View/download PDF

63. Are cyber-blackouts in service networks likely?: Implications for Aggregate Cyber Risk Management

Author

Pal, Ranjan, Psounis, Konstantinos, Kumar, Abhishek, Crowcroft, Jon, Hui, Pan, Golubchik, Leana, Kelly, John, Chatterjee, Aritra, Tarkoma, Sasu, Department of Computer Science, Content-Centric Structures and Networking research group / Sasu Tarkoma, and Helsinki Institute for Information Technology

Subjects
113 Computer and information sciences
Abstract

@TechReport{UCAM-CL-TR-926, author = {Pal, Ranjan and Psounis, Konstantinos and Kumar, Abhishek and Crowcroft, Jon and Hui, Pan and Golubchik, Leana and Kelly, John and Chatterjee, Aritra and Tarkoma, Sasu}, title = {{Are cyber-blackouts in service networks likely?: implications for cyber risk management}}, year = 2018, month = oct, url = {https://www.cl.cam.ac.uk/techreports/UCAM-CL-TR-926.pdf}, institution = {University of Cambridge, Computer Laboratory}, number = {UCAM-CL-TR-926} } Service liability interconnections among networked IT and IoT driven service organizations create potential channels for cascading service disruptions due to modern cybercrimes such as DDoS, APT, and ransomware attacks. The very recent Mirai DDoS and WannaCry ransomware attacks serve as famous examples of cyber-incidents that have caused catastrophic service disruptions worth billions of dollars across organizations around the globe. A natural question that arises in this context is “what is the likelihood of a cyber-blackout?”, where the latter term is defined as: “the probability that all (or a major subset of) organizations in a service chain become dysfunctional in a certain manner due to a cyber-attack at some or all points in the chain”. The answer to this question has major implications to risk management businesses such as cyber-insurance when it comes to designing policies by risk-averse insurers for providing coverage to clients in the aftermath of such catastrophic network events. In this paper, we investigate this question in general as a function of service chain networks and different loss distribution types. We show somewhat surprisingly (and discuss potential practical implications) that following a cyber-attack, the probability of a cyber-blackout and the increase in total service-related monetary losses across all organizations, due to the effect of (a) network interconnections, and (b) a wide range of loss distributions, are mostly very small, regardless of the network structure – the primary rationale behind the results being attributed to degrees of heterogeneity in wealth base among organizations, and Increasing Failure Rate (IFR) property of loss distributions.

Published
2018

82. Multi-torrent: a performance study and applications

Author

Yang, Yan, Chow, Alix L.H., and Golubchik, Leana

Subjects
Internet/Web search services -- Research, Internet search software, Internet/Web search service, Text search and retrieval software, Performance improvement, Mass communications
Abstract

Byline: Yan Yang, Alix L.H. Chow, Leana Golubchik Empirical evidence suggests that most nodes in BitTorrent (BT) participate in multiple torrents, but surprisingly little research exists on this topic. Here, we focus on a multi-torrent system, and specifically on (a) what incentives could be provided for nodes to contribute resources as seeds in a multi-torrent environment, and (b) what are the resulting performance consequences. We show why the current BT lacks incentives for nodes to stay as seeds. Motivated by that, we propose a cross torrent based method to encourage nodes to stay as seeds and present an extensive performance study to illustrate the benefits of our approach.

Published
2009

83. Editorial

Author

Chaintreau, Augustin, primary, Golubchik, Leana, additional, and Zhang, Zhi-Li, additional

Published
2017
Full Text
View/download PDF

86. Picture-perfect streaming over the Internet: Is there hope?

Author

Abdouni, Bassem, Cheng, Bill, Chow, Alix L.H., Golubchik, Leana, and Lui, John C.S.

Subjects
Streaming media technology, Internet, Technology application, Computer networks -- Analysis, Information networks -- Analysis, Streaming media -- Analysis, Internet -- Technology application
Published
2004

87. Sync Classes: A Framework for Optimal Scheduling of Requests in Multimedia Storage Servers

Author

Golubchik, Leana, Subrahmanian, V.S., Marcus, Sherry, and Biskup, Joachim

Subjects
Information storage and retrieval -- Methods, Database administration -- Methods, Database management systems -- Evaluation, Business, Computers, Electronics, Electronics and electrical industries
Abstract

There have been many proposals on how media-on-demand servers can effectively allow clients to share resources. In this paper, given a set of clients, we show how these clients may be partitioned into 'sync-classes'--sets of clients who can be serviced through allocation of a single set of resources. As a set of clients may be partitioned into sync-classes in many different ways, we show that a very large class of cost functions may be used to determine which partition to choose. We provide algorithms to compute such optimal splits. Our framework is very generic in the following ways: 1) The system may plug-in any cost function whatsoever, as long as it satisfies four common-sense axioms that evaluate costs, and 2) the system may evaluate the future anticipated requests of a user using any user model (e.g., a Markovian model) that has a specified I/O interface. Thus, a wide variety of predictive methods (of what the user will do) and a wide variety of costing methods may be used within our framework. Index Terms--Media-on-demand servers, scheduling, optimization, interactive systems, storage servers.

Published
2000

90. Bistro: a scalable and secure data transfer service for digital government applications

Author

Golubchik, Leana, Cheng, William C., Chou, Cheng-Fu, Khuller, Samir, Samet, Hanan, and Wan, Y.C. Justin

Subjects
Government systems management, Technology application, Company systems management, University of Maryland -- Research, Data entry -- Information management, Data entry -- Research, Data entry -- Technology application
Published
2003

94. Design of fault-tolerant large-scale VOD servers: With emphasis on high-performance and low-cost

Author

Golubchik, Leana, Muntz, Richard R., Chou, Cheng-Fu, and Berson, Steven

Subjects
Fault tolerance (Computers) -- Research, Pay-per-view television -- Design and construction, Business, Computers, Electronics, Electronics and electrical industries
Abstract

Alternative methods for the design of fault-tolerant large-scale video-on-demand servers are considered, with a focus on high performance and low cost.

Published
2001

96. MRM

Author

Moshref, Masoud, primary, Sharma, Abhishek B., additional, Madhyastha, Harsha V., additional, Golubchik, Leana, additional, and Govindan, Ramesh, additional

Published
2013
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results