Visualizing software for telecommunication services

@inproceedings{Gansner2003VisualizingSF,
  title={Visualizing software for telecommunication services},
  author={E. Gansner and J. Mocenigo and S. North},
  booktitle={SoftVis '03},
  year={2003}
}
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… Expand
A Topic-Based Visualization Tool for Distributed Publish/Subscribe Messaging
TLDR
The design and implementation of a visual tool that takes a topic-centric approach to visualizing communications in a publish/subscribe network and proposes a novel combination of a compact visual syntax and interaction techniques to help network administrators and application developers understand and manage topic-specific message flows and their performance on networks. Expand
An open architecture for next-generation telecommunication services
TLDR
This work describes the experience with BoxOS, an IP telecommunication platform that implements the DFC technology for feature composition and presents solutions to problems, common to all efforts in IP telecommunications, of feature distribution, interoperability, and media management. Expand
Computer Networks
TLDR
Massimo Rimondini Roma Tre University 25.0% of the time he is on the stage, he is not on the lecturers' podium. Expand

References

SHOWING 1-10 OF 44 REFERENCES
Distributed Feature Composition: A Virtual Architecture for Telecommunications Services
TLDR
This research presents a new technology for feature specification and composition, based on a virtual architecture offering benefits analogous to those of a pipe-and-filter architecture, which implements an applicable feature and communicates with its neighbors by featureless internal calls. Expand
Grappa: A GRAPh PAckage in Java
TLDR
A new version of Improvise, a multimedia process modeling environment, was written on top of Grappa, an extensible graph drawing package written in Java that provides an application programming interface on topof which Web-based applications that need to visualize information in terms of graphs can be built. Expand
Some Three-Dimensional Graph Drawing Algorithms
TLDR
This thesis examines some technical issues which arise when several common layout algorithms, developed originally for 2D display of graphs, are extended speci cally to 3D display. Expand
Layout Adjustment and the Mental Map
TLDR
This paper discusses some layout adjustment methods and the preservation of the 'mental map' of the diagram, and two kinds of layout adjustments are described, an algorithm for rearranging a diagram to avoid overlapping nodes and a method aimed at changing the focus of interest of the user without destroying the mental map. Expand
Graph Drawing: Dimacs International Workshop, Gd '94 Princeton, New Jersey, USA October 10-12, 1994 : Proceedings
TLDR
Three-dimensional graph drawing 3D layout of reachability graphs of communicating processes and a flow approach to upward drawings of toroidal maps are presented. Expand
Constraint-Based Spring-Model Algorithm for Graph Layout
TLDR
The question of how to develop an algorithm for automatically designing an optimal layout of a given constraint graph is discussed, which must observe certain aesthetic principles, which facilitate the user's interpretation of the graph. Expand
Graphs, they are changing: Dynamic graph drawing for a sequence of graphs
TLDR
A generic algorithm for drawing sequences of graphs that considers all graphs in the sequence (offline) instead of just the previous ones (online) when computing the layout for each graph of the sequence. Expand
Clan-Based Incremental Drawing
TLDR
A method for achieving stable incremental directed graph layout by using clan-based graph decomposition is described, which generates a parse tree for a given directed graph. Expand
Graphs, They Are Changing
TLDR
A generic algorithm for drawing sequences of graphs that considers all graphs in the sequence (offline) instead of just the previous ones (online) when computing the layout for each graph of the sequence. Expand
Constrained Graph Layout
TLDR
This work describes four implementations of layout modules which are based on the constrained graph layout model and shows that they are quite fast and give reasonable layout. Expand
...
1
2
3
4
5
...