NetMod: a design tool for large-scale heterogeneous campus networks

Bachmann, David W.; Segal, Mark E.; Srinivasan, Mandyam M.; Teorey, Toby J.

doi:10.1109/49.64900

Cited by 18 publications

(6 citation statements)

References 16 publications

(12 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The Distributed Directories Modeling Tool (DirMod) is a HyperCard extension of the Network Modeling tool (NetMod) [BSST90]. The purpose of DirMod is to model and provide the user with the performance statistics of refresh strategies over various types of networks.…”

Section: Extensions For Distributed Directoriesmentioning

confidence: 99%

Analysis of X.500 Distributed Directory Refresh Strategies

Bachmann

Klinge²,

Bauer

et al. 1991

Journal of Database Management

View full text Add to dashboard Cite

Distributed database directory refresh strategies, commonly recommended for the X.500 standard, are defined and analytically modeled for variations on push/pull and total/differential under idealistic asynchronous control conditions. The models are implemented in a HyperCard-based tool called DirMod (for "directory model"). Experimental test results show important elapsed time performance tradeoff among the different strategies, and live test data contribute to the verification of the models.

show abstract

Section: Extensions For Distributed Directoriesmentioning

confidence: 99%

Analysis of X.500 Distributed Directory Refresh Strategies

Bachmann

Klinge²,

Bauer

et al. 1991

Journal of Database Management

View full text Add to dashboard Cite

show abstract

“…The geographic locations of the nodes provide meaning to a user who is looking at the layout; therefore, it is important to retain this location information when drawing the graph. Other types of graphs that must be displayed by a visualization system are those that have been created by a user using a graph editor [2]. In this case, the user has put nodes in positions that either have meaning initially or gain importance after the graph has been viewed.…”

Section: Introductionmentioning

confidence: 99%

Algorithms for Cluster Busting in Anchored Graph Drawing

Lyons¹,

Meijer²,

Rappaport³

1998

JGAA

View full text Add to dashboard Cite

Given a graph G and a drawing or layout of G, it is sometimes desirable to alter or adjust the layout. The challenging aspect of designing layout adjustment algorithms is to maintain a user's mental picture of the original layout. We present a new approach to layout adjustment called cluster busting in anchored graph drawing. We then give two algorithms as examples of this approach. The goals of cluster busting in anchored graph drawing are to more evenly distribute the nodes of the graph in a drawing window while maintaining the user's mental picture of the original drawing. We present simple and efficient iterative heuristics to accomplish these goals. We formally define some measures of distribution and similarity and give empirical results based on these measures to quantify our methods. The theoretical analysis of our heuristics presents a formidable challenge, thus justifying our empirical analysis.

show abstract

“…In the literature, we find the description of different toolkits dedicated to this field, as TOPNET [1], which is based on PROT net, a class of Petri nets; NETMOD [2], which is based on simple analytical models; BONeS [3], which is based on block-oriented modeling paradigm. On the other hand, our approach is based on queueing networks.…”

Section: Introductionmentioning

confidence: 99%