Scale-free information systems networks
Name
71125038-MIT.pdf
Description
Full printable version
Size
6.14 MB
Format
Adobe PDF
Checksum (MD5)
c6d3aaf969e55c2115adbc091b3bb1dc
Author(s)
Ang, Wee Horng
Advisor(s)
Stuart Madnick.
Date Issued
2006
Publisher
Massachusetts Institute of Technology
Abstract
Many real, complex networks have been shown to be scale-free. Scale-free in networks mean that their degree distribution is independent of the network size, have short path lengths and are highly clustered. We identify the qualities of scale-free networks, and discuss the mathematical derivations and numerically simulated outcomes of various deterministic scale-free models. Information Systems networks are a set of individual Information Systems that exchange meaningful data among themselves. However, for various reasons, they do not naturally grow in a scale-free manner. In this topic, we will specifically examine a technique proposed by MITRE that allows information to be exchanged in an efficient manner between Information System nodes. With this technique, we will show that a scale-free Information System Network is sound in theory and practice, state the characteristics of such networks and demonstrate how such a system can be constructed.
Description
Thesis (S.M.)--Massachusetts Institute of Technology, Engineering Systems Division, 2006.
Includes bibliographical references (leaves 77-79).
Subjects
Engineering Systems Division.
MIT Department
Massachusetts Institute of Technology. Engineering Systems Division
Terms of Use
M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.
Persistent DSpace Link
