Scale-free information systems networks
Author(s)
Ang, Wee Horng
DownloadFull printable version (6.143Mb)
Other Contributors
Massachusetts Institute of Technology. Engineering Systems Division.
Advisor
Stuart Madnick.
Terms of use
Metadata
Show full item recordAbstract
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).
Date issued
2006Department
Massachusetts Institute of Technology. Engineering Systems DivisionPublisher
Massachusetts Institute of Technology
Keywords
Engineering Systems Division.