Michael Rabinovich

ORCID: 0000-0002-1215-9591
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Caching and Content Delivery
  • Peer-to-Peer Network Technologies
  • Advanced Data Storage Technologies
  • Network Traffic and Congestion Control
  • Internet Traffic Analysis and Secure E-voting
  • IPv6, Mobility, Handover, Networks, Security
  • Distributed systems and fault tolerance
  • Network Security and Intrusion Detection
  • Reservoir Engineering and Simulation Methods
  • Hydraulic Fracturing and Reservoir Analysis
  • Opportunistic and Delay-Tolerant Networks
  • Cloud Computing and Resource Management
  • Distributed and Parallel Computing Systems
  • Drilling and Well Engineering
  • Web Data Mining and Analysis
  • Business Process Modeling and Analysis
  • Cooperative Communication and Network Coding
  • Hydrocarbon exploration and reservoir analysis
  • Mobile Ad Hoc Networks
  • 3D Shape Modeling and Analysis
  • IoT and Edge/Fog Computing
  • Optimization and Search Problems
  • Mobile Agent-Based Network Management
  • Parallel Computing and Optimization Techniques
  • Computational Geometry and Mesh Generation

Case Western Reserve University
2012-2022

ETH Zurich
2016-2018

BP (United Kingdom)
2013-2018

American University of Ras Al Khaimah
2016

Carnegie Mellon University
2013-2014

Lancaster University
2013-2014

University of Duisburg-Essen
2013-2014

Microsoft Research (United Kingdom)
2013-2014

A.S. Watson (Netherlands)
2014

University of Florida
2014

The paper studies two types of events that often overload Web sites to a point when their services are degraded or disrupted entirely - flash (FEs) and denial service attacks (DoS). former created by legitimate requests the latter contain malicious whose goal is subvert normal operation site. We study properties both with special attention characteristics distinguish two. Identifying these allows formulation strategy for quickly discard requests. also show some content distribution networks...

10.1145/511446.511485 article EN 2002-05-07

The paper studies two types of events that often overload Web sites to a point when their services are degraded or disrupted entirely - flash (FEs) and denial service attacks (DoS). former created by legitimate requests the latter contain malicious whose goal is subvert normal operation site. We study properties both with special attention characteristics distinguish two. Identifying these allows formulation strategy for quickly discard requests. also show some content distribution networks...

10.1145/511483.511485 article EN 2002-01-01

Much work on the performance of Web proxy caching has focused high-level metrics such as hit rates, but ignored low level details "cookies", aborted connections, and persistent connections between clients proxies well servers. These have a strong impact performance, particularly in heterogeneous bandwidth environments where network speeds are significantly different than We evaluate through detailed simulations latency effects environments. drive our with packet traces from two scenarios:...

10.1109/infcom.1999.749258 article EN 1999-01-01

We present a scalable approach for the optimization of flip-preventing energies in general context simplicial mappings and specifically mesh parameterization. Our iterative minimization is based on observation that many distortion can be optimized indirectly by minimizing family simpler proxy energies. Minimization these proxies natural extension local/global ARAP energy. algorithm simple to implement scales datasets with millions faces. demonstrate our computation maps minimize conformal or...

10.1145/2983621 article EN ACM Transactions on Graphics 2017-04-14

We present a scalable approach for the optimization of flip-preventing energies in general context simplicial mappings and specifically mesh parameterization. Our iterative minimization is based on observation that many distortion can be optimized indirectly by minimizing family simpler proxy energies. Minimization these proxies natural extension local/global ARAP energy. algorithm simple to implement scales datasets with millions faces. demonstrate our computation maps minimize conformal or...

10.1145/3072959.2983621 article EN ACM Transactions on Graphics 2017-07-16

Much work in the analysis of proxy caching has focused on high-level metrics such as hit rates, and approximated actual reference patterns by ignoring exceptional cases connection aborts. Several these low-level details have a strong impact performance, particularly heterogeneous bandwidth environments modem pools connected to faster networks. Trace-driven simulation pool large ISP suggests that "cookies" dramatically affect cachability resources; wasted due aborted connections can more than...

10.1145/306225.306230 article EN ACM SIGMETRICS Performance Evaluation Review 1998-12-01

The Domain Name System (DNS) is a critical component of the Internet infrastructure. It allows users to interact with Web sites using human-readable names and provides foundation for transparent client request distribution among servers in platforms, such as content delivery networks. In this paper, we present methodologies efficiently discovering complex client-side DNS We further develop measurement techniques isolating behavior distinct actors Using these strategies, study various aspects...

10.1145/2504730.2504734 article EN 2013-10-22

The Internet crucially depends on the Domain Name System (DNS) to both allow users interact with system in human-friendly terms and also increasingly as a way direct traffic best content replicas at instant is requested. This paper an initial study into behavior properties of modern DNS system. We passively monitor related within residential network effort understand server behavior--as viewed through responses?and client requests that follows responses. present set wide ranging findings.

10.1145/2500098.2500100 article EN ACM SIGCOMM Computer Communication Review 2013-07-01

The paper proposes a protocol suite for dynamic replication and migration of Internet objects. It consists an algorithm deciding on the number location object replicas distributing requests among currently available replicas. Our approach attempts to place in vicinity majority requests, while ensuring at same time that no servers are overloaded. request distribution uses simple mechanism take into account both server proximity load, without actually knowing latter. replica placement executes...

10.1109/icdcs.1999.776511 article EN 2003-01-20

New demands brought by the continuing growth of Internet will be met in part more effective use caching Web and other services. We have developed CRISP, a distributed object cache targeted to needs organizations that aggregate end users services, particularly commercial Service Providers (ISPs) where much new occurs. A CRISP consists group cooperating servers sharing central directory cached objects. This simple obvious strategy is easily overlooked due well known drawbacks centralized...

10.1109/hotos.1997.595189 article EN 2002-11-22

Content delivery networks (CDNs) have become a crucial part of the modern Web infrastructure. This paper studies performance leading content provider - Akamai. It measures current Akamai platform and considers key architectural question faced by both CDN designers their prospective customers: whether co-location approach to platforms adopted Akamai, which tries deploy servers in numerous Internet locations, brings inherent benefits over more consolidated data center pursued other influential...

10.1145/1963405.1963472 article EN 2011-03-28

This paper investigates two key performance aspects of the interplay between public DNS resolution services and content delivery networks -- latency queries for resolving CDN-accelerated hostnames end-user CDN's edge server obtained by user through a given service. While these important issues have been considered in past, significant developments, such as IPv6 finally getting traction, adoption ECS extension to major services, embracing anycast some CDNs warrant reassessment under new...

10.48550/arxiv.2502.05763 preprint EN arXiv (Cornell University) 2025-02-08
Coming Soon ...