Electrical computers and digital processing systems: multicomput – Computer network managing
Reexamination Certificate
2004-12-29
2009-10-27
Caldwell, Andrew (Department: 2442)
Electrical computers and digital processing systems: multicomput
Computer network managing
Reexamination Certificate
active
07610367
ABSTRACT:
A method is capable of being used for determining an ability of a network to spread information or physical traffic. The network includes network nodes interconnected by links. The method comprises steps of: mapping a topology of the network, computing values of link strength between the nodes, computing an eigenvector centrality index for all nodes, and based on examining the eigenvector centrality of all neighboring nodes of each node, identifying nodes which are local maxima of the eigenvector centrality index as centre nodes, grouping the nodes into regions surrounding each identified centre node, assigning a role to each node from its position in a region, as centre nodes, region member nodes, border nodes, bridge nodes, dangler nodes, and measuring the susceptibility of the network to spreading, based on the number of regions, their size, and how they are connected.
REFERENCES:
patent: 6437804 (2002-08-01), Ibe et al.
patent: 2005/0033742 (2005-02-01), Kamvar et al.
Boyd; “Numerical Methods for Bayesian Ratings from Paired Comparisons”; 1991; Journal of Quantitative Anthropology 3; Kluwer Academic Publishers; pp. 117-133.
Canright et al; “Roles in Networks”; Jul. 17, 2004; Science of Computer Programming 53; pp. 195-214.
Satorras et al; “Epidemic Spreading in Scale-Free Networks”; Apr. 2, 2001; Physical Review Letters, vol. 86, No. 14; The American Physical Society; pp. 3200-3203.
Borgatti, Stephen; “Centrality and Network Flow”; Feb. 17, 2002; Sunbelt International Social Networks Conference; pp. 55-71.
Cheng, Yizong; “Mean Shift, Mode Seeking, and Clustering”; IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 17, No. 8; Aug. 1995; pp. 790-799.
Girvan et al; “Community Structure in Social and Biological Networks”; Proceedings of the National Academy of Sciences, vol. 99, No. 12; Jun. 11, 2002; pp. 7821-7826.
Hanneman, Robert; “Introduction to Social Network Methods”; 2001; Self-published; Retrieved via http://facultydirectory.ucr.edu/cgi-bin/pub/public—individual.pl?faculty=311 on Mar. 24, 2008; pp. 1-149.
Hader et al; “Efficient density clustering using basin spanning trees”; 2003; Proceedings of 26 Annual Conference of the Gesellschaft für Klassifikation (GfKI); pp. 39-48 (1-9 extracted pub.).
Canright George
Engo-Monsen Kenth
Weltzien Asmund
Caldwell Andrew
Nickerson Jeffrey
Schneck Thomas
Schneck & Schneck
Telenor ASA
LandOfFree
Method for managing networks by analyzing connectivity does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method for managing networks by analyzing connectivity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method for managing networks by analyzing connectivity will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4104200