Matthew Caesar

Matthew Caesar

Auto-generated profile, based on publicly available information

Matthew Caesar

University of Illinois Urbana-Champaign

Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 April 2018
Verified
Conference Paper
Closed access
RTRashid Tahir
Rashid Tahir
ARAli Raza
Ali Raza
FAFaizan Ahmad
Faizan Ahmad
JKJehangir Kazi
Jehangir Kazi
FZFareed Zaffar
Fareed Zaffar
MCMatthew Caesar
Matthew Caesar
Typosquatting is a blackhat practice that relies on human error and low-cost domain registrations to hijack legitimate traffic from well-established websites. The technique is typically used for phishing, driving traffic towards competitors or disseminating indecent or malicious content and as such remains a concern for businesses. We take a fresh new look at this well-studied phenomenon to explore why some URLs are more vulnerable to typing mistakes than others. We explore the relationship between human hand anatomy, keyboard layouts and typing mistakes using various URL datasets. We create an extensive user-centric typographical model and compute a Hardness Quotient (likelihood of mistyping) for each URL using a quantitative measure for finger and hand effort. Furthermore, our model predicts the most likely typos for each URL which can then be defensively registered. Cross-validation against actual URL and DNS datasets suggests that this is a meaningful and effective defense mechanism.

8 June 2023 in IEEE Internet of Things Journal
Verified
Journal Article
Open access
OPOtto B. Piramuthu
Otto B. Piramuthu
MCMatthew Caesar
Matthew Caesar
Ad hoc computing needs at remote locations or locations with insufficient resources due to reasons such as natural disasters require flexible solutions that are readily deployed on demand. We consider one such scenario where unmanned aerial vehicles (UAVs) or drones can be used to provide necessary coverage in terms of computational support. Specifically, we consider an environment where ground-based computational demand is satisfied by aerial drones that share the computational load to provide seamless service. We study transfer and location policies where transfer policy determines whether a job is locally processed by the drone that receives the order and location policy determines where a job is processed if it is sent to another drone. Our results indicate that the mean queue length of jobs waiting to be processed at the drones decreases with sharing the job processing load among the drones in the modeled system. Our results also highlight the beneficial aspects of the two step transfer and location policies.

1 October 2009
Verified
Conference Paper
Closed access
SAShameem Ahmed
Shameem Ahmed
TPThadpong Pongthawornkamol
Thadpong Pongthawornkamol
Klara NahrstedtKlara Nahrstedt
Klara Nahrstedt
MCMatthew Caesar
Matthew Caesar
Guijun WangGuijun Wang
Guijun Wang
A mission critical environment (MCE) consists of error-prone, highly variable, and highly rate limited communication channels. Paradoxically, this substantially increases the need to perform optimal task allocation (OTA), while at the same time making it much harder to perform OTA efficiently. To simplify the problem, we consider OTA for publish/subscribe-based MCE since it has unique characteristics such as high level publish/subscribe node and task differentiation and high scalability. In this work, we formulate the OTA problem for publish/subscribe-based MCEs, propose an architectural framework and distributed communication protocols emphasizing the unique challenges of MCE. We adopt well-known Hungarian method and rectangular assignment algorithm to solve OTA problem in publish/subscribe-based MCE in polynomial time. Through simulations, we evaluate the performance of our proposed system for multiple publish/subscribe scenarios. Our results indicate that our proposed solutions achieve the goal of OTA in highly dynamic environments, with low processing time and communication overhead.

3 April 2017
Verified
Conference Paper
Open access
PDF file
WZWenxuan Zhou
Wenxuan Zhou
JCJason Croft
Jason Croft
BLBingzhe Liu
Bingzhe Liu
MCMatthew Caesar
Matthew Caesar
Configuring and maintaining an enterprise network is a challenging and error-prone process. Administrators must often consider security policies from a variety of sources simultaneously, including regulatory requirements, industry standards, and to mitigate attack vectors. Erroneous implementation of a policy, however, can result in costly data breaches and intrusions. Relying on humans to discover and troubleshoot violations is slow and prone to error, considering the speed at which new attack vectors propagate and the increasing network dynamics, partly an effect of SDN. To ensure the network is always in a state consistent with the desired policies, administrators need frameworks to automatically diagnose and repair violations in real-time. To address this problem, we present NEAt, a system analogous to a smartphone's autocorrect feature that enables on-the-fly repair to policy-violating updates. NEAt modifies the forwarding behavior of updates to automatically repair violations of properties such as reachability, service chaining, and segmentation. NEAt sits between an SDN controller and the forwarding devices, and intercepts updates proposed by SDN applications. If an update violates the policy defined by an administrator, such as reachability or segmentation, NEAt transforms the update into one that complies with the policy. Unlike domain-specific languages or synthesis platforms, NEAt allows enterprise networks to leverage the advanced functionality of SDN applications while simultaneously achieving strong, automated enforcement of general policies.

1 November 2011
Verified
Conference Paper
Open access
AAAhsan Arefin
Ahsan Arefin
AKAhmed Khurshid
Ahmed Khurshid
MCMatthew Caesar
Matthew Caesar
Klara NahrstedtKlara Nahrstedt
Klara Nahrstedt
Understanding and troubleshooting wide area networks (such as military backbone networks and ISP networks) are challenging tasks due to their large, distributed, and highly dynamic nature. Building a system that can record and replay fine-grained behaviors of such networks would simplify this problem by allowing operators to recreate the sequence and precise ordering of events (e.g., packet-level forwarding decisions, route changes, failures) taking place in their networks. However, doing this at large scales seems intractable due to the vast amount of information that would need to be logged. In this paper, we propose a scalable and reliable framework to monitor fine-grained data-plane behavior within a large network. We give a feasible architecture for a distributed logging facility, a tree-based data structure for log compression and show how this logged information helps network operators to detect and debug anomalous behavior of the network. Experimental results obtained through trace-driven simulations and Click software router experiments show that our design is lightweight in terms of processing time, memory requirement and control overhead, yet still achieves over 99% precision in capturing network events.

11 November 2011
Verified
Book Chapter
Closed access
PDF file
AVAbhishek Verma
Abhishek Verma
SVShivaram Venkataraman
Shivaram Venkataraman
MCMatthew Caesar
Matthew Caesar
RCRoy H. Campbell
Roy H. Campbell