A frequent subject in forums, academia and industry is the evolution of the Internet in terms of routing. Basically, the scalability in the Default Free Zone related to (1) the growing rate of the routing tables and (2) the convergence of the routing system, are pointed by routing experts as the main concerns of the current mechanism. Several approaches have emerged, but they normally require a mapping system to translate from identifiers to locators (IP). We contribute with this discussion by introducing our XOR-based Flat Routing mechanism for Internet-like topologies. Essentially, the proposed mechanism routes directly on top of flat ASes identifiers, eliminating the need for mapping systems. In this work we propose a mechanism for building the routing tables over the XOR-based scenario in conjunction with a reachability service developed using the concepts of Landmark and Bloom filters. The proposal is evaluated using our developed emulation tool under five different Internet-like topologies ranging from 512 to 8192 nodes.

Flat routing is subject of many proposals found in the literature. One challenging task in this scenario is the flat identity space management since aggregation is not possible. The Landmark-based Flat Routing (LFR) proposal is an alternative to address the routing tables' growth in a scenario which (1) organizes the network in regions represented by landmarks and (2) adopts an XOR-based routing mechanism inside regions. In this work, Bloom filters are introduced to LFR as an effective mechanism to deal with two main aspects of flat routing. The first one is to advertise aggregated reachability information between landmark regions and the second combines the intra-region XOR-based mechanism with Bloom filters in order to reduce unnecessary walk at the flat binary space, opening up many possibilities for the Flat Routing scenario, especially for stretch reduction and scalability for disseminating ``reachability'' information. The evaluations were done in a regular mesh network topology with 256 nodes and the results show the advantages of having Bloom filters in both scenarios, highlighting the effectiveness of such mechanism for flat identifiers aggregation.

Generalized multi-protocol label switching (GMPLS) is an important enabling technology for the "All-IP" vision, but raises new challenges in multilayer network operations. The main goal of this paper is to investigate the policy-based management (PBM) approach applied to GMPLS network functionality, covering both packet switching and circuit switching technologies. We propose PBM mechanisms and policies to facilitate and improve the collaboration between the management plane and the GMPLS control plane, for the purpose of efficient GMPLS TE and service provisioning. We point out guidelines for policy information modeling, and we propose to extend the PCIM/e with policy event, to explicitly model the triggering of policy rules. This will increase automation and operational efficiency. We also recommend that the relationships between policy and management information and related support information must be explicitly captured and represented in a coherent modeling approach. The topic of GMPLS TE and service provisioning should be put on the IETF agenda.