Bøger i Network Theory and Applications serien

Chapter 1 pro vides a brief survey on the networking architectures of optical trans- XVll xvm MULTICHANNEL OPTICAL NETWORKS port networks, optical access networks and optical premise networks.

Introduction The exponential scaling of feature sizes in semiconductor technologies has side-effects on layout optimization, related to effects such as inter- connect delay, noise and crosstalk, signal integrity, parasitics effects, and power dissipation, that invalidate the assumptions that form the basis of previous design methodologies and tools. This book is intended to sample the most important, contemporary, and advanced layout opti- mization problems emerging with the advent of very deep submicron technologies in semiconductor processing. We hope that it will stimulate more people to perform research that leads to advances in the design and development of more efficient, effective, and elegant algorithms and design tools. Organization of the Book The book is organized as follows. A multi-stage simulated annealing algorithm that integrates floorplanning and interconnect planning is pre- sented in Chapter 1. To reduce the run time, different interconnect plan- ning approaches are applied in different ranges of temperatures. Chapter 2 introduces a new design methodology - the interconnect-centric design methodology and its centerpiece, interconnect planning, which consists of physical hierarchy generation, floorplanning with interconnect planning, and interconnect architecture planning. Chapter 3 investigates a net-cut minimization based placement tool, Dragon, which integrates the state of the art partitioning and placement techniques.

Clustering is an important technique for discovering relatively dense sub-regions or sub-spaces of a multi-dimension data distribution. Clus- tering has been used in information retrieval for many different purposes, such as query expansion, document grouping, document indexing, and visualization of search results. In this book, we address issues of cluster- ing algorithms, evaluation methodologies, applications, and architectures for information retrieval. The first two chapters discuss clustering algorithms. The chapter from Baeza-Yates et al. describes a clustering method for a general metric space which is a common model of data relevant to information retrieval. The chapter by Guha, Rastogi, and Shim presents a survey as well as detailed discussion of two clustering algorithms: CURE and ROCK for numeric data and categorical data respectively. Evaluation methodologies are addressed in the next two chapters. Ertoz et al. demonstrate the use of text retrieval benchmarks, such as TRECS, to evaluate clustering algorithms. He et al. provide objective measures of clustering quality in their chapter. Applications of clustering methods to information retrieval is ad- dressed in the next four chapters. Chu et al. and Noel et al. explore feature selection using word stems, phrases, and link associations for document clustering and indexing. Wen et al. and Sung et al. discuss applications of clustering to user queries and data cleansing. Finally, we consider the problem of designing architectures for infor- mation retrieval. Crichton, Hughes, and Kelly elaborate on the devel- opment of a scientific data system architecture for information retrieval.

With the rapid growth of bandwidth demand from network users and the advances in optical technologies, optical networks with multiterabits- per-second capacity has received significant interest from both researchers and practitioners. Optical networks deployment raises a number of challenging problems that require innovative solutions, including net- work architectures, scalable and fast network management, resource- efficient routing and wavelength assignment algorithms, QoS support and scheduling algorithms, and switch and router architectures. In this book, we put together some important developments in this exiting area during last several years. Some of the articles are research papers and some are surveys. All articles were reviewed by two reviewers. The paper, "e;On Dynamic Wavelength Assignment in WDM Optical Networks,"e; by Alanyali gives an overview of some issues in the analy- sis and synthesis of dynamic wavelength assignment policies for optical WDM networks and illustrates a new method of analysis. The paper by Ellinas and Bala, "e;Wavelength Assignment Algorithms for WDM Ring Architectures,"e; presents two optimal wavelength assignment algorithms that assign the minimum number of wavelengths between nodes on WDM rings to achieve full mesh connectivity. In the paper, "e;Optimal Placement of Wavelength Converters in WDM Networks for Parallel and Distributed Computing Systems,"e; Jia et al.

In the spectrum of mathematics, graph theory which studies a mathe- matical structure on a set of elements with a binary relation, as a recognized discipline, is a relative newcomer. In recent three decades the exciting and rapidly growing area of the subject abounds with new mathematical devel- opments and significant applications to real-world problems. More and more colleges and universities have made it a required course for the senior or the beginning postgraduate students who are majoring in mathematics, computer science, electronics, scientific management and others. This book provides an introduction to graph theory for these students. The richness of theory and the wideness of applications make it impossi- ble to include all topics in graph theory in a textbook for one semester. All materials presented in this book, however, I believe, are the most classical, fundamental, interesting and important. The method we deal with the mate- rials is to particularly lay stress on digraphs, regarding undirected graphs as their special cases. My own experience from teaching out of the subject more than ten years at University of Science and Technology of China (USTC) shows that this treatment makes hardly the course di:fficult, but much more accords with the essence and the development trend of the subject.

N etwork-based computing domain unifies all best research efforts presented from single computer systems to networked systems to render overwhelming computational power for several modern day applications. Although this power is expected to grow with respect to time due to tech- nological advancements, application requirements impose a continuous thrust on network utilization and on the resources to deliver supreme quality of service. Strictly speaking, network-based computing dornain has no confined scope and each element offers considerable challenges. Any modern day networked application strongly thrives on efficient data storage and management system, which is essentially a Database System. There have been nurnber of books-to-date in this domain that discuss fundamental principles of designing a database systern. Research in this dornain is now far matured and rnany researchers are venturing in this dornain continuously due to a wide variety of challenges posed. In this book, our dornain of interest is in exposing the underlying key challenges in designing algorithms to handle unpredictable requests that arrive at a Distributed Database System(DDBS) and evaluating their performance. These requests are otherwise called as on-line requests arriving at a system to process. Transactions in an on-line Banking service, Airline Reservation systern, Video-on-Demand systern, etc, are few examples of on-line requests.

Besides established infrastructurebased wireless networks (cellular, WLAN, sat- lite) ad-hoc wireless networks emerge as a new platform for distributed applications and for personal communication in scenarios where deploying infrastructure is not feasible.

After using several materials of other textbooks and research books, we found that many texts treat the distributed systems with separation of concepts, algorithm design and network programming and it is very difficult for students to map the concepts of distributed systems to the algorithm design, prototyping and implementations.

Besides established infrastructurebased wireless networks (cellular, WLAN, sat- lite) ad-hoc wireless networks emerge as a new platform for distributed applications and for personal communication in scenarios where deploying infrastructure is not feasible.

Telephone companies have initiated extensive modeling and planning efforts to expand and upgrade their transmission facilities, which are, for most national telecommunication networks, divided in three main levels (see Balakrishnan et al.

The advent of very large scale integrated circuit technology has enabled the construction of very complex and large interconnection networks. Graph theory is a fundamental and powerful mathematical tool for de signing and analyzing interconnection networks, since the topological struc ture of an interconnection network is a graph.

The consecutive-k system was first studied around 1980, and it soon became a very popular subject. The system is simple enough to become a prototype for demonstrat ing various ideas related to reliability. For example, the interesting concept of component importance works best with the consecutive-k system.

Combinatorics and Matrix Theory have a symbiotic, or mutually beneficial, relationship. where an attempt was made to give a broad picture of the use of combinatorial ideas in matrix theory and the use of matrix theory in proving theorems which, at least on the surface, are combinatorial in nature.

Contains various developments in switching networks and applications, including classic topics, such as nonblocking and Benes conjecture, and different directions, such as optical switching networks and applications in VLSI designs. This title provides the advances for researchers in computer networks and applied mathematics.

The consecutive-k system was first studied around 1980, and it soon became a very popular subject. The system is simple enough to become a prototype for demonstrat ing various ideas related to reliability. For example, the interesting concept of component importance works best with the consecutive-k system.

Combinatorics and Matrix Theory have a symbiotic, or mutually beneficial, relationship. where an attempt was made to give a broad picture of the use of combinatorial ideas in matrix theory and the use of matrix theory in proving theorems which, at least on the surface, are combinatorial in nature.

N etwork-based computing domain unifies all best research efforts presented from single computer systems to networked systems to render overwhelming computational power for several modern day applications. Any modern day networked application strongly thrives on efficient data storage and management system, which is essentially a Database System.

Chapter 1 pro vides a brief survey on the networking architectures of optical trans- XVll xvm MULTICHANNEL OPTICAL NETWORKS port networks, optical access networks and optical premise networks.

In the spectrum of mathematics, graph theory which studies a mathe matical structure on a set of elements with a binary relation, as a recognized discipline, is a relative newcomer. The richness of theory and the wideness of applications make it impossi ble to include all topics in graph theory in a textbook for one semester.

Telephone companies have initiated extensive modeling and planning efforts to expand and upgrade their transmission facilities, which are, for most national telecommunication networks, divided in three main levels (see Balakrishnan et al.