BibTeX
@MISC{_editor’spreface,
author = {},
title = {Editor’s Preface},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
A brief overview of network algorithms In the rapidly growing world of Internet infrastructures, we face many challenging new algorithmic problems. These arise in part because the usual assumptions made in problems of this general type may no longer hold. For example, many typical questions deal with massive data sets and huge networks of prohibitively large sizes so that the (exact) number of nodes or edges is no longer a useful parameter. Instead, only partial information can be obtained. In addition, the network and the data are evolving dynamically. For example, the number of Internet hosts as of July 2005 topped 353 million and the number of Web pages indexed by large search engines now exceeds 8 billion [24]. Driven by the need of current technology and guided by the myriad of existing examples of large scale networks, the area of network algorithms has been rapidly expanding and evolving into a new and rich field. This field straddles both theoretical computer science and networking through the strong interplay between theory and practice. Furthermore, this field is closely connected to a variety of areas including graph theory, game theory, probability, statistics, physics, bioinformatics and the social sciences. Through this connection, a wealth of knowledge and methodology from diverse areas have been brought into play. As a result, new tools and insights have been developing and enriching
