Thesis (M. Phil.)--University of Hong Kong, 2002. / Includes bibliographical references (leaf 13).

In many applications, entities and their relationships are represented by graphs. Examples include social networks (users and friendship), the WWW (web pages and hyperlinks) and bibliographic networks (authors and co-authorship). In a dynamic world, information changes and so the graphs representing the information evolve with time. For example, a Facebook link between two friends is established, or a hyperlink is added to a web page. We propose that historical graph-structured data be archived for analytical processing. We call a historical evolving graph sequence an EGS. We study the problem of efficient query processing on an EGS, which finds many applications that lead to interesting evolving graph analysis. To solve the problem, we propose a solution framework called FVF and a cluster-based LU decomposition algorithm called CLUDE, which can evaluate queries efficiently to support EGS analysis. The Find-Verify-and-Fix (FVF) framework applies to a wide range of queries. We demonstrate how some important graph measures, including shortest-path distance, closeness centrality and graph centrality, can be efficiently computed from EGSs using FVF. Since an EGS generally contains numerous large graphs, we also discuss several compact storage models that support our FVF framework. Through extensive experiments on both real and synthetic datasets, we show that our FVF framework is highly efficient in EGS query processing. A graph can be conveniently modeled by a matrix from which various quantitative measures are derived like PageRank and SALSA and Personalized PageRank and Random Walk with Restart. To compute these measures, linear systems of the form Ax = b, where A is a matrix that captures a graph's structure, need to be solved. To facilitate solving the linear system, the matrix A is often decomposed into two triangular matrices (L and U). In a dynamic world, the graph that models it changes with time and thus is the matrix A that represents the graph. We consider a sequence of evolving graphs and its associated sequence of evolving matrices. We study how LU-decomposition should be done over the sequence so that (1) the decomposition is efficient and (2) the resulting LU matrices best preserve the sparsity of the matrices A's (i.e., the number of extra non-zero entries introduced in L and U are minimized). We propose a cluster-based algorithm CLUDE for solving the problem. Through an experimental study, we show that CLUDE is about an order of magnitude faster than the traditional incremental update algorithm. The number of extra non-zero entries introduced by CLUDE is also about an order of magnitude fewer than that of the traditional algorithm. CLUDE is thus an efficient algorithm for LU decomposition that produces high-quality LU matrices over an evolving matrix sequence. / published_or_final_version / Computer Science / Doctoral / Doctor of Philosophy

published_or_final_version / Mathematics / Master / Master of Philosophy

No description available.

Efficient resource utilization and fast failure recovery are essential design goals of next-generation backbone networks. The need for efficient resource utilization has motivated the development of various protocols and techniques that offer data services over legacy backbone networks such as Synchronous Optical Network/Synchronous Digital Hierarchy (SONET/SDH). Enabling improved utilization with enhanced network reliability requires various network optimizations, both at the protocol and system levels. In this dissertation, we present a set of network optimization techniques that improve the performance of an end-user connected to classical packet networks such as Internet. First, we introduce an efficient path selection algorithm that enables seamless bandwidth upgrade for an existing Ethernet connection over SONET/SDH backbone using virtual concatenation technique. We also provide a heterogenous concatenation technique that improves the bandwidth utilization and that is easy to maintain. Second, we present a novel failure localization technique, that can detect single-link or simultaneous multiple-link failures. This technique is based on constructing a set of monitoring paths and cycles from one or more monitoring locations in the network. Third, we present an efficient routing and wavelength assignment scheme for backbone networks with stale network-state information. Finally, we present an e±cient server placement scheme for supporting multiple-description-coding (MDC) based media streaming over content delivery networks. We show that by using MDC-encoded media, intelligent server placement, and efficient path selection, the performance of an end-user can be greatly improved.

No description available.

No description available.

No description available.

No description available.

No description available.