18033316
Lateral error recovery for application-level multicast
We consider the delivery of reliable and streaming services using application-level multicast (ALM) by means of UDP, where packet loss has to be recovered via retransmission in a timely manner in order to offer high level of service. Since packets may be lost due to congestion, tree-reconfiguration or node failure, the traditional "vertical" recovery, whereby upstream nodes retransmit the lost packet is no longer effective. We therefore propose and investigate lateral error recovery (LER). In LER, hosts are divided into a number of planes, each of which forms an independent ALM tree. Since the correlation of error among the planes is likely to be low, a node can effectively recover its error "laterally" from nearby nodes in other planes. We employ the technique of global network positioning (GNP) to map the hosts into a coordinate space and identify a set of close neighbors for error recovery by constructing a Voronoi diagram for each plane. We present centralized and distributed algorithm on how to construct the Voronoi diagrams. Using Internet-like topologies, we show via simulations that our system achieves low overheads in terms of relative delay penalty and physical link stress. For reliable service, lateral recovery greatly reduces the average recovery time as compared with vertical recovery schemes. For streaming applications, LER achieves much lower residual loss rate under a certain deadline constraint.
2436898
Video loss recovery with FEC and stream replication
Packet loss is inevitable in video multicast. In this paper, we propose and study an effective feedback-free loss recovery scheme for layered video which combines forward error correction (FEC) and stream replication. In our scheme, the server multicasts the video in parallel with FEC packets and a number of replicated delayed (ReD) version of the stream. Receivers autonomously and dynamically join the FEC and ReD streams to repair their losses. On the server side, we analyze and optimize the number of replicated streams and FEC packets to meet a certain residual loss requirement (i.e., error after correction). On the receiver side, we analyze the optimal combination of FEC and ReD packets to minimize its loss. We also present a fast yet accurate approximation algorithm for receiver to make such decision. We show that FEC combined with merely one or two replicated streams can effectively reduce the residual error rate (by as much as 50%) as compared with pure FEC or replication alone. Both subjective and objective video measures confirm that our recovery scheme achieves much better visual quality.
101074
Fine-grained device management in an interactive media server
The use of interactive media has already gained considerable popularity. Interactivity gives viewers VCR controls like slow-motion, pause, fast-forward, and instant replay. However, traditional server-based or client-based approaches for supporting interactivity either consume too much network bandwidth or require large client buffering; and hence they are economically unattractive. We propose the architecture and design of an interactive media proxy (IMP) server that transforms noninteractive broadcast or multicast streams into interactive ones for servicing a large number of end users. For IMP to work cost-effectively, it must carefully manage its storage devices, which are needed for caching voluminous media data. In this regard, we propose a fine-grained device management strategy consisting of three complementary components: disk profiler, data placement, and IO scheduler. Through quantitative analysis and experiments, we show that these fine-grained strategies considerably improve device throughput under various workload scenarios.
15156958
Modeling and Dimensioning Hierarchical Storage Systems for Low-Delay Video Services
In order to cost-effectively accommodate a large number of titles in a video system, a hierarchical storage system can be used. In this system, not-so-popular video files are stored in a tertiary level such as a disk/tape library. These files are transferred, or "staged," to a secondary level composed of magnetic disks before being streamed to the users. This system overcomes the current limitations in using disk/tape libraries to stream videos and resolves the bandwidth difference between staging and streaming. We present, via analysis, a model of the system and determine the minimum storage and bandwidth required, at each level, to meet a given user delay goal. We also analyze a number of system operations pertaining to whether or not a file is played while it is being staged (i.e., stage-streaming) and whether or not the displayed segments are deleted (i.e., trail-deletion). We show that stage-streaming and trail-deletion can achieve substantially lower bandwidth and storage requirements. In order to further increase the streaming and storage scalability, a distributed storage system can be used where multiple local servers are put close to user pools and get their files from one of the libraries through a network. We extend the models developed to such a system and specify the resource requirements to meet a given delay goal.
18235731
Distributed servers architecture for networked video services
In an on-demand video system, the video repository generally has limited streaming capacities and may be far from the users. In order to achieve higher user capacity and lower network transmission cost, distributed servers architecture can be used, in which multiple local servers are placed close to user pools and, according to their local demands, dynamically cache the contents streamed from the repository. We study a number of caching schemes as applied in the local servers depending on whether the repository is able to multicast movie contents to the local servers or not, and whether the local servers can exchange their cached contents among themselves or not. Our caching schemes keep a circular buffer of data for the movie requested, and hence movies are partially cached. By adjusting the size of the buffer, such caching is able to achieve better tradeoff between network channels and local storage as compared to the traditional caching in which a movie is treated as an entity. For each caching scheme, we study the tradeoff between the local storage and the network channels, and address how the total cost of the system can be minimized by appropriately sizing the buffer. As compared to a number of traditional operations (request batching and multicasting, true-VOD, etc.), we show that distributed servers architecture is able to achieve much lower system cost to offer on-demand video services.
15138447
A new motion compensation approach for error resilient video coding
Multihypothesis motion-compensated prediction (MHMCP) can be used as an error resilience technique for video coding. Motivated by MHMCP, we propose a new error resilience approach named alternative motion-compensated prediction (AMCP), where two-hypothesis and one-hypothesis predictions are alternatively used with some mechanism. Both theory and simulation results show that in case of one frame loss, the expected converged error using AMCP is smaller than that using two-hypothesis MCP.
14787927
Sentiment-based search in digital libraries
Several researchers have developed tools for classifying/ clustering Web search results into different topic areas (such as sports, movies, travel, etc.), and to help users identify relevant results quickly in the area of interest. This study follows a similar approach, but is in the area of sentiment classification - automatically classifying on-line review documents according to the overall sentiment expressed in them. This paper presents a prototype system that has been developed to perform sentiment categorization of Web search results. It assists users to quickly focus on recommended (or non-recommended) information by classifying Web search results into four categories: positive, negative, neutral, and non-review documents, by using an automatic classifier based on a supervised machine learning algorithm, support vector machine (SVM)
41363533
Accessing Hidden Web Documents by Metasearching a Directory of Specialty Search Engines
Many valuable Web documents have not been indexed by general search engines and are only accessible through specific search interfaces. Metasearching groups of specialty search engines is one possible way to gain access to large amount of such hidden Web resources. One of the key issues for returning quality metasearch results is how to select the most relevant specialty search engines for a given query. We introduce a method for categorizing specialty search engines automatically into a hierarchical directory for metasearching. By utilizing the directory, specialty search engines that have a high possibility of having relevant information and resources can be easily selected by a metasearch engine. We evaluate our algorithm by comparing the directory built by the proposed algorithm with another one that was built by human-judgments. In addition, we present a metasearch engine prototype, which demonstrates that such a specialty search engine directory can be beneficial in locating essential but hidden Web resources.
30718261
A data link control protocol for broadband wireless networks with adaptive coding rate
One of the challenges of broadband wireless multimedia networks is to design a wireless data link control (W-DLC) protocol which provides reliable data delivery over the noisy wireless link in an efficient manner. This paper presents our proposal of such a W-DLC protocol, based on a new coding scheme called multi-dimensional concatenated zigzag code. Both real-time and non-real-time traffic can be efficiently supported by adopting different error control mechanisms. A distinct feature of the protocol is that the coding rate can be adapted to a wide range of channel conditions. Hence, our protocol utilizes the scarce wireless channel resources more efficiently. Copyright © 2005 John Wiley & Sons, Ltd.
10729822
Segment-based application level multicast (SALM) for supporting group communication in CSCW applications
This paper illustrates an application level multicast architecture -segment-based application level multicast (SALM). The SALM partitions the shared multicast tree into segments and creates control mesh group (CMG) composed of segment leaders. SALM, in accordance with estimations of intra-segment and inter-segment interactions, dynamically adjusts the sizes of the segments and the configuration of CMG to improve the perceived performance in a collaborative working environment and a relatively stable shared multicast tree structure. The main purpose of CMG is to improve users' performance when they interact with CSCW applications.
39840719
Mapping XML Schema to Relations Using Genetic Algorithm
As web-applications grow in number and complexity, there is a need for efficient mappings from XML schemas to the flat relational tables so that existing functions in relational database systems can be utilized. However, many of the existing mapping methods, such as the model-based or the structure-based methods, do not exploit query history for better query performance. In this paper, we propose the use of genetic algorithm (GA) in a cost-based approach for converting a XML schema to relational tables. By formulating the mapping problem as a cost optimization task with respect to a set of weighted frequent queries, we can obtain an efficient mapping that minimizes the queries execution time. In our experiments, we show that the mapping obtained by GA is superior to other non-cost-based approaches. In particular, the GA approach has out-performed the greedy heuristic in the browsing queries where the accessed attributes are many and scattered.