@conference {19269,
	title = {Applying graphics processor acceleration in a software defined radio prototyping environment},
	booktitle = {2011 22nd IEEE International Symposium on Rapid System Prototyping (RSP)},
	year = {2011},
	month = {2011},
	pages = {67 - 73},
	abstract = {With higher bandwidth requirements and more complex protocols, software defined radio (SDR) has ever growing computational demands. SDR applications have different levels of parallelism that can be exploited on multicore platforms, but design and programming difficulties have inhibited the adoption of specialized multicore platforms like graphics processors (GPUs). In this work we propose a new design flow that augments a popular existing SDR development environment (GNU Radio), with a dataflow foundation and a stand-alone GPU accelerated library. The approach gives an SDR developer the ability to prototype a GPU accelerated application and explore its design space fast and effectively. We demonstrate this design flow on a standard SDR benchmark and show that deciding how to utilize a GPU can be non-trivial for even relatively simple applications.},
	keywords = {Acceleration, coprocessors, dataflow foundation, GNU radio, Graphics processing unit, graphics processor acceleration, Kernel, Libraries, multicore platforms, Multicore processing, PARALLEL PROCESSING, Pipelines, Protocols, software defined radio prototyping environment, software radio, stand-alone GPU accelerated library},
	author = {Plishker,W. and Zaki, G.F. and Bhattacharyya, Shuvra S. and Clancy, C. and Kuykendall, J.}
}
@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 {15856,
	title = {Replication and automation of expert judgments: Information engineering in legal e-discovery},
	booktitle = {IEEE International Conference on Systems, Man and Cybernetics, 2009. SMC 2009},
	year = {2009},
	month = {2009/10/11/14},
	pages = {102 - 107},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {The retrieval of digital evidence responsive to discovery requests in civil litigation, known in the United States as {\~A}{\^A}{\textquestiondown}e-discovery,{\~A}{\^A}{\textquestiondown} presents several important and understudied conditions and challenges. Among the most important of these are (i) that the definition of responsiveness that governs the search effort can be learned and made explicit through effective interaction with the responding party, (ii) that the governing definition of responsiveness is generally complex, deriving both from considerations of subject-matter relevance and from considerations of litigation strategy, and (iii) that the result of the search effort is a set (rather than a ranked list) of documents, and sometimes a quite large set, that is turned over to the requesting party and that the responding party certifies to be an accurate and complete response to the request. This paper describes the design of an {\~A}{\^A}{\textquestiondown}interactive task{\~A}{\^A}{\textquestiondown} for the text retrieval conference{\textquoteright}s legal track that had the evaluation of the effectiveness of e-discovery applications at the {\~A}{\^A}{\textquestiondown}responsive review{\~A}{\^A}{\textquestiondown} task as its goal. Notable features of the 2008 interactive task were high-fidelity human-system task modeling, authority control for the definition of {\~A}{\^A}{\textquestiondown}responsiveness,{\~A}{\^A}{\textquestiondown} and relatively deep sampling for estimation of type 1 and type 2 errors (expressed as {\~A}{\^A}{\textquestiondown}precision{\~A}{\^A}{\textquestiondown} and {\~A}{\^A}{\textquestiondown}recall{\~A}{\^A}{\textquestiondown}). The paper presents a critical assessment of the strengths and weaknesses of the evaluation design from the perspectives of reliability, reusability, and cost-benefit tradeoffs.},
	keywords = {authorisation, authority control, Automation, civil litigation, CYBERNETICS, Delay, digital evidence retrieval, discovery request, Educational institutions, expert judgment automation, Human computer interaction, Human-machine cooperation and systems, human-system task modeling, information engineering, Information retrieval, interactive task, Law, law administration, legal e-discovery, Legal factors, PROBES, Production, Protocols, search effort, Search methods, text analysis, text retrieval conference legal track, United States, USA Councils, User modeling},
	isbn = {978-1-4244-2793-2},
	doi = {10.1109/ICSMC.2009.5346118},
	author = {Hedin,B. and Oard, Douglas}
}
@conference {17559,
	title = {Approximation Algorithms for Computing Capacity of Wireless Networks with SINR Constraints},
	booktitle = {IEEE INFOCOM 2008. The 27th Conference on Computer Communications},
	year = {2008},
	month = {2008/04/13/18},
	pages = {1166 - 1174},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {A fundamental problem in wireless networks is to estimate its throughput capacity - given a set of wireless nodes, and a set of connections, what is the maximum rate at which data can be sent on these connections. Most of the research in this direction has focused on either random distributions of points, or has assumed simple graph-based models for wireless interference. In this paper, we study capacity estimation problem using the more general Signal to Interference Plus Noise Ratio (SINR) model for interference, on arbitrary wireless networks. The problem becomes much harder in this setting, because of the non-locality of the SINR model. Recent work by Moscibroda et al. (2006) has shown that the throughput in this model can differ from graph based models significantly. We develop polynomial time algorithms to provably approximate the total throughput in this setting.},
	keywords = {Algorithm design and analysis, approximation algorithm, Approximation algorithms, approximation theory, Computer networks, Computer science, graph theory, graph-based model, Interference constraints, polynomial time algorithm, Propagation losses, Protocols, radio networks, radiofrequency interference, signal to interference plus noise ratio, Signal to noise ratio, Throughput, wireless interference, wireless network, Wireless networks},
	isbn = {978-1-4244-2025-4},
	doi = {10.1109/INFOCOM.2008.172},
	author = {Chafekar,D. and Kumart,V. S.A and Marathe,M. V and Parthasarathy,S. and Srinivasan, Aravind}
}
@article {17591,
	title = {Efficient lookup on unstructured topologies},
	journal = {IEEE Journal on Selected Areas in Communications},
	volume = {25},
	year = {2007},
	month = {2007/01//},
	pages = {62 - 72},
	abstract = {We present LMS, a protocol for efficient lookup on unstructured networks. Our protocol uses a virtual namespace without imposing specific topologies. It is more efficient than existing lookup protocols for unstructured networks, and thus is an attractive alternative for applications in which the topology cannot be structured as a Distributed Hash Table (DHT). We present analytic bounds for the worst-case performance of LMS. Through detailed simulations (with up to 100,000 nodes), we show that the actual performance on realistic topologies is significantly better. We also show in both simulations and a complete implementation (which includes over five hundred nodes) that our protocol is inherently robust against multiple node failures and can adapt its replication strategy to optimize searches according to a specific heuristic. Moreover, the simulation demonstrates the resilience of LMS to high node turnover rates, and that it can easily adapt to orders of magnitude changes in network size. The overhead incurred by LMS is small, and its performance approaches that of DHTs on networks of similar size},
	keywords = {Computer science, DHT, distributed algorithms, Distributed computing, distributed hash table, Least squares approximation, LMS, local minima search, lookup protocol, Network topology, node failures, Peer to peer computing, Performance analysis, Protocols, replication strategy, Resilience, Robustness, table lookup, telecommunication network topology, unstructured network topology},
	isbn = {0733-8716},
	doi = {10.1109/JSAC.2007.07007},
	author = {Morselli,R. and Bhattacharjee, Bobby and Marsh,M.A. and Srinivasan, Aravind}
}
@conference {18664,
	title = {Assessing the Attack Threat due to IRC Channels},
	year = {2006},
	month = {2006/06//},
	pages = {467 - 472},
	abstract = {This practical experience report presents the results of an investigation into the threat of attacks associated with the chat medium IRC. A combination of simulated users (i.e., bots), some configured with scripts that simulated conversations, and regular users were used. The average number of attacks per day a user on IRC can expect, the effect of channel activity, gender based on the name, and network type on the number of attacks were determined. The social structure of IRC channels and the types of users that use it were analyzed. The results indicate that attacks through IRC channels come from human users selecting targets rather than automated scripts targeting every user in a channel},
	keywords = {attack threat assessment, channel activity, client-server systems, computer crime, intrusion-resilient channels, IRC channels, IRC protocols, Protocols, telecommunication channels, telecommunication security},
	doi = {10.1109/DSN.2006.12},
	author = {Meyer,R. and Michel Cukier}
}
@article {17650,
	title = {Resilient multicast using overlays},
	journal = {IEEE/ACM Transactions on Networking},
	volume = {14},
	year = {2006},
	month = {2006/04//},
	pages = {237 - 248},
	abstract = {We introduce Probabilistic Resilient Multicast (PRM): a multicast data recovery scheme that improves data delivery ratios while maintaining low end-to-end latencies. PRM has both a proactive and a reactive components; in this paper we describe how PRM can be used to improve the performance of application-layer multicast protocols especially when there are high packet losses and host failures. Through detailed analysis in this paper, we show that this loss recovery technique has efficient scaling properties-the overheads at each overlay node asymptotically decrease to zero with increasing group sizes. As a detailed case study, we show how PRM can be applied to the NICE application-layer multicast protocol. We present detailed simulations of the PRM-enhanced NICE protocol for 10 000 node Internet-like topologies. Simulations show that PRM achieves a high delivery ratio (>97\%) with a low latency bound (600 ms) for environments with high end-to-end network losses (1\%-5\%) and high topology change rates (5 changes per second) while incurring very low overheads (<5\%).},
	keywords = {application-layer multicast protocols, Computer science, Data communication, Delay, Internet, Internet-like topologies, IP networks, loss recovery technique, Multicast, multicast data recovery scheme, Multicast protocols, Network topology, NETWORKS, overlays, Performance loss, probabilistic forwarding, probabilistic resilient multicast, Protocols, Resilience, Streaming media, telecommunication network topology, Terminology},
	isbn = {1063-6692},
	doi = {10.1109/TNET.2006.872579},
	author = {Banerjee,S. and Lee,Seungjoon and Bhattacharjee, Bobby and Srinivasan, Aravind}
}
@conference {19032,
	title = {Detection of denial-of-message attacks on sensor network broadcasts},
	year = {2005},
	month = {2005},
	pages = {64 - 78},
	abstract = {So far sensor network broadcast protocols assume a trustworthy environment. However in safety and mission-critical sensor networks this assumption may not be valid and some sensor nodes might be adversarial. In these environments, malicious sensor nodes can deprive other nodes from receiving a broadcast message. We call this attack a denial-of-message attack (DoM). In this paper we model and analyze this attack, and present countermeasures. We present SIS, a secure implicit sampling scheme that permits a broadcasting base station to probabilistically detect the failure of nodes to receive its broadcast, even if these failures result from an attacker motivated to induce these failures undetectably. SIS works by eliciting authenticated acknowledgments from a subset of nodes per broadcast, where the subset is unpredictable to the attacker and tunable so as to mitigate acknowledgment implosion on the base station. We use a game-theoretic approach to evaluate this scheme in the face of an optimal attacker that attempts to maximize the number of nodes it denies the broadcast while remaining undetected by the base station, and show that SIS significantly constrains such an attacker even in sensor networks exhibiting high intrinsic loss rates. We also discuss extensions that permit more targeted detection capabilities.},
	keywords = {authenticated acknowledgments, broadcast channels, broadcast protocols, broadcasting base station, countermeasures, denial-of-message attacks, DoM, game theory, game-theoretic approach, malicious sensor nodes, Mobile computing, optimal attacker, probabilistic detection, probability, Protocols, Sampling methods, secure implicit sampling, sensor network broadcasts, SIS, telecommunication security, Wireless sensor networks},
	author = {McCune, J.M. and Elaine Shi and Perrig, A. and Reiter, M.K.}
}
@article {15679,
	title = {End-to-end analysis of distributed video-on-demand systems},
	journal = {IEEE Transactions on Multimedia},
	volume = {6},
	year = {2004},
	month = {2004/02//},
	pages = {129 - 141},
	abstract = {The focus of the research presented in this paper is the end-to-end analysis of a distributed Video-on-Demand (VoD) system. We analyze the distributed architecture of a VoD system to design global request handling and admission control strategies and evaluate them using global metrics. The performance evaluation methodology developed in this paper helps in determining efficient ways of using all resources in the VoD architecture within the constraints of providing guaranteed high quality service to each request. For instance, our simulation results show that request handling policies based on limited redirection of blocked requests to other resources perform better than load sharing policies. We also show that request handling policies based on redirection have simpler connection establishment semantics than load sharing policies and, therefore, are easily incorporated into reservation or signaling protocols.},
	keywords = {Admission control, admission control strategies, Analytical models, Computer science, distributed architecture, distributed video-on-demand systems, end-to-end analysis, global request handling, High-speed networks, Network servers, Next generation networking, Performance analysis, performance evaluation methodology, Protocols, request handling, reservation protocols, resource allocation, Resource management, signaling protocols, telecommunication congestion control, video on demand, Video sharing},
	isbn = {1520-9210},
	doi = {10.1109/TMM.2003.819757},
	author = {Mundur, Padma and Simon,R. and Sood,A. K}
}
@article {12088,
	title = {The dangers of mitigating security design flaws: a wireless case study},
	journal = {IEEE Security \& Privacy},
	volume = {1},
	year = {2003},
	month = {2003/02//Jan},
	pages = {28 - 36},
	abstract = {Mitigating design flaws often provides the only means to protect legacy equipment, particularly in wireless local area networks. A synchronous active attack against the wired equivalent privacy protocol demonstrates how mitigating one flaw or attack can facilitate another.},
	keywords = {Communication system security, computer security, cryptography, design flaw mitigation, Dictionaries, legacy equipment, privacy, Protection, Protocols, security design flaws, security of data, synchronous active attack, telecommunication security, Telecommunication traffic, wired equivalent privacy protocol, Wireless LAN, wireless local area networks, Wireless networks},
	isbn = {1540-7993},
	doi = {10.1109/MSECP.2003.1176993},
	author = {Petroni,N. L. and Arbaugh, William A.}
}
@conference {15684,
	title = {Dynamic load balancing across mirrored multimedia servers},
	booktitle = {2003 International Conference on Multimedia and Expo, 2003. ICME {\textquoteright}03. Proceedings},
	volume = {2},
	year = {2003},
	month = {2003/07/06/9},
	pages = {II- 53-6 vol.2 - II- 53-6 vol.2},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {The purpose of this paper is to present protocols for efficient load balancing across replicated multimedia servers in a metropolitan area network. Current multimedia infrastructures, even when they use mirrored servers, do not have standardized load balancing schemes. Existing schemes frequently require participation from the clients in balancing the load across the servers efficiently. We propose two protocols in this paper for fair load balancing without any client-side processing being required. Neither protocol requires any change to the network-level infrastructure. Using network packet loss and packet transmission delay as the chief metrics, we show the effectiveness of the protocols through extensive simulations.},
	keywords = {client-server systems, Delay, Internet, load balancing protocols, Load management, media streaming, metropolitan area network, metropolitan area networks, mirrored multimedia servers, Multimedia communication, multimedia servers, network packet loss, Network servers, packet transmission delay, Propagation losses, Protocols, Streaming media, Topology, Traffic control, Web server},
	isbn = {0-7803-7965-9},
	doi = {10.1109/ICME.2003.1221551},
	author = {Matthur,A. and Mundur, Padma}
}
@conference {12078,
	title = {A secure service discovery protocol for MANET},
	booktitle = {14th IEEE Proceedings on Personal, Indoor and Mobile Radio Communications, 2003. PIMRC 2003},
	volume = {1},
	year = {2003},
	month = {2003/09/07/10},
	pages = {502- 506 Vol.1 - 502- 506 Vol.1},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Service discovery technologies are exploited to enable services to advertise their existence in a dynamic way, and can be discovered, configured and used by other devices with minimum manual efforts. It plays an essential role in future network scenarios especially with development of mobile ad hoc network (MANET) and emergence of pervasive computing. Because MANET allows these devices to communicate dynamically without fixed infrastructure and centralized administration, it gives rise to the challenges of the service discovery techniques. In this paper, we present a dynamic service discovery infrastructure that uses XML to describe services and match using the semantic content of service descriptions for MANET. We believe that the architecture we have designed is a necessary component of service discovery in non-infrastructure network by further exploring the secure and performance issues of this infrastructure.},
	keywords = {ad hoc networks, centralized administration, Computer architecture, Computer science, dynamic service discovery infrastructure, Educational institutions, MANET, Manuals, mobile ad hoc network, Mobile ad hoc networks, Mobile computing, mobile radio, noninfrastructure network, Pervasive computing, Protocols, routing protocols, secure service discovery protocol, Security, service discovery techniques, service discovery technologies, telecommunication computing, telecommunication services, XML},
	isbn = {0-7803-7822-9},
	doi = {10.1109/PIMRC.2003.1264322},
	author = {Yuan Yuan and Arbaugh, William A.}
}
@conference {18651,
	title = {An adaptive framework for tunable consistency and timeliness using replication},
	year = {2002},
	month = {2002///},
	pages = {17 - 26},
	abstract = {One well-known challenge in using replication to service multiple clients concurrently is that of delivering a timely and consistent response to the clients. In this paper, we address this problem in the context of client applications that have specific temporal and consistency requirements. These applications can tolerate a certain degree of relaxed consistency, in exchange for better response time. We propose a flexible QoS model that allows these clients to specify their temporal and consistency constraints. In order to select replicas to serve these clients, we need to control of the inconsistency of the replicas, so that we have a large enough pool of replicas with the appropriate state to meet a client{\textquoteright}s timeliness, consistency, and dependability requirements. We describe an adaptive framework that uses lazy update propagation to control the replica inconsistency and employs a probabilistic approach to select replicas dynamically to service a client, based on its QoS specification. The probabilistic approach predicts the ability of a replica to meet a client{\textquoteright}s QoS specification by using the performance history collected by monitoring the replicas at runtime. We conclude with experimental results based on our implementation.},
	keywords = {adaptive framework, concurrent multiple client service, consistency requirements, dependability requirements, distributed object management, flexible QoS model, lazy update propagation, performance history, probabilistic approach, Protocols, quality of service, replication, temporal requirements, timely consistent response, tunable consistency, tunable timeliness},
	doi = {10.1109/DSN.2002.1028882},
	author = {Krishnamurthy, S. and Sanders,W. H. and Michel Cukier}
}
@conference {18676,
	title = {Formal specification and verification of a group membership protocol for an intrusion-tolerant group communication system},
	year = {2002},
	month = {2002/12//},
	pages = {9 - 18},
	abstract = {We describe a group membership protocol that is part of an intrusion-tolerant group communication system, and present an effort to use formal tools to model and validate our protocol. We describe in detail the most difficult part of the validation exercise, which was the determination of the right level of abstraction of the protocol for formally specifying the protocol. The validation exercise not only formally showed that the protocol satisfies its correctness claims, but also provided information that will help us make the protocol more efficient without violating correctness.},
	keywords = {computer network reliability, distributed processing, distributed systems, fault tolerant computing, formal specification, formal verification, group membership protocol, intrusion-tolerant group communication system, PROMELA, Protocols},
	doi = {10.1109/PRDC.2002.1185613},
	author = {Ramasamy,H. V. and Michel Cukier and Sanders,W. H.}
}
@conference {17642,
	title = {P5 : a protocol for scalable anonymous communication},
	booktitle = {2002 IEEE Symposium on Security and Privacy, 2002. Proceedings},
	year = {2002},
	month = {2002///},
	pages = {58 - 70},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {We present a protocol for anonymous communication over the Internet. Our protocol, called P5 (peer-to-peer personal privacy protocol) provides sender-, receiver-, and sender-receiver anonymity. P5 is designed to be implemented over current Internet protocols, and does not require any special infrastructure support. A novel feature of P5 is that it allows individual participants to trade-off degree of anonymity for communication efficiency, and hence can be used to scalably implement large anonymous groups. We present a description of P5, an analysis of its anonymity and communication efficiency, and evaluate its performance using detailed packet-level simulations.},
	keywords = {Broadcasting, communication efficiency, Computer science, cryptography, data privacy, Educational institutions, Internet, large anonymous groups, P5 protocol, packet-level simulations, Particle measurements, Peer to peer computing, peer-to-peer personal privacy protocol, privacy, Protocols, receiver anonymity, scalable anonymous communication, security of data, sender anonymity, sender-receiver anonymity, Size measurement, telecommunication security},
	isbn = {0-7695-1543-6},
	doi = {10.1109/SECPRI.2002.1004362},
	author = {Sherwood,R. and Bhattacharjee, Bobby and Srinivasan, Aravind}
}
@conference {18464,
	title = {Smart videoconferencing},
	booktitle = {2000 IEEE International Conference on Multimedia and Expo, 2000. ICME 2000},
	volume = {3},
	year = {2000},
	month = {2000///},
	pages = {1597-1600 vol.3 - 1597-1600 vol.3},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {The combination of acoustical and video processing to achieve a smart audio and video feed from a set of N microphones and M cameras is a task that might conventionally be accomplished by camera persons and control room staff. However, in the context of videoconferencing, this process needs to be performed by control software. We discuss the use of a multi-camera multi-microphone set-up for unattended videoconferencing, and present details of a prototype implementation being developed},
	keywords = {acoustical processing, Automatic control, CAMERAS, computerised control, control software, Control systems, Intelligent sensors, Layout, Microphones, multi-camera multi-microphone set-up, multimedia systems, Protocols, prototype implementation, Prototypes, sensor fusion, smart videoconferencing, Switches, Teleconferencing, unattended videoconferencing, video processing},
	isbn = {0-7803-6536-4},
	doi = {10.1109/ICME.2000.871075},
	author = {Zotkin,Dmitry N and Duraiswami, Ramani and Philomin,V. and Davis, Larry S.}
}
@conference {14762,
	title = {Benchmarking a network of PCs running parallel applications},
	booktitle = {Performance, Computing and Communications, 1998. IPCCC {\textquoteright}98., IEEE International},
	year = {1998},
	month = {1998/02/16/18},
	pages = {1 - 7},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Presents a benchmarking study that compares the performance of a network of four PCs connected by a 100 Mbit/s fast Ethernet running three different system software configurations: TCP/IP on Windows NT, TCP/IP on Linux and a lightweight message-passing protocol (U-Net active messages) on Linux. For each configuration, we report results for communication micro-benchmarks and the NAS (Numerical Aerodynamics Simulation) parallel benchmarks. For the NAS benchmarks, the overall running time using Linux TCP/IP was 12-500\% less than the Windows NT TCP/IP configuration. Likewise, the Linux U-Net based message-passing protocol outperformed the Linux TCP/IP version by 5-200\%+. We also show that, by using Linux U-Net, we are able to achieve 125 μs latency between two processes using PVM. Finally, we report that the default mathematical libraries supplied with NT (for both gcc and Visual C++) are substantially slower than the one supplied with Linux},
	keywords = {100 Mbit/s, 125 mus, Aerodynamics, Application software, communication micro-benchmarks, default mathematical libraries, Delay, Ethernet, Ethernet networks, gcc, latency, lightweight message-passing protocol, Linux, Local area networks, mathematics computing, Message passing, microcomputer applications, Microsoft Windows NT, NAS parallel benchmarks, network operating systems, Numerical simulation, parallel applications, PARALLEL PROCESSING, PC network benchmarking, performance comparison, performance evaluation, Personal communication networks, Protocols, PVM, running time, software libraries, System software, system software configurations, TCP/IP, TCPIP, Transport protocols, U-Net active messages, Visual C++},
	isbn = {0-7803-4468-5},
	doi = {10.1109/PCCC.1998.659876},
	author = {Hollingsworth, Jeffrey K and Guven, E. and Akinlar, C.}
}
@article {12079,
	title = {The SwitchWare active network architecture},
	journal = {IEEE Network},
	volume = {12},
	year = {1998},
	month = {1998/06//May},
	pages = {29 - 36},
	abstract = {Active networks must balance the flexibility of a programmable network infrastructure against the safety and security requirements inherent in sharing that infrastructure. Furthermore, this balance must be achieved while maintaining the usability of the network. The SwitchWare active network architecture is a novel approach to achieving this balance using three layers: active packets, which contain mobile programs that replace traditional packets; active extensions, which provide services on the network elements and can be dynamically loaded; and a secure active router infrastructure, which forms a high-integrity base on which the security of the other layers depends. In addition to integrity checking and cryptography-based authentication, security in our architecture depends heavily on verification techniques from programming languages, such as strong type checking},
	keywords = {active extensions, active packets, Authentication, Computer languages, Computer networks, cryptography, cryptography-based authentication, high-integrity base, integrity checking, IP networks, LAN interconnection, mobile programs, network operating systems, packet switching, programmable network infrastructure, programming languages, Protocols, Safety, safety requirements, scalability, secure active router infrastructure, Security, security requirements, services, strong type checking, Switches, SwitchWare active network architecture, telecommunication network routing, Tin, usability, verification techniques},
	isbn = {0890-8044},
	doi = {10.1109/65.690959},
	author = {Alexander,D. S and Arbaugh, William A. and Hicks, Michael W. and Kakkar,P. and Keromytis,A. D and Moore,J. T and Gunter,C. A and Nettles,S. M and Smith,J. M}
}
@conference {18687,
	title = {Probabilistic verification of a synchronous round-based consensus protocol},
	year = {1997},
	month = {1997/10//},
	pages = {165 - 174},
	abstract = {Consensus protocols are used in a variety of reliable distributed systems, including both safety-critical and business-critical applications. The correctness of a consensus protocol is usually shown, by making assumptions about the environment in which it executes, and then proving properties about the protocol. But proofs about a protocol{\textquoteright}s behavior are only as good as the assumptions which were made to obtain them, and violation of these assumptions can lead to unpredicted and serious consequences. We present a new approach for the probabilistic verification of synchronous round based consensus protocols. In doing so, we make stochastic assumptions about the environment in which a protocol operates, and derive probabilities of proper and non proper behavior. We thus can account for the violation of assumptions made in traditional proof techniques. To obtain the desired probabilities, the approach enumerates possible states that can be reached during an execution of the protocol, and computes the probability of achieving the desired properties for a given fault and network environment. We illustrate the use of this approach via the evaluation of a simple consensus protocol operating under a realistic environment which includes performance, omission, and crash failures},
	keywords = {business-critical applications, consensus protocol correctness, crash failures, formal verification, network environment, probabilistic verification, probabilities, probability, program verification, proper behavior, protocol behavior, Protocols, realistic environment, reliable distributed systems, safety-critical applications, simple consensus protocol, software reliability, stochastic assumptions, synchronous round based consensus protocol, synchronous round based consensus protocols, traditional proof techniques},
	doi = {10.1109/RELDIS.1997.632812},
	author = {Duggal,H.S. and Michel Cukier and Sanders,W. H.}
}
@conference {17660,
	title = {Splitters and near-optimal derandomization},
	booktitle = {, 36th Annual Symposium on Foundations of Computer Science, 1995. Proceedings},
	year = {1995},
	month = {1995/10/23/25},
	pages = {182 - 191},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {We present a fairly general method for finding deterministic constructions obeying what we call k-restrictions; this yields structures of size not much larger than the probabilistic bound. The structures constructed by our method include (n,k)-universal sets (a collection of binary vectors of length n such that for any subset of size k of the indices, all 2k configurations appear) and families of perfect hash functions. The near-optimal constructions of these objects imply the very efficient derandomization of algorithms in learning, of fixed-subgraph finding algorithms, and of near optimal ΣIIΣ threshold formulae. In addition, they derandomize the reduction showing the hardness of approximation of set cover. They also yield deterministic constructions for a local-coloring protocol, and for exhaustive testing of circuits},
	keywords = {Boosting, Circuit testing, computational complexity, computational linguistics, Computer science, Contracts, derandomization, deterministic constructions, Educational institutions, Engineering profession, exhaustive testing, fairly general method, fixed-subgraph finding algorithms, hardness of approximation, Information systems, k-restrictions, learning, local-coloring protocol, MATHEMATICS, near-optimal constructions, near-optimal derandomization, Parallel algorithms, probabilistic bound, probability, Protocols, randomised algorithms, Set cover, splitters},
	isbn = {0-8186-7183-1},
	doi = {10.1109/SFCS.1995.492475},
	author = {Naor,M. and Schulman,L. J and Srinivasan, Aravind}
}
@conference {12836,
	title = {A theory of testing for real-time},
	booktitle = {, Proceedings of Sixth Annual IEEE Symposium on Logic in Computer Science, 1991. LICS {\textquoteright}91},
	year = {1991},
	month = {1991/07/15/18},
	pages = {110 - 119},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {A framework for generating testing preorders that relate processes on the basis of their timing behavior as well as their degree of relative nondeterminism is developed. The basic concepts of transition systems and testing are reviewed, and timed testing, which takes account of the delay exhibited by a process as it attempts to pass a test, is introduced. The framework is then applied to two different scenarios. In the first, relations are constructed that relate processes on the basis of all timing considerations. In the second, relations are constructed that relate processes on the basis of their relative speeds. In both cases, alternative denotational characterizations of the resulting preorders are presented, and examples are given to illustrate the utility of the approach},
	keywords = {Algebra, Character generation, Computer science, Delay, formal logic, Licenses, nondeterminism, Process control, Protocols, Real time systems, real-time, System testing, testing preorders, testing theory, timed testing, Timing, timing behavior, transition systems},
	isbn = {0-8186-2230-X},
	doi = {10.1109/LICS.1991.151635},
	author = {Cleaveland, Rance and Zwarico,A. E}
}
@article {16743,
	title = {Trie hashing with controlled load},
	journal = {IEEE Transactions on Software Engineering},
	volume = {17},
	year = {1991},
	month = {1991/07//},
	pages = {678 - 691},
	abstract = {Trie hashing (TH), a primary key access method for storing and accessing records of dynamic files, is discussed. The key address is computed through a trie. A key search usually requires only one disk access when the trie is in core and two disk accesses for very large files when the trie must be on disk. A refinement to trie hashing, trie hashing with controlled load (THCL), is presented. It is designed to control the load factor of a TH file as tightly as that of a B-tree file, allows high load factor of up to 100\% for ordered insertions, and increases the load factor for random insertions from 70\% to over 85\%. It is shown that these properties make trie hashing preferable to a B-tree},
	keywords = {B-tree file, Computer science, controlled load, Databases, disk access, dynamic files, file organisation, high load factor, information retrieval systems, key search, load factor, Military computing, ordered insertions, Predictive models, primary key access method, Protocols, random insertions, TH file, THCL, Tree data structures, trees (mathematics), trie hashing},
	isbn = {0098-5589},
	doi = {10.1109/32.83904},
	author = {Litwin,W. A and Roussopoulos, Nick and Levy,G. and Hong,W.}
}
@article {17301,
	title = {Multiparty Grammars and Related Features for Defining Interactive Systems},
	journal = {IEEE Transactions on Systems, Man and Cybernetics},
	volume = {12},
	year = {1982},
	month = {1982/03//},
	pages = {148 - 154},
	abstract = {Multiparty grammars are introduced which contain labeled nonterminals to indicate the party that produces the terminal string. For interactive person-computer systems, both the user commands and system responses can be described by the linked BNF grammars. Multiparty grammars may also be used to describe communication among several people (by way of computers or in normal dialogue), network protocols among several machines, or complex interactions involving several people and machines. Visual features such as underlining, reversal, blinking, and color, window declarations, and dynamic operations dependent on cursor movement are also covered.},
	keywords = {Application software, Computer aided instruction, Computer displays, Computer languages, Computer networks, Debugging, HUMANS, interactive systems, Protocols, Writing},
	isbn = {0018-9472},
	doi = {10.1109/TSMC.1982.4308798},
	author = {Shneiderman, Ben}
}
