אירועים והרצאות בפקולטה למדעי המחשב ע"ש הנרי ומרילין טאוב

Sketches are commonly used in computer systems and network monitoring tools to provide efficient query executions while maintaining a compact data representation. 
Switches and routers maintain sketches to track statistical characteristics of the network traffic. 
The availability of such data is essential for the network analysis as a whole. 
Consequently, being able to recover sketches is critical following a switch crash. 
In this work, we explore how nodes in a network environment can cooperate to recover sketch data whenever any subset of them crashes. 
We consider various approaches to ensure data reliability and explore the trade-offs between space consumption, runtime overheads, and traffic during recovery. 
A key aspect we examine is how nodes update each other about their sketch content as it evolves over time. 
In particular, we focus on periodic incremental updates using buffering and batching techniques. 
We also examine several data structures to economically represent and encode a batch of latest changes.