An algorithm for drawing general undirected graphs
Information Processing Letters
Representations of graphs on a cylinder
SIAM Journal on Discrete Mathematics
Drawing graphs nicely using simulated annealing
ACM Transactions on Graphics (TOG)
Distributed Feature Composition: A Virtual Architecture for Telecommunications Services
IEEE Transactions on Software Engineering
A Technique for Drawing Directed Graphs
IEEE Transactions on Software Engineering
Constraint-Based Spring-Model Algorithm for Graph Layout
GD '95 Proceedings of the Symposium on Graph Drawing
Upward Drawings on Planes and Speres
GD '95 Proceedings of the Symposium on Graph Drawing
Grid Intersection and Box Intersection Graphs on Surfaces (Extended Abstract)
GD '95 Proceedings of the Symposium on Graph Drawing
COMAIDE: Information Visualization using Cooperative 3D Diagram Layout
GD '95 Proceedings of the Symposium on Graph Drawing
GD '96 Proceedings of the Symposium on Graph Drawing
Integration of Declarative Approaches
GD '96 Proceedings of the Symposium on Graph Drawing
Grappa: A GRAPh PAckage in Java
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
Improved Force-Directed Layouts
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
Online Hierarchical Graph Drawing
GD '01 Revised Papers from the 9th International Symposium on Graph Drawing
GD '01 Revised Papers from the 9th International Symposium on Graph Drawing
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Drawing Telecommunication Networks
GD '94 Proceedings of the DIMACS International Workshop on Graph Drawing
A Simple and Unified Method for Drawing Graphs: Magnetic-Spring Algorithm
GD '94 Proceedings of the DIMACS International Workshop on Graph Drawing
A Fast Adaptive Layout Algorithm for Undirected Graphs
GD '94 Proceedings of the DIMACS International Workshop on Graph Drawing
Area-Efficient Static and Incremental Graph Drawings
ESA '97 Proceedings of the 5th Annual European Symposium on Algorithms
Drawing graphs with non-uniform vertices
Proceedings of the Working Conference on Advanced Visual Interfaces
An open architecture for next-generation telecommunication services
ACM Transactions on Internet Technology (TOIT)
| Hi-index | 0.01 |
An active research area in telecommunications concerns how to specify and control the addition of new services, such as call waiting or instant messaging, into existing software. One approach is to rely on a component-based architecture such as Distributed Feature Composition (DFC), by which a new service can be specified as a composition of primitive features over time. Formally, a communication episode is represented by a dynamic graph of software feature boxes, called a usage. This serves as the fundamental model for how services are invoked and how they interact with other services.This paper, after providing some background on DFC, discusses a technique for visualizing the usages which arise through DFC specifications. With the visualization, users can monitor and validate service protocols and feature interactions in real time or through playback logs. The principal display component uses a novel variation of force-directed layouts for undirected graphs. The resulting graphical interface has become a principal tool for developers building services using DFC.