@conference {12227,
	title = {Channel Access Throttling for Improving WLAN QoS},
	booktitle = {Sensor, Mesh and Ad Hoc Communications and Networks, 2009. SECON {\textquoteright}09. 6th Annual IEEE Communications Society Conference on},
	year = {2009},
	month = {2009/06//},
	pages = {1 - 9},
	abstract = {The de facto QoS channel access method for the IEEE 802.11 Wireless LANs is the Enhanced Distributed Channel Access (EDCA) mechanism, which differentiates transmission treatments for data frames belonging to different traffic categories with four different levels of channel access priority. In this paper, we propose extending EDCA with Channel Access Throttling (CAT) for more flexible and efficient QoS support. By assigning different member stations different channel access parameters, CAT differentiates channel access priorities not between traffic categories but between member stations. Then by dynamically changing the channel access parameters of each member station based on a pre-computed schedule, CAT enables EDCA WLANs the benefits of scheduled access QoS. We also present evaluation results of CAT obtained from both simulations and experiments conducted using off-the-shelf WLAN hardware and open-source device driver. Our results show that CAT can proportionally partition channel capacity, significantly improve performance of multimedia applications, effectively achieve performance protection for admitted flows, and increase per cell VoIP call capacity by up to 41\%.},
	keywords = {802.11, access, area, call, capacity;data, capacity;quality, capacity;WLAN, categories;transmission, channel, device, distributed, driver;quality, facto, frames;de, IEEE, LAN;, LAN;VoIP, local, mechanism;member, method;enhanced, multimedia, network;wireless, networks;channel, of, parameters;channel, priority;channel, QoS, QoS;channel, service;telecommunication, service;traffic, standards;telecommunication, stations;open-source, throttling;channel, traffic;wireless, treatments;wireless, wireless},
	doi = {10.1109/SAHCN.2009.5168915},
	author = {Han,Bo and Ji,Lusheng and Lee,Seungjoon and Miller,R.R. and Bhattacharjee, Bobby}
}
@article {18205,
	title = {Dynamic Resource Allocation for Robust Distributed Multi-Point Video Conferencing},
	journal = {Multimedia, IEEE Transactions on},
	volume = {10},
	year = {2008},
	month = {2008/08//},
	pages = {910 - 925},
	abstract = {This paper proposes a distributed multi-point video conferencing system over packet erasure channels, where the aggregation of multiple video streams and resource allocation are performed in a distributed manner. Video stream combiners, which are located in different geographical areas and serve as portals for conferees, aggregate incoming streams supplied by local users with other streams aggregated from nearby video stream combiners. A packet-division multiple-access (PDMA)-based error protection scheme is proposed to be performed at each video stream combiner to minimize the maximal expected video distortion among aggregated streams. The proposed error protection scheme for multi-stream aggregation also supports user preference. In order to deliver video streams to end users with different preferred quality, a consensus algorithm is proposed to adaptively perform resource allocation based on user preference. Simulation results show that the proposed multi-stream aggregation and error protection scheme has significant gains over traditional multi-stream error protection schemes for a multi-point video conferencing system.},
	keywords = {allocation;error, channels;packet-division, communication;, conferencing, conferencing;multi-access, distributed, dynamic, erasure, error, multiple-access-based, multipoint, Protection, resource, scheme;multi-point, scheme;robust, schemes;packet, streams;multistream, system;multiple, systems;teleconferencing;video, video},
	isbn = {1520-9210},
	doi = {10.1109/TMM.2008.922846},
	author = {Chen,Meng and Su,Guan-Ming and M. Wu}
}
@article {12239,
	title = {Efficient and Resilient Backbones for Multihop Wireless Networks},
	journal = {Mobile Computing, IEEE Transactions on},
	volume = {7},
	year = {2008},
	month = {2008/11//},
	pages = {1349 - 1362},
	abstract = {We consider the problem of finding "backbones" in multihop wireless networks. The backbone provides end-to-end connectivity, allowing nonbackbone nodes to save energy since they do not have to route nonlocal data or participate in the routing protocol. Ideally, such a backbone would be small, consist primarily of high capacity nodes, and remain connected even when nodes are mobile or fail. Unfortunately, it is often infeasible to construct a backbone that has all of these properties; e.g., a small optimal backbone is often too sparse to handle node failures or high mobility. We present a parameterized backbone construction algorithm that permits explicit trade-offs between backbone size, resilience to node movement and failure, energy consumption, and path lengths. We prove that our scheme can construct essentially best possible backbones (with respect to energy consumption and backbone size) when the network is relatively static. We generalize our scheme to build more robust structures better suited to networks with higher mobility. We present a distributed protocol based upon our algorithm and show that this protocol builds and maintains a connected backbone in dynamic networks. Finally, we present detailed packet-level simulation results to evaluate and compare our scheme with existing energy-saving techniques. Our results show that, depending on the network environment, our scheme increases network lifetimes by 20 percent to 220 percent without adversely affecting delivery ratio or end-to-end latency.},
	keywords = {algorithm;protocols;wireless, backbone, channels;, CONSTRUCTION, distributed, networks;parameterized, protocol;multihop, wireless},
	isbn = {1536-1233},
	doi = {10.1109/TMC.2008.69},
	author = {Lee,Seungjoon and Bhattacharjee, Bobby and Srinivasan, Aravind and Khuller, Samir}
}
@article {12982,
	title = {Bio-STEER: A Semantic Web workflow tool for Grid computing in the life sciences},
	journal = {Future Generation Comp Syst},
	volume = {23},
	year = {2007},
	month = {2007/03//},
	pages = {497 - 509},
	abstract = {Life science research is becoming evermore computationally intensive. Hence, from a computational resource perspective, Grid computing provides a logical approach to meeting many of the computational needs of life science research. However, there are several barriers to the widespread use of Grid computing in life sciences. In this paper, we attempt to address one particular barrier: the difficulty of using Grid computing by life scientists. Life science research often involves connecting multiple applications together to form a workflow. This process of constructing a workflow is complex. When combined with the difficulty of using Grid services, composing a meaningful workflow using Grid services can present a challenge to life scientists. Our proposed solution is a Semantic Web-enabled computing environment, called Bio-STEER. In BioSTEER, bioinformatics Grid services are mapped to Semantic Web services, described in OWL-S. We also defined an ontology in OWL to model bioinformatics applications. A graphical user interface helps to construct a scientific workflow by showing a list of services that are semantically sound: that is, the output of one service is semantically compatible with the input of the connecting service. Bio-STEER can help users take full advantaue of Grid services through a user-friendly graphical user interface (GUI), which allows them to easily construct the workflows they need. (c) 2006 Elsevier B.V. All rights reserved.},
	keywords = {client/server;, distributed, environments;, integrated, interface, management;, semantics;, services;, systems;, user, web-base, workflow},
	doi = {DOI 10.1016/j.future.2006.07.011},
	author = {Lee,S. and Wang,T. D and Hashmi,N. and Cummings, Michael P.}
}
@conference {14986,
	title = {Mitigating risk of data loss in preservation environments},
	booktitle = {Mass Storage Systems and Technologies, 2005. Proceedings. 22nd IEEE / 13th NASA Goddard Conference on},
	year = {2005},
	month = {2005/04//},
	pages = {39 - 48},
	abstract = {Preservation environments manage digital records for time periods that are much longer than that of a single vendor product. A primary requirement is the preservation of the authenticity and integrity of the digital records while simultaneously minimizing the cost of long-term storage, as the data is migrated onto successive generations of technology. The emergence of low-cost storage hardware has made it possible to implement innovative software systems that minimize risk of data loss and preserve authenticity and integrity. This paper describes software mechanisms in use in current persistent archives and presents an example based upon the NARA research prototype persistent archive.},
	keywords = {archives;, authentication;, authenticity;, computing;, data, databases;, digital, distributed, environment;, Grid, integrity;, management;, message, objects;, persistent, preservation, record, risk, storage},
	doi = {10.1109/MSST.2005.20},
	author = {Moore,R.W. and JaJa, Joseph F. and Chadduck,R.}
}
@conference {12296,
	title = {Adaptive replication in peer-to-peer systems},
	booktitle = {Distributed Computing Systems, 2004. Proceedings. 24th International Conference on},
	year = {2004},
	month = {2004///},
	pages = {360 - 369},
	abstract = {Peer-to-peer systems can be used to form a low-latency decentralized data delivery system. Structured peer-to-peer systems provide both low latency and excellent load balance with uniform query and data distributions. Under the more common skewed access distributions, however, individual nodes are easily overloaded, resulting in poor global performance and lost messages. This paper describes a lightweight, adaptive, and system-neutral replication protocol, called LAR, that maintains low access latencies and good load balance even under highly skewed demand. We apply LAR to Chord and show that it has lower overhead and better performance than existing replication strategies.},
	keywords = {adaptive, allocation;, data, databases;, decentralized, delivery, distributed, LAR, low-latency, peer-to-peer, processing;, protocol;, replicated, replication, resource, strategies;, structured, system-neutral, system;, systems;},
	doi = {10.1109/ICDCS.2004.1281601},
	author = {Gopalakrishnan,V. and Silaghi,B. and Bhattacharjee, Bobby and Keleher,P.}
}
@conference {12286,
	title = {Multi-dimensional quorum sets for read-few write-many replica control protocols},
	booktitle = {Cluster Computing and the Grid, 2004. CCGrid 2004. IEEE International Symposium on},
	year = {2004},
	month = {2004/04//},
	pages = {355 - 362},
	abstract = {We describe d-spaces, a replica control protocol defined in terms of quorum sets on multi-dimensional logical structures. Our work is motivated by asymmetrical access patterns, where the number of read accesses to data are dominant relative to update accesses, i.e. where the protocols should be read-few write-many. D-spaces are optimal with respect to quorum group sizes. The quality of the tradeoff between read efficiency and update availability is not matched by existing quorum protocols. We also propose a novel scheme for implementing d-spaces that combines caching and local information to provide a best-effort form of global views. This allows quorum reconfiguration to be lightweight without impacting access latencies, even when the rate of membership changes is very high.},
	keywords = {accesses;, availability;, cache, caching;, Communication, complexity;, CONTROL, d-spaces;, distributed, efficiency;, lightweight, logical, multi-dimensional, processing;, protocols;, quorum, read, read-few, reconfiguration;, replica, sets;, storage;, structures;, update, write-many},
	doi = {10.1109/CCGrid.2004.1336588},
	author = {Silaghi,B. and Keleher,P. and Bhattacharjee, Bobby}
}
@conference {18169,
	title = {Anti-collusion of group-oriented fingerprinting},
	booktitle = {Multimedia and Expo, 2003. ICME {\textquoteright}03. Proceedings. 2003 International Conference on},
	volume = {2},
	year = {2003},
	month = {2003/07//},
	pages = {II - 217-20 vol.2 - II - 217-20 vol.2},
	abstract = {Digital fingerprinting of multimedia data involves embedding information in the content, and offers protection to the digital rights of the content by allowing illegitimate usage of the content to be identified by authorized parties. One potential threat to fingerprints is collusion, whereby a group of adversaries combine their individual copies in an attempt to remove the underlying fingerprints. Former studies indicate that collusion attacks based on a few dozen independent copies can confound a fingerprinting system that employs orthogonal modulation. However, since an adversary is more likely to collude with some users than other users, we propose a group-based fingerprinting scheme where users likely to collude with each other are assigned correlated fingerprints. We evaluate the performance of our group-based fingerprints by studying the collusion resistance of a fingerprinting system employing Gaussian distributed fingerprints. We compare the results to those of fingerprinting systems employing orthogonal modulation.},
	keywords = {anticollusion, attacks;, collusion, communication;, data;, digital, distributed, distribution;, fingerprinting;, fingerprints;, Gaussian, group-oriented, Internet;, method;, modulation;, multimedia, orthogonal, security;, Telecommunication, watermarking;},
	doi = {10.1109/ICME.2003.1221592},
	author = {Wang,Z.J. and M. Wu and Trappe,W. and Liu,K. J.R}
}
@conference {12303,
	title = {Construction of an efficient overlay multicast infrastructure for real-time applications},
	booktitle = {INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications. IEEE Societies},
	volume = {2},
	year = {2003},
	month = {2003/04/03/march},
	pages = {1521 - 1531 vol.2 - 1521 - 1531 vol.2},
	abstract = {This paper presents an overlay architecture where service providers deploy a set of service nodes (called MSNs) in the network to efficiently implement media-streaming applications. These MSNs are organized into an overlay and act as application-layer multicast forwarding entities for a set of clients. We present a decentralized scheme that organizes the MSNs into an appropriate overlay structure that is particularly beneficial for real-time applications. We formulate our optimization criterion as a "degree-constrained minimum average-latency problem" which is known to be NP-hard. A key feature of this formulation is that it gives a dynamic priority to different MSNs based on the size of its service set. Our proposed approach iteratively modifies the overlay tree using localized transformations to adapt with changing distribution of MSNs, clients, as well as network conditions. We show that a centralized greedy approach to this problem does not perform quite as well, while our distributed iterative scheme efficiently converges to near-optimal solutions.},
	keywords = {application-layer;, applications;, communication;, criterion;, decentralized, distributed, entities;, forwarding, infrastructure;, Internet;, iterative, media-streaming, methods;, MSN;, Multicast, nodes;, NP-hard;, OPTIMIZATION, overlay, real, real-time, scheme;, service, systems;, TIME},
	doi = {10.1109/INFCOM.2003.1208987},
	author = {Banerjee,S. and Kommareddy,C. and Kar,K. and Bhattacharjee, Bobby and Khuller, Samir}
}
@conference {12304,
	title = {Cooperative peer groups in NICE},
	booktitle = {INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications. IEEE Societies},
	volume = {2},
	year = {2003},
	month = {2003///},
	pages = {1272 - 1282 vol.2 - 1272 - 1282 vol.2},
	abstract = {A distributed scheme for trust inference in peer-to-peer networks is presented. Our work is in context of the NICE system, which is a platform for implementing cooperative applications over the Internet. We describe a technique for efficiently storing user reputation information in a completely decentralized manner, and show how this information can be used to efficiently identify noncooperative users in NICE. We present a simulation based study of our algorithms, in which we show our scheme scales to thousands of users using modest amounts of storage, processing, and bandwidth at any individual node. Lastly, we show that our scheme is robust and can form cooperative groups in systems where the vast majority of users are malicious.},
	keywords = {algorithm;, cooperative, decentralized, distributed, identification;, individual, inference, inference;, information, Internet;, malicious, manner;, mechanisms;, networks;, NICE, node;, noncooperative, peer-to-peer, platform;, reputation, retrieval;, storage;, system;, trust, users, users;},
	doi = {10.1109/INFCOM.2003.1208963},
	author = {Lee,S. and Sherwood,R. and Bhattacharjee, Bobby}
}
@article {12301,
	title = {Deno: a decentralized, peer-to-peer object-replication system for weakly connected environments},
	journal = {Computers, IEEE Transactions on},
	volume = {52},
	year = {2003},
	month = {2003/07//},
	pages = {943 - 959},
	abstract = {This paper presents the design, implementation, and evaluation of the replication framework of Deno, a decentralized, peer-to-peer object-replication system targeted for weakly connected environments. Deno uses weighted voting for availability and pair-wise, epidemic information flow for flexibility. This combination allows the protocols to operate with less than full connectivity, to easily adapt to changes in group membership, and to make few assumptions about the underlying network topology. We present two versions of Deno{\textquoteright}s protocol that differ in the consistency levels they support. We also propose security extensions to handle a class of malicious actions that involve misrepresentation of protocol information. Deno has been implemented and runs on top of Linux and Win32 platforms. We use the Deno prototype to characterize the performance of the Deno protocols and extensions. Our study reveals several interesting results that provide fundamental insight into the benefits of decentralization and the mechanics of epidemic protocols.},
	keywords = {actions;, connected, consistency, data, data;, databases;, decentralized, Deno;, distributed, environments;, epidemic, group, levels;, Linux;, malicious, management;, membership;, network, object, object-replication, of, operating, peer-to-peer, protocols;, replicated, replication;, Security, security;, synchronisation;, system;, systems;, topology;, Unix;, voting;, weakly, weighted, Win32;},
	isbn = {0018-9340},
	doi = {10.1109/TC.2003.1214342},
	author = {Cetintemel,U. and Keleher,P. J and Bhattacharjee, Bobby and Franklin,M.J.}
}
@article {13007,
	title = {Necessity is the mother of invention: a simple grid computing system using commodity tools},
	journal = {J Parallel Distr Com},
	volume = {63},
	year = {2003},
	month = {2003/05//},
	pages = {578 - 589},
	abstract = {Access to sufficient resources is a barrier to scientific progress for many researchers facing large computational problems. Gaining access to large-scale resources (i.e., university-wide or federally supported computer centers) can be difficult, given their limited availability, particular architectures, and request/review/approval cycles. Simultaneously, researchers often find themselves with access to workstations and older clusters overlooked by their owners in favor of newer hardware. Software to tie these resources into a coherent Grid, however, has been problematic. Here, we describe our experiences building a Grid computing system to conduct a large-scale simulation study using "borrowed" computing resources distributed over a wide area. Using standard software components, we have produced a Grid computing system capable of coupling several hundred processors spanning multiple continents and administrative domains. We believe that this system fills an important niche between a closely coupled local system and a heavyweight, highly customized wide area system. (C) 2003 Elsevier Science (USA). All rights reserved.},
	keywords = {Apache;, computing;, distributed, Grid, HTTP;, Java;, Linux;, Perl;, SQL;, Unix;, XML-RPC},
	doi = {DOI 10.1016/S0743-7315(03)00004-2},
	author = {Myers,D. S and Cummings, Michael P.}
}
@conference {18266,
	title = {Resistance of orthogonal Gaussian fingerprints to collusion attacks},
	booktitle = {Multimedia and Expo, 2003. ICME {\textquoteright}03. Proceedings. 2003 International Conference on},
	volume = {1},
	year = {2003},
	month = {2003/07//},
	pages = {I - 617-20 vol.1 - I - 617-20 vol.1},
	abstract = {Digital fingerprinting is a means to offer protection to digital data by which fingerprints embedded in the multimedia are capable of identifying unauthorized use of digital content. A powerful attack that can be employed to reduce this tracing capability is collusion. In this paper, we study the collusion resistance of a fingerprinting system employing Gaussian distributed fingerprints and orthogonal modulation. We propose a likelihood-based approach to estimate the number of colluders, and introduce the thresholding detector for colluder identification. We first analyze the collusion resistance of a system to the average attack by considering the probability of a false negative and the probability of a false positive when identifying colluders. Lower and upper bounds for the maximum number of colluders K<sub>max</sub> are derived. We then show that the detectors are robust to different attacks. We further study different sets of performance criteria.},
	keywords = {approach;, attacks;, capability;, collusion, data, data;, digital, distributed, embedded, fingerprinting;, fingerprints;, Gaussian, likelihood-based, modulation;, multimedia, of, orthogonal, probability;, processes;, protection;, Security, systems;, tracing},
	doi = {10.1109/ICME.2003.1220993},
	author = {Wang,Z.J. and M. Wu and Zhao,Hong and Liu,K. J.R and Trappe,W.}
}
@article {17815,
	title = {Presentation planning for distributed VoD systems},
	journal = {Knowledge and Data Engineering, IEEE Transactions on},
	volume = {14},
	year = {2002},
	month = {2002/10//sep},
	pages = {1059 - 1077},
	abstract = {A distributed video-on-demand (VoD) system is one where a collection of video data is located at dispersed sites across a computer network. In a single site environment, a local video server retrieves video data from its local storage device. However, in distributed VoD systems, when a customer requests a movie from the local server, the server may need to interact with other servers located across the network. In this paper, we present different types of presentation plans that a local server can construct in order to satisfy a customer request. Informally speaking, a presentation plan is a temporally synchronized sequence of steps that the local server must perform in order to present the requested movie to the customer. This involves obtaining commitments from other video servers, obtaining commitments from the network service provider, as well as making commitments of local resources, while keeping within the limitations of available bandwidth, available buffer, and customer data consumption rates. Furthermore, in order to evaluate the quality of a presentation plan, we introduce two measures of optimality for presentation plans: minimizing wait time for a customer and minimizing access bandwidth which, informally speaking, specifies how much network/disk bandwidth is used. We develop algorithms to compute three different optimal presentation plans that work at a block level, or at a segment level, or with a hybrid mix of the two, and compare their performance through simulation experiments. We have also mathematically proven effects of increased buffer or bandwidth and data replications for presentation plans which had previously been verified experimentally in the literature.},
	keywords = {Computer, computing;, databases;, demand;, distributed, local, multimedia, network;, on, optimal, plan;, plans;, presentation, presentation;, server;, servers;, video, video-on-demand;, VoD;},
	isbn = {1041-4347},
	doi = {10.1109/TKDE.2002.1033774},
	author = {Hwang,Eenjun and Prabhakaran,B. and V.S. Subrahmanian}
}
@article {15038,
	title = {The block distributed memory model},
	journal = {Parallel and Distributed Systems, IEEE Transactions on},
	volume = {7},
	year = {1996},
	month = {1996/08//},
	pages = {830 - 840},
	abstract = {We introduce a computation model for developing and analyzing parallel algorithms on distributed memory machines. The model allows the design of algorithms using a single address space and does not assume any particular interconnection topology. We capture performance by incorporating a cost measure for interprocessor communication induced by remote memory accesses. The cost measure includes parameters reflecting memory latency, communication bandwidth, and spatial locality. Our model allows the initial placement of the input data and pipelined prefetching. We use our model to develop parallel algorithms for various data rearrangement problems, load balancing, sorting, FFT, and matrix multiplication. We show that most of these algorithms achieve optimal or near optimal communication complexity while simultaneously guaranteeing an optimal speed-up in computational complexity. Ongoing experimental work in testing and evaluating these algorithms has thus far shown very promising results},
	keywords = {accesses;single, address, algorithms;performance, algorithms;performance;remote, allocation;sorting;, balancing;matrix, bandwidth;communication, communication;load, complexity;computation, complexity;computational, complexity;cost, complexity;distributed, distributed, evaluation;resource, FFT;block, Fourier, latency;parallel, locality;communication, machines;interconnection, measure;data, memory, model;communication, model;computational, multiplication;memory, multiplication;parallel, problems;distributed, rearrangement, space;sorting;spatial, systems;fast, topology;interprocessor, transforms;matrix},
	isbn = {1045-9219},
	doi = {10.1109/71.532114},
	author = {JaJa, Joseph F. and Ryu,Kwan Woo}
}
@conference {15039,
	title = {The block distributed memory model for shared memory multiprocessors},
	booktitle = {Parallel Processing Symposium, 1994. Proceedings., Eighth International},
	year = {1994},
	month = {1994/04//},
	pages = {752 - 756},
	abstract = {Introduces a computation model for developing and analyzing parallel algorithms on distributed memory machines. The model allows the design of algorithms using a single address space and does not assume any particular interconnection topology. We capture performance by incorporating a cost measure for interprocessor communication induced by remote memory accesses. The cost measure includes parameters reflecting memory latency, communication bandwidth, and spatial locality. Our model allows the initial placement of the input data and pipelined prefetching. We use our model to develop parallel algorithms for various data rearrangement problems, load balancing, sorting, FFT, and matrix multiplication. We show that most of these algorithms achieve optimal or near optimal communication complexity while simultaneously guaranteeing an optimal speed-up in computational complexity},
	keywords = {accesses;shared, address, algebra;parallel, algorithms;performance, algorithms;performance;pipelined, allocation;shared, balancing;matrix, bandwidth;computation, block, Communication, communication;load, complexity;computational, complexity;cost, complexity;distributed, complexity;optimal, data, distributed, evaluation;resource, Fourier, latency;optimal, locality;communication, measure;data, memory, model;communication, model;computational, multiplication;memory, multiprocessors;single, placement;interprocessor, prefetching;remote, problems;fast, rearrangement, space;sorting;spatial, speedup;parallel, systems;fast, systems;sorting;, transforms;input, transforms;matrix},
	doi = {10.1109/IPPS.1994.288220},
	author = {JaJa, Joseph F. and Ryu,Kwan Woo}
}
