@article {19458,
	title = {Refactoring Network Infrastructure to Improve Manageability: A Case Study of Home Networking},
	journal = {SIGCOMM Comput. Commun. Rev.},
	volume = {42},
	year = {2012},
	month = {2012/06//},
	pages = {54 - 61},
	abstract = {Managing a home network is challenging because the underlying infrastructure is so complex. Existing interfaces either hide or expose the network{\textquoteright}s underlying complexity, but in both cases, the information that is shown does not necessarily allow a user to complete desired tasks. Recent advances in software defined networking, however, permit a redesign of the underlying network and protocols, potentially allowing designers to move complexity further from the user and, in some cases, eliminating it entirely. In this paper, we explore whether the choices of what to make visible to the user in the design of today{\textquoteright}s home network infrastructure, performance, and policies make sense. We also examine whether new capabilities for refactoring the network infrastructure - changing the underlying system without compromising existing functionality - should cause us to revisit some of these choices. Our work represents a case study of how co-designing an interface and its underlying infrastructure could ultimately improve interfaces for that infrastructure.},
	keywords = {home networking, management, Monitoring, software defined networking},
	isbn = {0146-4833},
	url = {http://doi.acm.org/10.1145/2317307.2317318},
	author = {Marshini Chetty and Feamster, Nick}
}
@conference {19260,
	title = {Design methods for Wireless Sensor Network Building Energy Monitoring Systems},
	booktitle = {2011 IEEE 36th Conference on Local Computer Networks (LCN)},
	year = {2011},
	month = {2011},
	pages = {974 - 981},
	abstract = {In this paper, we present a new energy analysis method for evaluating energy consumption of embedded sensor nodes at the application level and the network level. Then we apply the proposed energy analysis method to develop new energy management schemes in order to maximize lifetime for Wireless Sensor Network Building Energy Monitoring Systems (WSNBEMS). At the application level, we develop a new design approach that uses dataflow techniques to model the application-level interfacing behavior between the processor and sensors on an embedded sensor node. At the network level, we analyze the energy consumption of the IEEE 802.15.4 MAC functionality. Based on our techniques for modeling and energy analysis, we have implemented an optimized WSNBEMS for a real building, and validated our energy analysis techniques through measurements on this implementation. The performance of our implementation is also evaluated in terms of monitoring accuracy and energy consumption savings. We have demonstrated that by applying the proposed scheme, system lifetime can be improved significantly without affecting monitoring accuracy.},
	keywords = {Analytical models, application-level interfacing behavior, building energy monitoring system, Buildings, dataflow technique, embedded sensor node, energy analysis method, Energy consumption, energy management systems, Energy resolution, IEEE 802.15.4 MAC functionality, Monitoring, OPTIMIZATION, wireless sensor network, Wireless sensor networks, WSNBEMS, Zigbee},
	author = {Cho, Inkeun and Chung-Ching Shen and Potbhare, S. and Bhattacharyya, Shuvra S. and Goldsman,N.}
}
@conference {13391,
	title = {On Computing Compression Trees for Data Collection in Wireless Sensor Networks},
	booktitle = {2010 Proceedings IEEE INFOCOM},
	year = {2010},
	month = {2010/03/14/19},
	pages = {1 - 9},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {We address the problem of efficiently gathering correlated data from a wireless sensor network, with the aim of designing algorithms with provable optimality guarantees, and understanding how close we can get to the known theoretical lower bounds. Our proposed approach is based on finding an optimal or a near-optimal compression tree for a given sensor network: a compression tree is a directed tree over the sensor network nodes such that the value of a node is compressed using the value of its parent. We focus on broadcast communication model in this paper, but our results are more generally applicable to a unicast communication model as well. We draw connections between the data collection problem and a previously studied graph concept called weakly connected dominating sets, and we use this to develop novel approximation algorithms for the problem. We present comparative results on several synthetic and real-world datasets showing that our algorithms construct near-optimal compression trees that yield a significant reduction in the data collection cost.},
	keywords = {Approximation algorithms, Base stations, Communications Society, Computer networks, Computer science, computing compression trees, Costs, data collection, Data communication, data compression, designing algorithms, Educational institutions, Entropy, graph concept, Monitoring, Protocols, trees (mathematics), weakly connected dominating sets, Wireless sensor networks},
	isbn = {978-1-4244-5836-3},
	doi = {10.1109/INFCOM.2010.5462035},
	author = {Li,Jian and Deshpande, Amol and Khuller, Samir}
}
@conference {16503,
	title = {Web Monitoring 2.0: Crossing Streams to Satisfy Complex Data Needs},
	booktitle = {IEEE 25th International Conference on Data Engineering, 2009. ICDE {\textquoteright}09},
	year = {2009},
	month = {2009/04/29/March},
	pages = {1215 - 1218},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Web monitoring 2.0 supports the complex information needs of clients who probe multiple information sources and generate mashups by integrating across these volatile streams. A proxy that aims at satisfying multiple customized client profiles will face a scalability challenge in trying to maximize the number of clients served while at the same time fully satisfying complex client needs. In this paper, we introduce an abstraction of complex execution intervals, a combination of time intervals and information streams, to capture complex client needs. Given some budgetary constraints (e.g., bandwidth), we present offline algorithmic solutions for the problem of maximizing completeness of capturing complex profiles.},
	keywords = {Bandwidth, complex client information need, Data Delivery, Data engineering, database management systems, Educational institutions, Internet, Mashups, mashups generation, Monitoring, multiple information source, offline algorithmic solution, Portals, PROBES, Profiles, Query processing, scalability, scheduling, volatile information stream, Web 2.0, Web Monitoring},
	isbn = {978-1-4244-3422-0},
	doi = {10.1109/ICDE.2009.204},
	author = {Roitman,H. and Gal,A. and Raschid, Louiqa}
}
@conference {13393,
	title = {Online Filtering, Smoothing and Probabilistic Modeling of Streaming data},
	booktitle = {IEEE 24th International Conference on Data Engineering, 2008. ICDE 2008},
	year = {2008},
	month = {2008/04/07/12},
	pages = {1160 - 1169},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {In this paper, we address the problem of extending a relational database system to facilitate efficient real-time application of dynamic probabilistic models to streaming data. We use the recently proposed abstraction of model-based views for this purpose, by allowing users to declaratively specify the model to be applied, and by presenting the output of the models to the user as a probabilistic database view. We support declarative querying over such views using an extended version of SQL that allows for querying probabilistic data. Underneath we use particle filters, a class of sequential Monte Carlo algorithms, to represent the present and historical states of the model as sets of weighted samples (particles) that are kept up-to-date as new data arrives. We develop novel techniques to convert the queries on the model-based view directly into queries over particle tables, enabling highly efficient query processing. Finally, we present experimental evaluation of our prototype implementation over several synthetic and real datasets, that demonstrates the feasibility of online modeling of streaming data using our system and establishes the advantages of tight integration between dynamic probabilistic models and databases.},
	keywords = {Data analysis, data streaming, declarative query, dynamic probabilistic model, Filtering, Global Positioning System, hidden Markov models, Monitoring, Monte Carlo methods, Noise generators, Noise measurement, online filtering, particle filter, particle filtering (numerical methods), probabilistic database view, probability, Real time systems, real-time application, relational database system, Relational databases, sequential Monte Carlo algorithm, Smoothing methods, SQL},
	isbn = {978-1-4244-1836-7},
	doi = {10.1109/ICDE.2008.4497525},
	author = {Kanagal,B. and Deshpande, Amol}
}
@conference {17575,
	title = {Clustering and server selection using passive monitoring},
	booktitle = {IEEE INFOCOM 2002. Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings},
	volume = {3},
	year = {2002},
	month = {2002///},
	pages = {1717- 1725 vol.3 - 1717- 1725 vol.3},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {We consider the problem of client assignment in a distributed system of content servers. We present a system called Webmapper for clustering IP addresses and assigning each cluster to an optimal content server. The system is passive in that the only information it uses comes from monitoring the TCP connections between the clients and the servers. It is also flexible in that it makes no a priori assumptions about network topology and server placement and it can react quickly to changing network conditions. We present experimental results to evaluate the performance of Webmapper.},
	keywords = {client assignment, client-server systems, clustering, content servers, Delay, distributed system, Educational institutions, Internet, IP addresses, Monitoring, network conditions, Network servers, Network topology, optimal content server, passive monitoring, server selection, Space technology, TCPIP, Transport protocols, Web pages, Web server, Webmapper},
	isbn = {0-7803-7476-2},
	doi = {10.1109/INFCOM.2002.1019425},
	author = {Andrews,M. and Shepherd,B. and Srinivasan, Aravind and Winkler,P. and Zane,F.}
}
@article {14770,
	title = {Critical path profiling of message passing and shared-memory programs},
	journal = {IEEE Transactions on Parallel and Distributed Systems},
	volume = {9},
	year = {1998},
	month = {1998/10//},
	pages = {1029 - 1040},
	abstract = {We introduce a runtime, nontrace-based algorithm to compute the critical path profile of the execution of message passing and shared-memory parallel programs. Our algorithm permits starting or stopping the critical path computation during program execution and reporting intermediate values. We also present an online algorithm to compute a variant of critical path, called critical path zeroing, that measures the reduction in application execution time that improving a selected procedure will have. Finally, we present a brief case study to quantify the runtime overhead of our algorithm and to show that online critical path profiling can be used to find program bottlenecks},
	keywords = {Computer Society, Concurrent computing, critical path computation, critical path profile, critical path zeroing, distributed processing, distributed shared memory systems, Instruments, Message passing, Monitoring, online algorithm, online critical path profiling, Parallel algorithms, program bottlenecks, Runtime, runtime nontrace-based algorithm, runtime overhead, shared-memory programs, system monitoring, Time measurement, Yarn},
	isbn = {1045-9219},
	doi = {10.1109/71.730530},
	author = {Hollingsworth, Jeffrey K}
}
@article {14804,
	title = {Modeling and evaluating design alternatives for an on-line instrumentation system: a case study},
	journal = {IEEE Transactions on Software Engineering},
	volume = {24},
	year = {1998},
	month = {1998/06//},
	pages = {451 - 470},
	abstract = {This paper demonstrates the use of a model-based evaluation approach for instrumentation systems (ISs). The overall objective of this study is to provide early feedback to tool developers regarding IS overhead and performance; such feedback helps developers make appropriate design decisions about alternative system configurations and task scheduling policies. We consider three types of system architectures: network of workstations (NOW), symmetric multiprocessors (SMP), and massively parallel processing (MPP) systems. We develop a Resource OCCupancy (ROCC) model for an on-line IS for an existing tool and parameterize it for an IBM SP-2 platform. This model is simulated to answer several {\textquotedblleft}what if{\textquotedblright} questions regarding two policies to schedule instrumentation data forwarding: collect-and-forward (CF) and batch-and-forward (BF). In addition, this study investigates two alternatives for forwarding the instrumentation data: direct and binary tree forwarding for an MPP system. Simulation results indicate that the BF policy can significantly reduce the overhead and that the tree forwarding configuration exhibits desirable scalability characteristics for MPP systems. Initial measurement-based testing results indicate more than 60 percent reduction in the direct IS overhead when the BF policy was added to Paradyn parallel performance measurement tool},
	keywords = {alternative system configurations, Application software, batch-and-forward, collect-and-forward, Computer aided software engineering, design alternatives, design decisions, Feedback, IBM SP-2 platform, Instruments, massively parallel processing, model-based evaluation approach, Monitoring, multiprocessing programs, on-line instrumentation system, Paradyn parallel performance measurement tool, PARALLEL PROCESSING, Real time systems, scalability characteristics, software metrics, software tools, Space technology, symmetric multiprocessors, system architectures, system monitoring, System testing, task scheduling policies, tool developers, tree forwarding configuration, Workstations},
	isbn = {0098-5589},
	doi = {10.1109/32.689402},
	author = {Waheed, A. and Rover, D. T and Hollingsworth, Jeffrey K}
}
@conference {14787,
	title = {Modeling, Evaluation, and Testing of Paradyn Instrumentation System},
	booktitle = {Proceedings of the 1996 ACM/IEEE Conference on Supercomputing, 1996},
	year = {1996},
	month = {1996///},
	pages = {18 - 18},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {This paper presents a case study of modeling, evaluating, and testing the data collection services (called an instrumentation system) of the Paradyn parallel performance measurement tool using well-known performance evaluation and experiment design techniques. The overall objective of the study is to use modeling- and simulation-based evaluation to provide feedback to the tool developers to help them choose system configurations and task scheduling policies that can significantly reduce the data collection overheads. We develop and parameterize a resource occupancy model for the Paradyn instrumentation system (IS) for an IBM SP-2 platform. This model is parameterized with a measurement-based workload characterization and subsequently used to answer several "what if" questions regarding configuration options and two policies to schedule instrumentation system tasks: collect-and-forward (CF) and batch-and-forward (BF) policies. Simulation results indicate that the BF policy can significantly reduce the overheads. Based on this feedback, the BF policy was implemented in the Paradyn IS as an option to manage the data collection. Measurement-based testing results obtained from this enhanced version of the Paradyn IS are reported in this paper and indicate more than 60\% reduction in the direct IS overheads when the BF policy is used.},
	keywords = {Distributed control, Feedback, High performance computing, Instruments, Monitoring, Real time systems, Software measurement, Software systems, Software testing, System testing},
	isbn = {0-89791-854-1},
	doi = {10.1109/SUPERC.1996.183524},
	author = {Waheed, A. and Rover, D. T and Hollingsworth, Jeffrey K}
}
