文献检索复习资料

一、EI COMPENDEX 数据库检索题目

题目1 检索2000以前的有关“计算机网络”方面的文献，检索要求：

（1）文献类型为会议，文献处理类型为理论，语种为英文。

（2）记下检索到的数量及第一条记录的篇名、作者、刊名、年、卷、期，出版地、出版社等。

（3）并分别将该篇文章三种显示格式复制下来。

答：共检索到31931篇文章

Fault-tolerant analysis of the spiral computer network topology

Mitchell, Tony L. (USAF Acad, Dep of Math Sci, Colorado, Springs, CO, USA); Nilsson, Arne A. Source: Conference Record - International Conference on Communications, v 1, p 363-367, 1989

Fault-tolerant analysis of the spiral computer network topology

Mitchell, Tony L.1; Nilsson, Arne A.1

Source:Conference Record - International Conference on Communications, v 1, p 363-367, 1989; ISSN:05361486; DOI:10.1109/ICC.1989.49722; Conference:IEEE International Conference on Communications - ICC'89, June 11, 1989 - June 14, 1989; Sponsor:IEEE, Communication Soc, New York, NY, USA; IEEE, Boston Section, Boston, MA, USA; Publisher: Publ by IEEE

Author affiliation:

1 USAF Acad, Dep of Math Sci, Colorado, Springs, CO, USA

Abstract:

Results are presented from the analysis of a computer network topology that has the potential to become a standard in future years. The scheme is named the spiral topology because the architecture is built around modules of four computer nodes each, connected by top and bottom spirals. The spiral topology features a simple internal self-routing algorithm that adapts quickly and automatically to failed computer nodes or links. The six most important direct consequences of the network architecture are (1) ease of expansion, (2) fast, on-the-fly self-routing, (3) extremely high tolerance to failed network nodes or links, (4) increased network security, (5) potential for the total elimination of store and forward transmissions due to routing decision delays, and (6) rendering the maximum-path-length issue moot.(4 refs)

Controlled terms: - Data Transmission - Electric

- Decision Delays - Self Routing Algorithm - Spiral Topology - Store and Forward Transmissions

Treatment: Theoretical (THR)

Database: Compendex

Accession number: 1990035210067

Title: Fault-tolerant analysis of the spiral computer

network topology

Authors: Mitchell, Tony L.1; Nilsson, Arne A.1

Author affiliation: 1USAF Acad, Dep of Math Sci, Colorado, Springs,

CO, USA

Corresponding author: Mitchell, Tony L.

Source title: Conference Record - International Conference on

Communications

Abbreviated source title: Conf Rec Int Conf Commun

Volume: 1

Issue date: 1989

Publication year: 1989

Pages: 363-367

Language: English

ISSN: 05361486

CODEN: CICCDV

Document type: Conference article (CA)

Conference name: IEEE International Conference on Communications -

ICC'89

Conference date: June 11, 1989 - June 14, 1989

Conference location: Boston, MA, USA

Conference code: 12791

Sponsor: IEEE, Communication Soc, New York, NY, USA;

IEEE, Boston Section, Boston, MA, USA

Publisher: Publ by IEEE, Piscataway, NJ, United States

Abstract: Results are presented from the analysis of a

computer network topology that has the potential to

become a standard in future years. The scheme is

named the spiral topology because the architecture

is built around modules of four computer nodes

each, connected by top and bottom spirals. The

spiral topology features a simple internal self-routing

algorithm that adapts quickly and automatically to

failed computer nodes or links. The six most

important direct consequences of the network

architecture are (1) ease of expansion, (2) fast,

on-the-fly self-routing, (3) extremely high tolerance to

failed network nodes or links, (4) increased network

security, (5) potential for the total elimination of store