Policy-based management can guide the behavior of a network or distributed system through high-level declarative directives that are dynamically introduced, checked for consistency, refined, and evaluated, resulting typically in a series of low-level actions. We actually view policies as a means of extending the functionality of management systems dynamically, in conjunction with preexisting ha...

This article discusses a novel approach for realizing traffic engineering in the framework of new-generation multilayer networks based on the GMPLS paradigm. In particular, the proposed traffic engineering system is able to dynamically react to traffic changes while at the same time fulfilling QoS requirements for different classes of service. The proposed solution consists of a hybrid routing ...

Different companies have developed the fieldbuses for more than 20 years. A wide variety of fieldbuses have been set up in the industrial automation system in different time periods under different environment. Therefore, during the development of industrial automation systems and control applications, the developer has to consider the interconnection of heterogeneous equipment over different c...

Abstract. We explore various techniques to incorporate grid-like layout conventions into a force-directed, constraint-based graph layout framework. In doing so we are able to provide high-quality layout—with predominantly axis-aligned edges—that is more flexible than previous gridlike layout methods and which can capture layout conventions in notations such as SBGN (Systems Biology Graphical No...

Genetic Algorithms are widely used in many different optimization problems including layout design. The layout of the shelves play an important role in the total sales metrics for superstores since this affects the customers’ shopping behaviour. This paper employed a genetic algorithm based approach to design shelf layout of superstores. The layout design problem was tackled by using a novel ch...

ÐPreparata and Vuillemin proposed the cube-connected cycles (CCC) and its compact layout in 1981 [17]. We give a new layout of the CCC which uses less than half the area of the Preparata-Vuillemin layout. We also give a lower bound on the layout area of the CCC. The area of the new layout deviates from this bound by a small constant factor. If we aunfoldo the cycles in the CCC, the resulting st...

In this paper, we introduce a layout description and generation model, GBLD, based on the notions and elements of L-systems and context-free grammars. Our layout model is compatible with geometric layout formats, such as GDSII or CIF. However, it is more powerful and more concise. The layouts represented by GBLD are sizeable, parameterised, and can incorporate design rules. GBLD has the potenti...

Spectral methods are naturally suited for dynamic graph layout because, usually, moderate changes of a graph yield moderate changes of the layout. We discuss some general principles for dynamic graph layout and derive a dynamic spectral layout approach for the animation of small-world models. Article Type Communicated by Submitted Revised Regular paper P. Eades and P. Healy January 2006 January...

In this paper we present a set of extension techniques to stabilize interactive dynamic graph layout algorithms. It works with different existing Focus & Context methods. We first deal with the initial placement of newly inserted nodes to mitigate acting forces in the layout algorithm. Then, their influence on the existing layout is gradually increased to create a smooth transition between the ...

Research on the aesthetic layout of trees has been largely concerned with the special case of binary trees with small constant-sized nodes. Yet, without otherwise requiring the power of general graph-layout algorithms, many layout problems involve n-ary trees with variable-sized nodes. This paper addresses the general issue of the aesthetic layout of such trees. Two algorithms are presented for...