50 results on '"Di Battista, Giuseppe"'
Search Results
2. Long-lasting sequences of BGP updates
- Author
-
Ariemma, Lorenzo, Dell’Orco, Alessandro, Liotta, Simone, Candela, Massimo, and Di Battista, Giuseppe
- Published
- 2023
- Full Text
- View/download PDF
3. How to Morph a Tree on a Small Grid
- Author
-
Barrera-Cruz, Fidel, Borrazzo, Manuel, Da Lozzo, Giordano, Di Battista, Giuseppe, Frati, Fabrizio, Patrignani, Maurizio, and Roselli, Vincenzo
- Published
- 2022
- Full Text
- View/download PDF
4. Extending upward planar graph drawings
- Author
-
Da Lozzo, Giordano, Di Battista, Giuseppe, and Frati, Fabrizio
- Published
- 2020
- Full Text
- View/download PDF
5. Multi-view routing visualization for the identification of BGP issues
- Author
-
Candela, Massimo, Di Battista, Giuseppe, and Marzialetti, Luca
- Published
- 2020
- Full Text
- View/download PDF
6. Simple k-planar graphs are simple (k + 1)-quasiplanar
- Author
-
Angelini, Patrizio, Bekos, Michael A., Brandenburg, Franz J., Da Lozzo, Giordano, Di Battista, Giuseppe, Didimo, Walter, Hoffmann, Michael, Liotta, Giuseppe, Montecchiani, Fabrizio, Rutter, Ignaz, and Tóth, Csaba D.
- Published
- 2020
- Full Text
- View/download PDF
7. Upward Planar Morphs
- Author
-
Da Lozzo, Giordano, Di Battista, Giuseppe, Frati, Fabrizio, Patrignani, Maurizio, and Roselli, Vincenzo
- Published
- 2020
- Full Text
- View/download PDF
8. Treebar Maps: Schematic Representation of Networks at Scale
- Author
-
Di Battista, Giuseppe, Grosso, Fabrizio, Montorselli, Silvia, and Patrignani, Maurizio
- Subjects
Computer Science - Data Structures and Algorithms - Abstract
Many data sets, crucial for today's applications, consist essentially of enormous networks, containing millions or even billions of elements. Having the possibility of visualizing such networks is of paramount importance. We propose an algorithmic framework and a visual metaphor, dubbed treebar map, to provide schematic representations of huge networks. Our goal is to convey the main features of the network's inner structure in a straightforward, two-dimensional, one-page drawing. This drawing effectively captures the essential quantitative information about the network's main components. Our experiments show that we are able to create such representations in a few hundreds of seconds. We demonstrate the metaphor's efficacy through visual examination of extensive graphs, highlighting how their diverse structures are instantly comprehensible via their representations., Comment: 27 pages, 32 figures, 1 table
- Published
- 2023
9. Quantum Graph Drawing
- Author
-
Caroppo, Susanna, Da Lozzo, Giordano, and Di Battista, Giuseppe
- Subjects
FOS: Computer and information sciences ,Computer Science - Data Structures and Algorithms ,Data Structures and Algorithms (cs.DS) - Abstract
In this paper, we initiate the study of quantum algorithms in the Graph Drawing research area. We focus on two foundational drawing standards: 2-level drawings and book layouts. Concerning $2$-level drawings, we consider the problems of obtaining drawings with the minimum number of crossings, $k$-planar drawings, quasi-planar drawings, and the problem of removing the minimum number of edges to obtain a $2$-level planar graph. Concerning book layouts, we consider the problems of obtaining $1$-page book layouts with the minimum number of crossings, book embeddings with the minimum number of pages, and the problem of removing the minimum number of edges to obtain an outerplanar graph. We explore both the quantum circuit and the quantum annealing models of computation. In the quantum circuit model, we provide an algorithmic framework based on Grover's quantum search, which allows us to obtain, at least, a quadratic speedup on the best classical exact algorithms for all the considered problems. In the quantum annealing model, we perform experiments on the quantum processing unit provided by D-Wave, focusing on the classical $2$-level crossing minimization problem, demonstrating that quantum annealing is competitive with respect to classical algorithms., 37 pages, 32 figures, 2 tables
- Published
- 2023
10. Small Universal Point Sets for k-Outerplanar Graphs
- Author
-
Angelini, Patrizio, Bruckdorfer, Till, Di Battista, Giuseppe, Kaufmann, Michael, Mchedlidze, Tamara, Roselli, Vincenzo, and Squarcella, Claudio
- Published
- 2018
- Full Text
- View/download PDF
11. Computational complexity of traffic hijacking under BGP and S-BGP
- Author
-
Chiesa, Marco, Di Battista, Giuseppe, Erlebach, Thomas, and Patrignani, Maurizio
- Published
- 2015
- Full Text
- View/download PDF
12. The importance of being proper: (In clustered-level planarity and T-level planarity)
- Author
-
Angelini, Patrizio, Da Lozzo, Giordano, Di Battista, Giuseppe, Frati, Fabrizio, and Roselli, Vincenzo
- Published
- 2015
- Full Text
- View/download PDF
13. Relaxing the constraints of clustered planarity
- Author
-
Angelini, Patrizio, Da Lozzo, Giordano, Di Battista, Giuseppe, Frati, Fabrizio, Patrignani, Maurizio, and Roselli, Vincenzo
- Published
- 2015
- Full Text
- View/download PDF
14. Strip Planarity Testing for Embedded Planar Graphs
- Author
-
Angelini, Patrizio, Da Lozzo, Giordano, Di Battista, Giuseppe, and Frati, Fabrizio
- Published
- 2017
- Full Text
- View/download PDF
15. Unit-length Rectangular Drawings of Graphs
- Author
-
Alegria, Carlos, Da Lozzo, Giordano, Di Battista, Giuseppe, Frati, Fabrizio, Grosso, Fabrizio, and Patrignani, Maurizio
- Subjects
Computational Geometry (cs.CG) ,FOS: Computer and information sciences ,Computer Science - Data Structures and Algorithms ,Computer Science - Computational Geometry ,Data Structures and Algorithms (cs.DS) - Abstract
A rectangular drawing of a planar graph $G$ is a planar drawing of $G$ in which vertices are mapped to grid points, edges are mapped to horizontal and vertical straight-line segments, and faces are drawn as rectangles. Sometimes this latter constraint is relaxed for the outer face. In this paper, we study rectangular drawings in which the edges have unit length. We show a complexity dichotomy for the problem of deciding the existence of a unit-length rectangular drawing, depending on whether the outer face must also be drawn as a rectangle or not. Specifically, we prove that the problem is NP-complete for biconnected graphs when the drawing of the outer face is not required to be a rectangle, even if the sought drawing must respect a given planar embedding, whereas it is polynomial-time solvable, both in the fixed and the variable embedding settings, if the outer face is required to be drawn as a rectangle., Appears in the Proceedings of the 30th International Symposium on Graph Drawing and Network Visualization (GD 2022)
- Published
- 2022
16. Planar Straight-line Realizations of 2-Trees with Prescribed Edge Lengths
- Author
-
Alegría, Carlos, Borrazzo, Manuel, Da Lozzo, Giordano, Di Battista, Giuseppe, Frati, Fabrizio, Patrignani, Maurizio, Helen C. Purchase and Ignaz Rutter, ALEGRIA GALICIA, Carlo, Borrazzo, Manuel, DA LOZZO, Giordano, DI BATTISTA, Giuseppe, Frati, Fabrizio, and Patrignani, Maurizio
- Subjects
FOS: Computer and information sciences ,Computer Science - Data Structures and Algorithms ,Data Structures and Algorithms (cs.DS) ,Computer Science::Computational Geometry - Abstract
We study a classic problem introduced thirty years ago by Eades and Wormald. Let $G=(V,E,\lambda)$ be a weighted planar graph, where $\lambda: E \rightarrow \mathbb{R}^+$ is a length function. The Fixed Edge-Length Planar Realization problem (FEPR for short) asks whether there exists a planar straight-line realization of $G$, i.e., a planar straight-line drawing of $G$ where the Euclidean length of each edge $e \in E$ is $\lambda(e)$. Cabello, Demaine, and Rote showed that the FEPR problem is NP-hard, even when $\lambda$ assigns the same value to all the edges and the graph is triconnected. Since the existence of large triconnected minors is crucial to the known NP-hardness proofs, in this paper we investigate the computational complexity of the FEPR problem for weighted $2$-trees, which are $K_4$-minor free. We show its NP-hardness, even when $\lambda$ assigns to the edges only up to four distinct lengths. Conversely, we show that the FEPR problem is linear-time solvable when $\lambda$ assigns to the edges up to two distinct lengths, or when the input has a prescribed embedding. Furthermore, we consider the FEPR problem for weighted maximal outerplanar graphs and prove it to be linear-time solvable if their dual tree is a path, and cubic-time solvable if their dual tree is a caterpillar. Finally, we prove that the FEPR problem for weighted $2$-trees is slice-wise polynomial in the length of the longest path., Comment: Appears in the Proceedings of the 29th International Symposium on Graph Drawing and Network Visualization (GD 2021)
- Published
- 2021
17. From Tutte to Floater and Gotsman: On the Resolution of Planar Straight-Line Drawings and Morphs
- Author
-
Di Battista, Giuseppe, Frati, Fabrizio, Helen Purchase and Ignaz Rutter, Di Battista, G., and Frati, F.
- Subjects
MathematicsofComputing_DISCRETEMATHEMATICS - Abstract
The algorithm of Tutte for constructing convex planar straight-line drawings and the algorithm of Floater and Gotsman for constructing planar straight-line morphs are among the most popular graph drawing algorithms. Surprisingly, little is known about the resolution of the drawings they produce. In this paper, focusing on maximal plane graphs, we prove tight bounds on the resolution of the planar straight-line drawings produced by Floater’s algorithm, which is a broad generalization of Tutte’s algorithm. Further, we use such a result to prove a lower bound on the resolution of the drawings of maximal plane graphs produced by Floater and Gotsman’s morphing algorithm. Finally, we show that such an algorithm might produce drawings with exponentially-small resolution, even when morphing drawings with polynomial resolution.
- Published
- 2021
18. A framework for multi‐provider virtual private networks in software‐defined federated networks.
- Author
-
Mostafaei, Habib, Lospoto, Gabriele, Di Lallo, Roberto, Rimondini, Massimo, and Di Battista, Giuseppe
- Subjects
SOFTWARE-defined networking ,VIRTUAL private networks ,CLOUD computing - Abstract
Summary: Federated networks represent a remunerable operational way, allowing federated partners to increase their incomes through a sharing resource process. They have been primarily used in the context of cloud computing; nowadays, they are also used to provide connectivity services, like virtual private networks. However, providing such a service by using standard technologies in federated networks requires a nonnegligible effort from different points of view (e.g., configuration effort). In this paper, we propose an software‐defined network (SDN)–based framework aiming at overcoming limitations in currently adopted best practices to issue virtual private networks in federated networks. Relying on the SDN architecture, we propose a method allowing federated providers to quickly and easily create federated networks, reducing unneeded costs (e.g., new hardware), and a way for customers to fast‐access federated services, without any explicit actions from providers. We evaluate our framework by using SDNetkit. We focus on analyzing the impact of our implementation on both control and data plane, in terms of number of control messages exchanged in the network and size of the forwarding tables, respectively. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
19. Advances on Testing C-Planarity of Embedded Flat Clustered Graphs.
- Author
-
Chimani, Markus, Di Battista, Giuseppe, Frati, Fabrizio, and Klein, Karsten
- Subjects
- *
GRAPH algorithms - Abstract
In this paper, we show a polynomial-time algorithm for testing c -planarity of embedded flat clustered graphs with at most two vertices per cluster on each face. Our result is based on a reduction to the planar set of spanning trees in topological multigraphs (pssttm) problem, which is defined as follows. Given a (non-planar) topological multigraph A with k connected components A 1 , ... , A k , do spanning trees of A 1 , ... , A k exist such that no two edges in any two spanning trees cross? Kratochvíl et al. [SIAM Journal on Discrete Mathematics, 4(2): 223–244, 1991] proved that the problem is NP-hard even if k = 1 ; on the other hand, Di Battista and Frati presented a linear-time algorithm to solve the pssttm problem for the case in which A is a 1 -planar topological multigraph [Journal of Graph Algorithms and Applications, 13(3): 349–378, 2009]. For any embedded flat clustered graph C , an instance A of the pssttm problem can be constructed in polynomial time such that C is c -planar if and only if A admits a solution. We show that, if C has at most two vertices per cluster on each face, then it can be tested in polynomial time whether the corresponding instance A of the pssttm problem is positive or negative. Our strategy for solving the pssttm problem on A is to repeatedly perform a sequence of tests, which might let us conclude that A is a negative instance, and simplifications, which might let us simplify A by removing or contracting some edges. Most of these tests and simplifications are performed "locally", by looking at the crossings involving a single edge or face of a connected component A i of A ; however, some tests and simplifications have to consider certain global structures in A , which we call α -donuts. If no test concludes that A is a negative instance of the pssttm problem, then the simplifications eventually transform A into an equivalent 1 -planar topological multigraph on which we can apply the cited linear-time algorithm by Di Battista and Frati. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
20. Windrose Planarity: Embedding Graphs with Direction-Constrained Edges.
- Author
-
ANGELINI, PATRIZIO, DA LOZZO, GIORDANO, DI BATTISTA, GIUSEPPE, DI DONATO, VALENTINO, KINDERMANN, PHILIPP, ROTE, GÜNTER, and RUTTER, IGNAZ
- Subjects
PLANAR graphs ,ALGORITHMS ,NP-hard problems ,EDGES (Geometry) - Abstract
Given a planar graph G and a partition of the neighbors of each vertex v in four sets v↗, v↖, v↙, and v↘, the problem Windrose Planarity asks to decide whether G admits a windrose-planar drawing, that is, a planar drawing in which (i) each neighbor u ∈ v↗v is above and to the right of v, (ii) each neighbor u ∈ v↖ is above and to the left of v, (iii) each neighbor u ∈ v↙ is below and to the left of v, (iv) each neighbor u ∈ v↘ is below and to the right of v, and (v) edges are represented by curves that are monotone with respect to each axis. By exploiting both the horizontal and the vertical relationship among vertices, windrose-planar drawings allow us to simultaneously visualize two partial orders defined by means of the edges of the graph. Although the problem is NP-hard in the general case, we give a polynomial-time algorithm for testing whether there exists a windrose-planar drawing that respects a given combinatorial embedding. This algorithm is based on a characterization of the plane triangulations admitting a windrose-planar drawing. Furthermore, for any embedded graph with n vertices that has a windrose-planar drawing, we can construct one with at most one bend per edge and with at most 2n-5 bends in total, which lies on the 3n × 3n grid. The latter result contrasts with the fact that straight-line windrose-planar drawings may require exponential area. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
21. Simultaneous Orthogonal Planarity.
- Author
-
Angelini, Patrizio, Chaplick, Steven, Cornelsen, Sabine, Da Lozzo, Giordano, Di Battista, Giuseppe, Eades, Peter, Kindermann, Philipp, Kratochvíl, Jan, Lipp, Fabian, and Rutter, Ignaz
- Published
- 2016
- Full Text
- View/download PDF
22. Beyond Level Planarity.
- Author
-
Angelini, Patrizio, Da Lozzo, Giordano, Di Battista, Giuseppe, Frati, Fabrizio, Patrignani, Maurizio, and Rutter, Ignaz
- Published
- 2016
- Full Text
- View/download PDF
23. Computing NodeTrix Representations of Clustered Graphs.
- Author
-
Da Lozzo, Giordano, Di Battista, Giuseppe, Frati, Fabrizio, and Patrignani, Maurizio
- Published
- 2016
- Full Text
- View/download PDF
24. Supporting end-to-end connectivity in federated networks using SDN.
- Author
-
di Lallo, Roberto, Lospoto, Gabriele, Rimondini, Massimo, and Di Battista, Giuseppe
- Published
- 2016
- Full Text
- View/download PDF
25. How to handle ARP in a software-defined network.
- Author
-
di Lallo, Roberto, Lospoto, Gabriele, Rimondini, Massimo, and Di Battista, Giuseppe
- Published
- 2016
- Full Text
- View/download PDF
26. On the Relationship Between k-Planar and k-Quasi-Planar Graphs.
- Author
-
Angelini, Patrizio, Bekos, Michael A., Brandenburg, Franz J., Da Lozzo, Giordano, Di Battista, Giuseppe, Didimo, Walter, Liotta, Giuseppe, Montecchiani, Fabrizio, and Rutter, Ignaz
- Abstract
A graph is
k -planar ]> ]> ( k ≥ 1 ) ]> if it can be drawn in the plane such that no edge is crossed ]> ]> k + 1 ]> times or more. A graph isk -quasi-planar ]> ]> ( k ≥ 2 ) ]> if it can be drawn in the plane with nok pairwise crossing edges. The families ofk -planar andk -quasi-planar graphs have been widely studied in the literature, and several bounds have been proven on their edge density. Nonetheless, only trivial results are known about the relationship between these two graph families. In this paper we prove that, for ]> ]> k ≥ 3 ]> , everyk -planar graph is ]> ]> ( k + 1 ) ]> -quasi-planar. [ABSTRACT FROM AUTHOR]- Published
- 2017
- Full Text
- View/download PDF
27. Is it really worth to peer at IXPs? A comparative study.
- Author
-
Di Bartolomeo, Marco, Di Battista, Giuseppe, di Lallo, Roberto, and Squarcella, Claudio
- Published
- 2015
- Full Text
- View/download PDF
28. Intersection-Link Representations of Graphs.
- Author
-
Angelini, Patrizio, Da Lozzo, Giordano, Di Battista, Giuseppe, Frati, Fabrizio, Patrignani, Maurizio, and Rutter, Ignaz
- Published
- 2015
- Full Text
- View/download PDF
29. Testing Planarity of Partially Embedded Graphs.
- Author
-
ANGELINI, PATRIZIO, DI BATTISTA, GIUSEPPE, FRATI, FABRIZIO, JELÍNEK, VÍT, KRATOCHVÍL, JAN, PATRIGNANI, MAURIZIO, and RUTTER, IGNAZ
- Subjects
GRAPH theory ,EMBEDDINGS (Mathematics) ,SUBGRAPHS ,POLYNOMIALS ,ALGORITHMS ,COMBINATORICS - Abstract
We study the following problem: given a planar graph G and a planar drawing (embedding) of a subgraph of G, can such a drawing be extended to a planar drawing of the entire graph G This problem fits the paradigm of extending a partial solution for a problem to a complete one, which has been studied before in many different settings. Unlike many cases, in which the presence of a partial solution in the input makes an otherwise easy problem hard, we show that the planarity question remains polynomial-time solvable. Our algorithm is based on several combinatorial lemmas, which show that the planarity of partially embedded graphs exhibits the 'TONCAS' behavior "the obvious necessary conditions for planarity are also sufficient." These conditions are expressed in terms of the interplay between (1) the rotation system and containment relationships between cycles and (2) the decomposition of a graph into its connected, biconnected, and triconnected components. This implies that no dynamic programming is needed for a decision algorithm and that the elements of the decomposition can be processed independently. Further, by equipping the components of the decomposition with suitable data structures and by carefully splitting the problem into simpler subproblems, we make our algorithm run in linear time. Finally, we consider several generalizations of the problem, such as minimizing the number of edges of the partial embedding that need to be rerouted to extend it, and argue that they are NP-hard. We also apply our algorithm to the simultaneous graph drawing problem SIMULTANEOUS EMBEDDING WITH FIXED EDGES (SEFE). There we obtain a linear-time algorithm for the case that one of the input graphs or the common graph has a fixed planar embedding. [ABSTRACT FROM AUTHOR]
- Published
- 2015
- Full Text
- View/download PDF
30. On iBGP Routing Policies.
- Author
-
Vissicchio, Stefano, Cittadini, Luca, and Di Battista, Giuseppe
- Subjects
INTERNET service providers ,BGP (Computer network protocol) ,ROUTING (Computer network management) ,TRAFFIC engineering ,IP networks - Abstract
Internet service providers (ISPs) run the internal Border Gateway Protocol (iBGP) to distribute interdomain routing information among their BGP routers. Previous research consistently assumed that iBGP is always configured as a mere dispatcher of interdomain routes. However, router configuration languages offer operators the flexibility of fine-tuning iBGP. In this paper, we study the impact of deploying routing policies in iBGP. First, we devise a provably correct inference technique to pinpoint iBGP policies from public BGP data. We show that the majority of large transit providers and many small transit providers do apply policies in iBGP. Then, we discuss how iBGP policies can help achieve traffic engineering and routing objectives. We prove that, unfortunately, the presence of iBGP policies exacerbates the iBGP convergence problem and invalidates fundamental assumptions for previous results, affecting their applicability. Hence, we propose provably correct configuration guidelines to achieve traffic engineering goals with iBGP policies, without sacrificing BGP convergence guarantees. Finally, for the cases in which our guidelines are not applicable, we propose a novel technique to verify the correctness of an iBGP configuration with iBGP policies. We implement a prototype tool and show the feasibility of offline analyses of arbitrary policies on both real-world and in vitro configurations. [ABSTRACT FROM PUBLISHER]
- Published
- 2015
- Full Text
- View/download PDF
31. On the Relationship Between Map Graphs and Clique Planar Graphs.
- Author
-
Angelini, Patrizio, Da Lozzo, Giordano, Di Battista, Giuseppe, Frati, Fabrizio, Patrignani, Maurizio, and Rutter, Ignaz
- Published
- 2015
- Full Text
- View/download PDF
32. Megalos: A Scalable Architecture for the Virtualization of Large Network Scenarios †.
- Author
-
Scazzariello, Mariano, Ariemma, Lorenzo, Di Battista, Giuseppe, and Patrignani, Maurizio
- Subjects
INTERNET traffic ,VIRTUAL reality ,VIRTUAL networks ,SCALABILITY ,STEVEDORES ,LOCAL area networks - Abstract
We introduce an open-source, scalable, and distributed architecture, called Megalos, that supports the implementation of virtual network scenarios consisting of virtual devices (VDs) where each VD may have several Layer 2 interfaces assigned to virtual LANs. We rely on Docker containers to realize vendor-independent VDs and we leverage Kubernetes for the management of the nodes of a distributed cluster. Our architecture does not require platform-specific configurations and supports a seamless interconnection between the virtual environment and the physical one. Also, it guarantees the segregation of each virtual LAN traffic from the traffic of other LANs, from the cluster traffic, and from Internet traffic. Further, a packet is only sent to the cluster node containing the recipient VD. We produce several example applications where we emulate large network scenarios, with thousands of VDs and LANs. Finally, we experimentally show the scalability potential of Megalos by measuring the overhead of the distributed environment and of its signaling protocols. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
33. Beyond level planarity: Cyclic, torus, and simultaneous level planarity.
- Author
-
Angelini, Patrizio, Da Lozzo, Giordano, Di Battista, Giuseppe, Frati, Fabrizio, Patrignani, Maurizio, and Rutter, Ignaz
- Subjects
- *
TORUS , *COMPUTATIONAL complexity , *TORIC varieties - Abstract
In this paper we settle the computational complexity of two open problems related to the extension of the notion of level planarity to surfaces different from the plane. Namely, we show that the problems of testing the existence of a level embedding of a level graph on the surface of the rolling cylinder or on the surface of the torus, respectively known by the name of Cyclic Level Planarity and Torus Level Planarity , are polynomial-time solvable. Moreover, we show a complexity dichotomy for testing the Simultaneous Level Planarity of a set of level graphs, with respect to both the number of level graphs and the number of levels. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
34. Computing NodeTrix representations of clustered graphs
- Author
-
Giuseppe Di Battista, Giordano Da Lozzo, Fabrizio Frati, Maurizio Patrignani, Yifan Hu, Martin Nöllenburg, DA LOZZO, Giordano, DI BATTISTA, Giuseppe, Frati, Fabrizio, Patrignani, Maurizio, Da Lozzo, Giordano, and Di Battista, Giuseppe
- Subjects
Computational Geometry (cs.CG) ,FOS: Computer and information sciences ,Convex hull ,General Computer Science ,Computer science ,0102 computer and information sciences ,02 engineering and technology ,JavaScript library ,01 natural sciences ,Theoretical Computer Science ,Combinatorics ,Matrix (mathematics) ,Graph drawing ,Computer Science - Data Structures and Algorithms ,0202 electrical engineering, electronic engineering, information engineering ,Data Structures and Algorithms (cs.DS) ,Adjacency matrix ,Discrete mathematics ,Computer Science (all) ,020207 software engineering ,Planarity testing ,Computer Science Applications ,Computational Theory and Mathematics ,010201 computation theory & mathematics ,Adjacency list ,Computer Science - Computational Geometry ,020201 artificial intelligence & image processing ,Geometry and Topology ,MathematicsofComputing_DISCRETEMATHEMATICS - Abstract
NodeTrix representations are a popular way to visualize clustered graphs; they represent clusters as adjacency matrices and inter-cluster edges as curves connecting the matrix boundaries. We study the complexity of constructing NodeTrix representations focusing on planarity testing problems, and we show several NP-completeness results and some polynomial-time algorithms. Building on such algorithms we develop a JavaScript library for NodeTrix representations aimed at reducing the crossings between edges incident to the same matrix., Appears in the Proceedings of the 24th International Symposium on Graph Drawing and Network Visualization (GD 2016)
- Published
- 2016
35. Windrose Planarity: Embedding Graphs with Direction-Constrained Edges
- Author
-
Philipp Kindermann, Valentino Di Donato, Patrizio Angelini, Giordano Da Lozzo, Günter Rote, Giuseppe Di Battista, Ignaz Rutter, Angelini, Patrizio, Da Lozzo, Giordano, Di Battista, Giuseppe, Di Donato, Valentino, Kindermann, Philipp, Rote, Günter, Rutter, Ignaz, Robert Kraughgamer, DA LOZZO, Giordano, DI BATTISTA, Giuseppe, DI DONATO, Valentino, and Rote, Giinter
- Subjects
Computational Geometry (cs.CG) ,FOS: Computer and information sciences ,0102 computer and information sciences ,02 engineering and technology ,Computer Science::Computational Geometry ,01 natural sciences ,Combinatorics ,Planar graph ,symbols.namesake ,Mathematics (miscellaneous) ,Graph drawing ,0202 electrical engineering, electronic engineering, information engineering ,Mathematics (all) ,Partition (number theory) ,Mathematics ,Combinatorial embedding ,Planarity testing ,Vertex (geometry) ,Exponential function ,Algorithm ,Monotone polygon ,010201 computation theory & mathematics ,symbols ,Embedding ,Computer Science - Computational Geometry ,020201 artificial intelligence & image processing ,Upward planarity ,Software - Abstract
Given a planar graph $G$ and a partition of the neighbors of each vertex $v$ in four sets $UR(v)$, $UL(v)$, $DL(v)$, and $DR(v)$, the problem Windrose Planarity asks to decide whether $G$ admits a windrose-planar drawing, that is, a planar drawing in which (i) each neighbor $u \in UR(v)$ is above and to the right of $v$, (ii) each neighbor $u \in UL(v)$ is above and to the left of $v$, (iii) each neighbor $u \in DL(v)$ is below and to the left of $v$, (iv) each neighbor $u \in DR(v)$ is below and to the right of $v$, and (v) edges are represented by curves that are monotone with respect to each axis. By exploiting both the horizontal and the vertical relationship among vertices, windrose-planar drawings allow to simultaneously visualize two partial orders defined by means of the edges of the graph. Although the problem is NP-hard in the general case, we give a polynomial-time algorithm for testing whether there exists a windrose-planar drawing that respects a given combinatorial embedding. This algorithm is based on a characterization of the plane triangulations admitting a windrose-planar drawing. Furthermore, for any embedded graph with $n$ vertices that has a windrose-planar drawing, we can construct one with at most one bend per edge and with at most $2n-5$ bends in total, which lies on the $3n \times 3n$ grid. The latter result contrasts with the fact that straight-line windrose-planar drawings may require exponential area., Appeared in Proceedings of the 27th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2016)
- Published
- 2015
36. Unit-length Rectangular Drawings of Graphs
- Author
-
Maurizio Patrignani, Giuseppe DI BATTISTA, Fabrizio Frati, Carlos Alegría, Fabrizio Grosso, Giordano Da Lozzo, Patrizio Angelini and Reinhard von Hanxleden, Alegría, Carlo, Da Lozzo, Giordano, Di Battista, Giuseppe, Frati, Fabrizio, Grosso, Fabrizio, and Patrignani, Maurizio
- Published
- 2023
37. On Turn-Regular Orthogonal Representations
- Author
-
Ignaz Rutter, Karsten Klein, Carla Binucci, Maurizio Patrignani, Giuseppe Di Battista, Michael A. Bekos, Martin Gronemann, Walter Didimo, Bekos, Michael A., Binucci, Carla, DI BATTISTA, Giuseppe, Didimo, Walter, Gronemann, Martin, Klein, Karsten, Patrignani, Maurizio, Rutter, Ignaz, David Auber and Pavel Valtr, Bekos, M. A., Binucci, C., Di Battista, G, Didimo, W., Gronemann, M., Klein, K., Patrignani, M., and Rutter, I.
- Subjects
Vertex (graph theory) ,Computational Geometry (cs.CG) ,FOS: Computer and information sciences ,050101 languages & linguistics ,Class (set theory) ,General Computer Science ,Computer science ,Compaction ,Orthogonal drawings ,02 engineering and technology ,Orthogonal drawing ,Theoretical Computer Science ,Combinatorics ,symbols.namesake ,Turn-regularity ,Turn (geometry) ,0202 electrical engineering, electronic engineering, information engineering ,0501 psychology and cognitive sciences ,Representation (mathematics) ,Time complexity ,05 social sciences ,Contrast (statistics) ,Planar graph ,Computer Science Applications ,Computational Theory and Mathematics ,Face (geometry) ,symbols ,Computer Science - Computational Geometry ,020201 artificial intelligence & image processing ,Geometry and Topology ,MathematicsofComputing_DISCRETEMATHEMATICS - Abstract
An interesting class of orthogonal representations consists of the so-called turn-regular ones, i.e., those that do not contain any pair of reflex corners that "point to each other" inside a face. For such a representation H it is possible to compute in linear time a minimum-area drawing, i.e., a drawing of minimum area over all possible assignments of vertex and bend coordinates of H. In contrast, finding a minimum-area drawing of H is NP-hard if H is non-turn-regular. This scenario naturally motivates the study of which graphs admit turn-regular orthogonal representations. In this paper we identify notable classes of biconnected planar graphs that always admit such representations, which can be computed in linear time. We also describe a linear-time testing algorithm for trees and provide a polynomial-time algorithm that tests whether a biconnected plane graph with "small" faces has a turn-regular orthogonal representation without bends., Comment: Appears in the Proceedings of the 28th International Symposium on Graph Drawing and Network Visualization (GD 2020)
- Published
- 2022
38. Schematic Representation of Large Biconnected Graphs
- Author
-
Giuseppe Di Battista, Maurizio Patrignani, Marco Tais, Fabrizio Frati, DI BATTISTA, Giuseppe, Frati, Fabrizio, Patrignani, Maurizio, and Tais, Marco
- Subjects
FOS: Computer and information sciences ,Discrete mathematics ,General Computer Science ,Computer science ,Computation ,Structure (category theory) ,Schematic ,Boundary (topology) ,Biconnected graph ,Graph ,Computer Science Applications ,Theoretical Computer Science ,Computational Theory and Mathematics ,Component (UML) ,Computer Science - Data Structures and Algorithms ,Data Structures and Algorithms (cs.DS) ,Geometry and Topology ,Representation (mathematics) - Abstract
Suppose that a biconnected graph is given, consisting of a large component plus several other smaller components, each separated from the main component by a separation pair. We investigate the existence and the computation time of schematic representations of the structure of such a graph where the main component is drawn as a disk, the vertices that take part in separation pairs are points on the boundary of the disk, and the small components are placed outside the disk and are represented as non-intersecting lunes connecting their separation pairs. We consider several drawing conventions for such schematic representations, according to different ways to account for the size of the small components. We map the problem of testing for the existence of such representations to the one of testing for the existence of suitably constrained $1$-page book-embeddings and propose several polynomial-time algorithms., Appeared in the Proceedings of the 28th International Symposium on Graph Drawing and Network Visualization (GD 2020)
- Published
- 2021
39. Schematic Representation of Biconnected Graphs
- Author
-
Marco Tais, Fabrizio Frati, Giuseppe Di Battista, Maurizio Patrignani, David Auber and Pavel Valtr, Di Battista, Giuseppe, Frati, Fabrizio, Patrignani, Maurizio, and Tais, Marco
- Subjects
Discrete mathematics ,050101 languages & linguistics ,Computer science ,Computation ,05 social sciences ,Structure (category theory) ,Boundary (topology) ,Schematic ,02 engineering and technology ,Biconnected graph ,Graph ,Component (UML) ,0202 electrical engineering, electronic engineering, information engineering ,020201 artificial intelligence & image processing ,0501 psychology and cognitive sciences ,Representation (mathematics) - Abstract
Suppose that a biconnected graph is given, consisting of a large component plus several other smaller components, each separated from the main component by a separation pair. We investigate the existence and the computation time of schematic representations of the structure of such a graph where the main component is drawn as a disk, the vertices that take part in separation pairs are points on the boundary of the disk, and the small components are placed outside the disk and are represented as non-intersecting lunes connecting their separation pairs. We consider several drawing conventions for such schematic representations, according to different ways to account for the size of the small components. We map the problem of testing for the existence of such representations to the one of testing for the existence of suitably constrained 1-page book-embeddings and propose several polynomial-time and pseudo-polynomial-time algorithms.
- Published
- 2020
40. Intersection-link representations of graphs
- Author
-
Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati, Giordano Da Lozzo, Ignaz Rutter, Maurizio Patrignani, Angelini, Patrizio, DA LOZZO, Giordano, DI BATTISTA, Giuseppe, Frati, Fabrizio, Patrignani, Maurizio, Rutter, Ignaz, Emilio Di Giacomo, Anna Lubiw, Algorithms, Geometry and Applications, and Applied Geometric Algorithms
- Subjects
Computational Geometry (cs.CG) ,FOS: Computer and information sciences ,Vertex (graph theory) ,Theoretical computer science ,Discrete Mathematics (cs.DM) ,General Computer Science ,Computer science ,0102 computer and information sciences ,02 engineering and technology ,01 natural sciences ,Theoretical Computer Science ,Combinatorics ,symbols.namesake ,Indifference graph ,Chordal graph ,Computer Science::Discrete Mathematics ,Computer Science - Data Structures and Algorithms ,0202 electrical engineering, electronic engineering, information engineering ,Data Structures and Algorithms (cs.DS) ,Geometry and topology ,Mathematics ,Computer Science (all) ,Computer Science Applications1707 Computer Vision and Pattern Recognition ,16. Peace & justice ,Hamiltonian path ,Planarity testing ,Computer Science Applications ,Computational Theory and Mathematics ,010201 computation theory & mathematics ,Hybrid-drawings, non-planar graphs, clustered graphs ,symbols ,Computer Science - Computational Geometry ,020201 artificial intelligence & image processing ,Geometry and Topology ,Computational problem ,Computer Science - Discrete Mathematics ,Computational number theory - Abstract
We consider drawings of graphs that contain dense subgraphs. We introduce intersection-link representations for such graphs, in which each vertex $u$ is represented by a geometric object $R(u)$ and in which each edge $(u,v)$ is represented by the intersection between $R(u)$ and $R(v)$ if it belongs to a dense subgraph or by a curve connecting the boundaries of $R(u)$ and $R(v)$ otherwise. We study a notion of planarity, called Clique Planarity, for intersection-link representations of graphs in which the dense subgraphs are cliques., 15 pages, 8 figures, extended version of 'Intersection-Link Representations of Graphs' (23rd International Symposium on Graph Drawing, 2015)
- Published
- 2017
41. Upstream Visibility: A Multi-View Routing Visualization
- Author
-
Giuseppe Di Battista, Massimo Candela, Luca Marzialetti, Karsten Klein, Yi-Na Li, Marzialetti, Luca, Candela, Massimo, and DI BATTISTA, Giuseppe
- Subjects
business.industry ,Computer science ,Data visualization ,Network monitoring ,Visibility (geometry) ,BGP ,020207 software engineering ,02 engineering and technology ,Service provider ,Visualization ,0202 electrical engineering, electronic engineering, information engineering ,Interdomain routing ,The Internet ,Routing (electronic design automation) ,Heuristics ,business ,Computer network - Abstract
The Internet is constantly evolving and changing over time. Outages, attacks, upgrades, censorships, and policy changes modify the routing very frequently everywhere in the world. To give the possibility to the Internet Service Providers and to the network operators of monitoring such an evolving scenario, many organizations collect the routing changes and give free access to them. We propose, prototype, and evaluate a visual interface, called Upstream Visibility, to display such data. It is based on three views: (1) a global view that, based on stacked area charts, gives the high level trend of the visibility of an IP prefix; (2) a local view allows the user to check the effects over time of the visibility of an IP prefix on specific locations of the network; and (3) a traditional graph animation view. Also, we propose heuristics for producing such type of drawings, evaluating their effectiveness and performance against scenarios describing well-known Internet incidents.
- Published
- 2018
42. Radian: Visual Exploration of Traceroutes
- Author
-
Giuseppe Di Battista, Marco Di Bartolomeo, Massimo Candela, Claudio Squarcella, Candela, Massimo, Di Bartolomeo, Marco, Di Battista, Giuseppe, and Squarcella, Claudio
- Subjects
Ping (video games) ,Computer science ,graph drawing ,network probes ,network visualization ,Traceroute ,Real-time computing ,Graph Drawing ,02 engineering and technology ,0202 electrical engineering, electronic engineering, information engineering ,Network probe ,Routing ,Internet ,Data visualization ,business.industry ,Network visualization ,ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS ,IP network ,020206 networking & telecommunications ,020207 software engineering ,Probe ,Computer Graphics and Computer-Aided Design ,Signal Processing ,traceroute ,Performance evaluation ,Tool ,The Internet ,Computer Vision and Pattern Recognition ,Radian ,business ,Software - Abstract
Several projects deploy probes in the Internet. Probes are systems that continuously perform traceroutes and other networking measurements (e.g., ping) towards selected targets. Measurements can be stored and analyzed to gain knowledge on several aspects of the Internet, but making sense of such data requires suitable methods and tools for exploration and visualization. We present Radian, a tool that allows to visualize traceroute paths at different levels of detail and to animate their evolution during a selected time interval. We also describe extensive tests of the tool using traceroutes performed by RIPE Atlas Internet probes.
- Published
- 2018
43. How to Morph Planar Graph Drawings
- Author
-
Timothy M. Chan, Anna Lubiw, Fidel Barrera-Cruz, Fabrizio Frati, Giuseppe Di Battista, Giordano Da Lozzo, Bryan T. Wilkinson, Patrizio Angelini, Vincenzo Roselli, Penny Haxell, Soroush Alamdari, Maurizio Patrignani, Sahil Singla, Alamdari, Soroush, Angelini, Patrizio, Barrera Cruz, Fidel, Chan, Timothy M., DA LOZZO, Giordano, DI BATTISTA, Giuseppe, Frati, Fabrizio, Haxell, Penny, Lubiw, Anna, Patrignani, Maurizio, Roselli, Vincenzo, Singla, Sahil, and Wilkinson, Bryan T.
- Subjects
Computational Geometry (cs.CG) ,FOS: Computer and information sciences ,Vertex (graph theory) ,General Computer Science ,Planar straight-line graph ,General Mathematics ,68R10 ,Constant speed ,INTERPOLATION ,0102 computer and information sciences ,02 engineering and technology ,Computer Science::Computational Geometry ,01 natural sciences ,Combinatorics ,symbols.namesake ,Continuous transformation ,Planar ,0202 electrical engineering, electronic engineering, information engineering ,ComputingMethodologies_COMPUTERGRAPHICS ,Mathematics ,Discrete mathematics ,TRIANGULATIONS ,transformation ,Planarity testing ,planar graphs ,Planar graph ,010201 computation theory & mathematics ,Exponential number ,symbols ,Computer Science - Computational Geometry ,020201 artificial intelligence & image processing ,morph ,MathematicsofComputing_DISCRETEMATHEMATICS - Abstract
Given an $n$-vertex graph and two straight-line planar drawings of the graph that have the same faces and the same outer face, we show that there is a morph (i.e., a continuous transformation) between the two drawings that preserves straight-line planarity and consists of $O(n)$ steps, which we prove is optimal in the worst case. Each step is a unidirectional linear morph, which means that every vertex moves at constant speed along a straight line, and the lines are parallel although the vertex speeds may differ. Thus we provide an efficient version of Cairns' 1944 proof of the existence of straight-line planarity-preserving morphs for triangulated graphs, which required an exponential number of steps., Comment: 31 pages, 18 figures
- Published
- 2017
44. Supporting end-to-end connectivity in federated networks using SDN
- Author
-
Massimo Rimondini, Roberto di Lallo, Gabriele Lospoto, Giuseppe Di Battista, Sema Oktug Badonnel, Mehmet Ulema, Cicek Cavdar, Lisandro Zambenedetti Granville, Carlos Raniery P. dos Santos, DI LALLO, Roberto, Lospoto, Gabriele, Rimondini, Massimo, and DI BATTISTA, Giuseppe
- Subjects
Information Systems and Management ,Exploit ,Computer science ,business.industry ,Distributed computing ,020207 software engineering ,Cloud computing ,0102 computer and information sciences ,02 engineering and technology ,01 natural sciences ,Shared resource ,Computer Networks and Communication ,End-to-end principle ,Customer-premises equipment ,010201 computation theory & mathematics ,Network address ,Scalability ,0202 electrical engineering, electronic engineering, information engineering ,Resource management ,business ,Computer network - Abstract
Federated networking is a promising approach to resource sharing that supports cost-effective services involving multiple parties. Research in this field largely focused on architectures and cost models, making limited progress on the technological side. On the other hand, the widely adopted Software-Defined Networking (SDN) model found its most successful application in data centers, exhibiting very little penetration in other scenarios. We leverage the unexplored potential of SDN on the edge of a network to introduce an approach that supports end-to-end connectivity among different federated partners. Our approach is based on simple Network Address and Port Translation (NAPT), making it applicable in standard IP networks. It is also very flexible, because it exploits SDN, and scalable, because address translations are performed on Customer Premises Equipment, where SDN is being progressively supported by device vendors. We define various alternative NAPT strategies and evaluate their effectiveness with simulations as well as emulated scenarios.
- Published
- 2016
45. How to handle ARP in a software-defined network
- Author
-
Giuseppe Di Battista, Massimo Rimondini, Roberto di Lallo, Gabriele Lospoto, Filip De Turck, Joon-Myung Kang, Hyunseung Choo, DI LALLO, Roberto, Lospoto, Gabriele, Rimondini, Massimo, and DI BATTISTA, Giuseppe
- Subjects
Proxy ARP ,Computer science ,business.industry ,Network packet ,Distributed computing ,IP forwarding ,Packet forwarding ,Networking hardware ,Computer Networks and Communication ,Hardware and Architecture ,ARP spoofing ,Address Resolution Protocol ,business ,Software-defined networking ,Computer network - Abstract
The Address Resolution Protocol (ARP) enables communication between IP-speaking nodes in a local network by reconstructing the hardware (MAC) address associated with the IP address of an interface. This is not needed in a Software-Defined Network (SDN), because each device can forward packets without the need to learn this association. We tackle the interoperability problem arising between standard network devices (end systems, routers), that rely on ARP, and SDN datapaths, that do not handle ARP packets natively. In particular, we propose a general approach to handle ARP in a SDN, that is applicable in several network scenarios, is transparent for existing devices, and can coexist with any packet forwarding logic implemented in the controller. Our approach reduces ARP traffic by confining it to the edge of SDNs and requires a minimal set of flow entries in the datapaths. We argument about its applicability and confirm it with experiments performed on SDN datapaths from a range of different vendors.
- Published
- 2016
46. Is it really worth to peer at IXPs? A comparative study
- Author
-
Marco Di Bartolomeo, Roberto di Lallo, Claudio Squarcella, Giuseppe Di Battista, Vasos Vassiliou, DI BARTOLOMEO, Marco, DI BATTISTA, Giuseppe, DI LALLO, Roberto, and Squarcella, Claudio
- Subjects
Computer science ,Internet exchange point ,Internet traffic engineering ,Computer security ,computer.software_genre ,Hop (networking) ,Computer ,Quality of service ,Packet loss ,Internet transit ,Mathematics (all) ,Ecosystem ,business.industry ,ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS ,IP network ,Computer Science Applications1707 Computer Vision and Pattern Recognition ,Probe ,Computer Networks and Communication ,Web and internet service ,Signal Processing ,The Internet ,Performance indicator ,business ,computer ,Software ,Computer network - Abstract
Internet Exchange Points (IXPs) play a crucial role in the Internet ecosystem. However, existing literature fails in quantitatively assessing the advantage for an Internet Service Provider (ISP) to peer at an IXP. We give a contribution to bridge such a gap by collaborating with three medium-sized ISPs in Italy to compare key performance indicators (round-trip delay, hop count, packet loss, and jitter) as measured from several vantage points in presence and absence of IXP peerings. Our findings are that IXP-based paths exhibit better and more stable performance, whereas avoiding IXPs introduces performance deterioration and higher variability. Moreover, our measurements confirm that IXP-based paths tend to preserve the locality of traffic.
- Published
- 2015
47. Computational Complexity of Traffic Hijacking under BGP and S-BGP
- Author
-
Thomas Erlebach, Marco Chiesa, Giuseppe Di Battista, Maurizio Patrignani, Chiesa, Marco, DI BATTISTA, Giuseppe, Erlebach, Thoma, Patrignani, Maurizio, Artur Czumaj, Kurt Mehlhorn, Andrew M. Pitt, Roger Wattenhofer, and Thomas, Erlebach
- Subjects
FOS: Computer and information sciences ,Interdomain routing, Routing stability, Network protocols, BGP, Hijacking attack, Interception attack, Computational complexity ,Computational complexity theory ,General Computer Science ,Computer science ,computer.internet_protocol ,F.2 ,G.2.2 ,Computer security ,computer.software_genre ,Theoretical Computer Science ,Traffic flow (computer networking) ,Computer Science - Networking and Internet Architecture ,C.2.2 ,Computer Science - Computer Science and Game Theory ,Networking and Internet Architecture (cs.NI) ,business.industry ,ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS ,Autonomous system (Internet) ,Border Gateway Protocol ,The Internet ,Routing (electronic design automation) ,business ,Communications protocol ,computer ,Computer Science and Game Theory (cs.GT) - Abstract
Harmful Internet hijacking incidents put in evidence how fragile the Border Gateway Protocol (BGP) is, which is used to exchange routing information between Autonomous Systems (ASes). As proved by recent research contributions, even S-BGP, the secure variant of BGP that is being deployed, is not fully able to blunt traffic attraction attacks. Given a traffic flow between two ASes, we study how difficult it is for a malicious AS to devise a strategy for hijacking or intercepting that flow. We show that this problem marks a sharp difference between BGP and S-BGP. Namely, while it is solvable, under reasonable assumptions, in polynomial time for the type of attacks that are usually performed in BGP, it is NP-hard for S-BGP. Our study has several by-products. E.g., we solve a problem left open in the literature, stating when performing a hijacking in S-BGP is equivalent to performing an interception., Comment: 17 pages with 6 figures
- Published
- 2015
48. Rethinking Virtual Private Networks in the Software-Defined Era
- Author
-
Giuseppe Di Battista, Benedetto Gabriele Vignoli, Gabriele Lospoto, Massimo Rimondini, Remi Badonnel, Jin Xiao, Shingo Ata, Filip De Turck, Voicu Groza, Carlos Raniery P. dos Santos, Lospoto, Gabriele, Rimondini, Massimo, Benedetto Gabriele, Vignoli, and DI BATTISTA, Giuseppe
- Subjects
Virtual routing and forwarding ,Computer science ,business.industry ,computer.internet_protocol ,Distributed computing ,ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS ,Private IP ,Multiprotocol Label Switching ,Troubleshooting ,Label Distribution Protocol ,Networking hardware ,The Internet ,business ,computer ,Computer network ,Private network - Abstract
Multi Protocol Label Switching (MPLS) Virtual Private Networks (VPNs) have seen an unparalleled increasing adoption in the last decade. Although their flexibility as transport technology and their effectiveness for traffic engineering are well recognized, VPNs are difficult to set up and manage, due to the complexity of configurations, to the number of involved protocols, and to the limited control and predictability of network behaviors. On the other hand, Software-Defined Networking (SDN) is a consolidated, yet still emerging paradigm by which the control plane logic of a network device is implemented by an arbitrarily programmed software that runs outside the device itself. We conjugate the effectiveness of traditional VPNs with the programmability of SDN, proposing a novel and improved realization of MPLS VPNs based on SDN. With our approach, provisioning and setup of VPNs are accomplished by using a simple and flexible configuration language. Management and troubleshooting are facilitated because only a minimal set of technologies (notably, just MPLS) is retained. Control and predictability of network behaviors are enhanced by the centralized coordination enforced by the SDN controller. Besides illustrating our proposed approach and specifying the configuration language, we describe a prototype implementation of a controller and the outcome of tests we conducted in several configuration scenarios.
- Published
- 2015
49. On the Relationship between Map Graphs and Clique Planar Graphs
- Author
-
Maurizio Patrignani, Fabrizio Frati, Patrizio Angelini, Giuseppe Di Battista, Giordano Da Lozzo, Ignaz Rutter, Emilio Di Giacomo, Anna Lubiw, Angelini, Patrizio, DA LOZZO, Giordano, DI BATTISTA, Giuseppe, Frati, Fabrizio, Patrignani, Maurizio, and Rutter, Ignaz
- Subjects
Combinatorics ,Block graph ,Indifference graph ,symbols.namesake ,Clique-sum ,Chordal graph ,Independent set ,symbols ,Split graph ,1-planar graph ,Mathematics ,Planar graph - Abstract
A map graph is a contact graph of internally-disjoint regions of the plane, where the contact can be even a point. Namely, each vertex is represented by a simple connected region and two vertices are connected by an edge iff the corresponding regions touch.
- Published
- 2015
50. On iBGP routing policies
- Author
-
Luca Cittadini, Giuseppe Di Battista, Stefano Vissicchio, Vissicchio, Stefano, Cittadini, Luca, and DI BATTISTA, Giuseppe
- Subjects
Router ,Routing protocol ,business.industry ,Computer science ,Computer Networks and Communications ,Distributed computing ,ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS ,IP network ,Computer Science Applications1707 Computer Vision and Pattern Recognition ,routing protocol ,Computer Science Applications ,Traffic engineering ,Server ,Border Gateway Protocol ,Convergence (routing) ,Computer network management ,Routing (electronic design automation) ,Electrical and Electronic Engineering ,business ,Software ,Computer network - Abstract
Internet service providers (ISPs) run the internal Border Gateway Protocol (iBGP) to distribute interdomain routing information among their BGP routers. Previous research consistently assumed that iBGP is always configured as a mere dispatcher of interdomain routes. However, router configuration languages offer operators the flexibility of fine-tuning iBGP. In this paper, we study the impact of deploying routing policies in iBGP. First, we devise a provably correct inference technique to pinpoint iBGP policies from public BGP data. We show that the majority of large transit providers and many small transit providers do apply policies in iBGP. Then, we discuss how iBGP policies can help achieve traffic engineering and routing objectives. We prove that, unfortunately, the presence of iBGP policies exacerbates the iBGP convergence problem and invalidates fundamental assumptions for previous results, affecting their applicability. Hence, we propose provably correct configuration guidelines to achieve traffic engineering goals with iBGP policies, without sacrificing BGP convergence guarantees. Finally, for the cases in which our guidelines are not applicable, we propose a novel technique to verify the correctness of an iBGP configuration with iBGP policies. We implement a prototype tool and show the feasibility of offline analyses of arbitrary policies on both real-world and in vitro configurations.
- Published
- 2015
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.