@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}
}
@conference {12240,
	title = {Integrating categorical resource types into a P2P desktop grid system},
	booktitle = {Grid Computing, 2008 9th IEEE/ACM International Conference on},
	year = {2008},
	month = {2008/10/29/1},
	pages = {284 - 291},
	abstract = {We describe and evaluate a set of protocols that implement a distributed, decentralized desktop grid. Incoming jobs are matched with system nodes through proximity in an N-dimensional resource space. This work improves on prior work by (1) efficiently accommodating node and job characterizations that include both continuous and categorical resource types, and (2) scaling gracefully to large system sizes even with highly non-uniform distributions of job and node types. We use extensive simulation results to show that the resulting system handles both continuous and categorical constraints efficiently, and that the new scalability techniques are effective.},
	keywords = {computing;peer-to-peer, computing;protocols;, computing;protocols;scalability, desktop, Grid, grid;distributed, grid;peer-to-peer, N-dimensional, resource, space;P2P, system;categorical, technique;grid, types;decentralized},
	doi = {10.1109/GRID.2008.4662810},
	author = {Kim,Jik-Soo and Nam,Beomseok and Marsh,M. and Keleher,P. and Bhattacharjee, Bobby and Sussman, Alan}
}
@article {18236,
	title = {Joint Uplink and Downlink Optimization for Real-Time Multiuser Video Streaming Over WLANs},
	journal = {Selected Topics in Signal Processing, IEEE Journal of},
	volume = {1},
	year = {2007},
	month = {2007/08//},
	pages = {280 - 294},
	abstract = {In this paper, a network-aware and source-aware video streaming system is proposed to support interactive multiuser communications within single-cell and multicell IEEE 802.11 networks. Unlike the traditional streaming video services, the strict delay constraints of an interactive video streaming system pose more challenges. These challenges include the heterogeneity of uplink and downlink channel conditions experienced by different users, the multiuser resource allocation of limited radio resources, the incorporation of the cross-layer design, and the diversity of content complexities exhibited by different video sequences. With the awareness of video content and network resources, the proposed system integrates cross-layer error protection mechanism and performs dynamic resource allocation across multiple users. We formulate the proposed system as to minimize the maximal end-to-end expected distortion received by all users, subject to maximal transmission power and delay constraints. To reduce the high dimensionality of the search space, fast multiuser algorithms are proposed to find the near-optimal solutions. Compared to the strategy without dynamically and jointly allocating bandwidth resource for uplinks and downlinks, the proposed framework outperforms by 2.18 7.95 dB in terms of the average received PSNR of all users and by 3.82 11.50 dB in terms of the lowest received PSNR among all users. Furthermore, the proposed scheme can provide more uniform video quality for all users and lower quality fluctuation for each received video sequence.},
	keywords = {802.11, allocation;image, allocation;real-time, communications;maximal, distortion;multiuser, end-to-end, error, expected, IEEE, LAN;, mechanism;downlink, multiuser, networks;WLAN;cross-layer, optimization;interactive, optimization;video, Protection, quality;video, resource, sequences;video, streaming, streaming;uplink, streaming;wireless, system;bandwidth, video},
	isbn = {1932-4553},
	doi = {10.1109/JSTSP.2007.901518},
	author = {Su,Guan-Ming and Han,Zhu and M. Wu and Liu,K. J.R}
}
@article {18253,
	title = {Multiuser cross-layer resource allocation for video transmission over wireless networks},
	journal = {Network, IEEE},
	volume = {20},
	year = {2006},
	month = {2006/04//march},
	pages = {21 - 27},
	abstract = {With the advancement of video-compression technology and the wide deployment of wireless networks, there is an increasing demand for wireless video communication services, and many design challenges remain to be overcome. In this article, we discuss how to dynamically allocate resources according to the changing environments and requirements, so as to improve the overall system performance and ensure individual quality of service (QoS). Specifically, we consider two aspects with regard to design issues: cross-layer design, which jointly optimizes resource utilization from the physical layer to the application layer, and multiuser diversity, which explores source and channel heterogeneity for different users. We study how to efficiently transmit multiple video streams, encoded by current and future video codecs, over resource-limited wireless networks such as 3G/4G cellular system and future wireless local/metropolitan area networks (WLANs/WMANs)},
	keywords = {3G, allocation;multiuser, allocation;video, cellular, channels;quality, codecs;video, coding;video, communication;4G, communication;data, compression;diversity, cross-layer, diversity;physical, layer;multiple, layer;quality, mobile, networks;3G, of, reception;multiuser, resource, service;resource, service;video, streaming;, streams;multiuser, system;4G, system;QoS;application, technology;wireless, transmission;video-compression, video},
	isbn = {0890-8044},
	doi = {10.1109/MNET.2006.1607892},
	author = {Su,Guan-Ming and Man,Zhu and M. Wu and Liu,K. J.R}
}
@article {18208,
	title = {Efficient bandwidth resource allocation for low-delay multiuser video streaming},
	journal = {Circuits and Systems for Video Technology, IEEE Transactions on},
	volume = {15},
	year = {2005},
	month = {2005/09//},
	pages = {1124 - 1137},
	abstract = {This paper studies efficient bandwidth resource allocation for streaming multiple MPEG-4 fine granularity scalability (FGS) video programs to multiple users. We begin with a simple single-user scenario and propose a rate-control algorithm that has low delay and achieves an excellent tradeoff between the average visual distortion and the quality fluctuation. The proposed algorithm employs two weight factors for adjusting the tradeoff, and the optimal choice of these factors is derived. We then extend to the multiuser case and propose a dynamic resource allocation algorithm with low delay and low computational complexity. By exploring the variations in the scene complexity of video programs as well as dynamically and jointly distributing the available system resources among users, our proposed algorithm provides low fluctuation of quality for each user, and can support consistent or differentiated quality among all users to meet applications{\textquoteright} needs. Experimental results show that compared to traditional look-ahead sliding-window approaches, our algorithm can achieve comparable visual quality and channel utilization at a much lower cost of delay, computation, and storage.},
	keywords = {algorithm;, allocation, allocation;, approaches;, average, Bandwidth, channel, channels;, coding;, complexity;, computational, control;, distortion;, dynamic, efficient, fine, fluctuation;, granularity, look-ahead, low-delay, MPEG-4, multiple, multiuser, QUALITY, quality;, rate-control, resource, scalability, scenario;, single-user, sliding-window, streaming;, Telecommunication, utilization;, video, visual},
	isbn = {1051-8215},
	doi = {10.1109/TCSVT.2005.852626},
	author = {Su,Guan-Ming and M. Wu}
}
@conference {12280,
	title = {Measurement-based multipath multicast},
	booktitle = {INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings IEEE},
	volume = {4},
	year = {2005},
	month = {2005/03//},
	pages = {2803 - 2808 vol. 4 - 2803 - 2808 vol. 4},
	abstract = {We propose a measurement-based routing algorithm to load balance intradomain traffic along multiple paths for multiple multicast sources. Multiple paths are established using application-layer overlaying. The proposed algorithm is able to converge under different network models, where each model reflects a different set of assumptions about the multicasting capabilities of the network. The algorithm is derived from simultaneous perturbation stochastic approximation and relies only on noisy estimates from measurements. Simulation results are presented to demonstrate the additional benefits obtained by incrementally increasing the multicasting capabilities.},
	keywords = {algorithm;, allocation;, application-layer, approximation, approximation;, balance, communication;, Convergence, convergence;, intradomain, load, measurement-based, methods;, Multicast, multipath, network, numerical, of, overlaying;, perturbation, processes;, resource, Routing, routing;, source;, Stochastic, techniques;, Telecommunication, theory;, traffic;},
	doi = {10.1109/INFCOM.2005.1498566},
	author = {Guven,T. and La,R.J. and Shayman,M.A. and Bhattacharjee, Bobby}
}
@conference {17790,
	title = {RDF aggregate queries and views},
	booktitle = {Data Engineering, 2005. ICDE 2005. Proceedings. 21st International Conference on},
	year = {2005},
	month = {2005/04//},
	pages = {717 - 728},
	abstract = {Resource description framework (RDF) is a rapidly expanding Web standard. RDF databases attempt to track the massive amounts of Web data and services available. In this paper, we study the problem of aggregate queries. We develop an algorithm to compute answers to aggregate queries over RDF databases and algorithms to maintain views involving those aggregates. Though RDF data can be stored in a standard relational DBMS (and hence we can execute standard relational aggregate queries and view maintenance methods on them), we show experimentally that our algorithms that operate directly on the RDF representation exhibit significantly superior performance.},
	keywords = {aggregate, databases;, DBMS;, description, framework;, languages;, Maintenance, methods;, processing;, queries;, query, RDF, relational, resource, standard;, standards;, view, Web},
	doi = {10.1109/ICDE.2005.121},
	author = {Hung,E. and Deng,Yu and V.S. Subrahmanian}
}
@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 {18200,
	title = {Distortion management of real-time MPEG-4 video over downlink multicode CDMA networks},
	booktitle = {Communications, 2004 IEEE International Conference on},
	volume = {5},
	year = {2004},
	month = {2004/06//},
	pages = {3071 - 3075 Vol.5 - 3071 - 3075 Vol.5},
	abstract = {In this paper, a protocol is designed to manage source rate/channel coding rate adaptation, code allocation, and power control to transmit real-time MPEG-4 FGS video over downlink multicode CDMA networks. We develop a fast adaptive scheme of distortion management to reduce the overall distortion received by all users subject, to the limited number of codes and maximal transmitted power. Compared with a modified greedy method in literature, our proposed algorithm can reduce the overall system{\textquoteright}s distortion by at least 45\%.},
	keywords = {access;, adaptation;, allocation;, CDMA, channel, code, coding, coding;, combined, communication;, compression;, control;, data, distortion, division, downlink, links;, management;, MPEG-4, multicode, multiple, networks;, power, radio, rate, real-time, resource, source, source-channel, video, video;, visual},
	doi = {10.1109/ICC.2004.1313096},
	author = {Su,Guan-Ming and Han,Zhu and Kwasinski,A. and M. Wu and Liu,K. J.R and Farvardin,N.}
}
@conference {18207,
	title = {Efficient bandwidth resource allocation for low-delay multiuser MPEG-4 video transmission},
	booktitle = {Communications, 2004 IEEE International Conference on},
	volume = {3},
	year = {2004},
	month = {2004/06//},
	pages = {1308 - 1312 Vol.3 - 1308 - 1312 Vol.3},
	abstract = {An efficient bandwidth resource allocation algorithm with low delay and low fluctuation of quality to transmit multiple MPEG-4 fine granularity scalability (FGS) video programs to multiple users is proposed in this paper. By exploring the variation in the scene complexity of each video program and jointly redistributing available system resources among users, our proposed algorithm provides low fluctuation of quality for each user and consistent quality among all users. Experimental results show that compared to a traditional look-ahead sliding-window approach, our scheme can achieve comparable perceptual quality and channel utilization at a much lower cost of delay, computation, and storage.},
	keywords = {algorithm;, allocation, allocation;, approach;, Bandwidth, broadband, channel, channels;, coding;, delays;, expert, FGS;, fine, granularity, group;, look-ahead, moving, MPEG-4, multiuser, networks;, of, picture, program;, QUALITY, resource, scalability;, service;, sliding-window, transmission;, utilization;, video},
	doi = {10.1109/ICC.2004.1312724},
	author = {Su,Guan-Ming and M. Wu}
}
@conference {12287,
	title = {Hierarchical routing with soft-state replicas in TerraDir},
	booktitle = {Parallel and Distributed Processing Symposium, 2004. Proceedings. 18th International},
	year = {2004},
	month = {2004/04//},
	pages = {48 - 48},
	abstract = {Summary form only given. Recent work on peer-to-peer systems has demonstrated the ability to deliver low latencies and good load balance when demand for data is relatively uniform. We describe an adaptive replication protocol that delivers low latencies, good load balance even when demand is heavily skewed. The protocol can withstand arbitrary and instantaneous changes in demand distribution. Our approach also addresses classical concerns related to topological constraints of asymmetrical namespaces, such as hierarchical bottlenecks in the context of hierarchical namespaces. The protocol replicates routing state in an ad-hoc manner based on profiled information, is lightweight, scalable, and requires no replica consistency guarantees.},
	keywords = {ad-hoc, adaptive, allocation;, asymmetrical, balancing;, bottlenecks;, consistency, constraints;, delivering;, demand, distribution;, guarantees;, hierarchical, latency, load, low, namespaces;, peer-to-peer, protocol;, protocols;, replica, replicas;, replication, resource, routing;, soft-state, systems;, TerraDir;, topological},
	doi = {10.1109/IPDPS.2004.1302967},
	author = {Silaghi,B. and Gopalakrishnan,Vijay and Bhattacharjee, Bobby and Kelcher,P.}
}
@conference {13623,
	title = {Performance evaluation of object detection algorithms},
	booktitle = {Pattern Recognition, 2002. Proceedings. 16th International Conference on},
	volume = {3},
	year = {2002},
	month = {2002///},
	pages = {965 - 969 vol.3 - 965 - 969 vol.3},
	abstract = {The continuous development of object detection algorithms is ushering in the need for evaluation tools to quantify algorithm performance. In this paper a set of seven metrics are proposed for quantifying different aspects of a detection algorithm{\textquoteright}s performance. The strengths and weaknesses of these metrics are described. They are implemented in the Video Performance Evaluation Resource (ViPER) system and will be used to evaluate algorithms for detecting text, faces, moving people and vehicles. Results for running two previous text-detection algorithms on a common data set are presented.},
	keywords = {algorithms;, common, data, DETECTION, detection;, Evaluation, evaluation;, image, object, performance, recognition;, resource, set;, system;, text-detection, video},
	doi = {10.1109/ICPR.2002.1048198},
	author = {Mariano,V.Y. and Min,Junghye and Park,Jin-Hyeong and Kasturi,R. and Mihalcik,D. and Huiping Li and David Doermann and Drayer,T.}
}
@article {11913,
	title = {Rover: scalable location-aware computing},
	journal = {Computer},
	volume = {35},
	year = {2002},
	month = {2002/10//},
	pages = {46 - 53},
	abstract = {All the components necessary for realizing location-aware computing are available in the marketplace today. What has hindered the widespread deployment of location-based systems is the lack of an integration architecture that scales with user populations. The authors have completed the initial implementation of Rover, a system designed to achieve this sort of integration and to automatically tailor information and services to a mobile user{\textquoteright}s location. Their studies have validated Rover{\textquoteright}s underlying software architecture, which achieves system scalability through high-resolution, application-specific resource scheduling at the servers and network. The authors believe that this technology will greatly enhance the user experience in many places, including museums, amusement and theme parks, shopping malls, game fields, offices, and business centers. They designed the system specifically to scale to large user populations and expect its benefits to increase with them.},
	keywords = {amusement, application-specific, architecture;, automation;, business, business;, computing;, data, entertainment;, handheld, humanities;, integration, LAN;, location-aware, malls;, mobile, museums;, office, parks;, processing;, resource, Rover;, scalability;, scalable, scheduling;, shopping, software, system, theme, units;, user;, wireless},
	isbn = {0018-9162},
	doi = {10.1109/MC.2002.1039517},
	author = {Banerjee,S. and Agarwal,S. and Kamel,K. and Kochut, A. and Kommareddy,C. and Nadeem,T. and Thakkar,P. and Trinh,Bao and Youssef,A. and Youssef, M. and Larsen,R.L. and Udaya Shankar,A. and Agrawala, Ashok K.}
}
@article {18206,
	title = {Dynamic resource allocation via video content and short-term traffic statistics},
	journal = {Multimedia, IEEE Transactions on},
	volume = {3},
	year = {2001},
	month = {2001/06//},
	pages = {186 - 199},
	abstract = {The reliable and efficient transmission of high-quality variable bit rate (VBR) video through the Internet generally requires network resources be allocated in a dynamic fashion. This includes the determination of when to renegotiate for network resources, as well as how much to request at a given time. The accuracy of any resource request method depends critically on its prediction of future traffic patterns. Such a prediction can be performed using the content and traffic information of short video segments. This paper presents a systematic approach to select the best features for prediction, indicating that while content is important in predicting the bandwidth of a video hit stream, the use of both content and available short-term bandwidth statistics can yield significant improvements. A new framework for traffic prediction is proposed in this paper; experimental results show a smaller mean-square resource prediction error and higher overall link utilization},
	keywords = {allocation;link, allocation;multimedia, allocation;variable, bit, codes;, content;bandwidth, error;short, Internet;dynamic, patterns;variable, prediction, rate, resource, segments;short-term, statistics;traffic, systems;resource, traffic, utilization;mean-square, video, video;video},
	isbn = {1520-9210},
	doi = {10.1109/6046.923818},
	author = {M. Wu and Joyce,R.A. and Wong,Hau-San and Guan,Long and Kung,Sun-Yuan}
}
