28 research outputs found
Investigating the Potential of the Inter-IXP Multigraph for the Provisioning of Guaranteed End-to-End Services
In this work, we propose utilizing the rich connectivity between IXPs and
ISPs for inter-domain path stitching, supervised by centralized QoS brokers. In
this context, we highlight a novel abstraction of the Internet topology, i.e.,
the inter-IXP multigraph composed of IXPs and paths crossing the domains of
their shared member ISPs. This can potentially serve as a dense Internet-wide
substrate for provisioning guaranteed end-to-end (e2e) services with high path
diversity and global IPv4 address space reach. We thus map the IXP multigraph,
evaluate its potential, and introduce a rich algorithmic framework for path
stitching on such graph structures.Comment: Proceedings of ACM SIGMETRICS '15, pages 429-430, 1/1/2015. arXiv
admin note: text overlap with arXiv:1611.0264
Intra-Domain Pathlet Routing
Internal routing inside an ISP network is the foundation for lots of services
that generate revenue from the ISP's customers. A fine-grained control of paths
taken by network traffic once it enters the ISP's network is therefore a
crucial means to achieve a top-quality offer and, equally important, to enforce
SLAs. Many widespread network technologies and approaches (most notably, MPLS)
offer limited (e.g., with RSVP-TE), tricky (e.g., with OSPF metrics), or no
control on internal routing paths. On the other hand, recent advances in the
research community are a good starting point to address this shortcoming, but
miss elements that would enable their applicability in an ISP's network.
We extend pathlet routing by introducing a new control plane for internal
routing that has the following qualities: it is designed to operate in the
internal network of an ISP; it enables fine-grained management of network paths
with suitable configuration primitives; it is scalable because routing changes
are only propagated to the network portion that is affected by the changes; it
supports independent configuration of specific network portions without the
need to know the configuration of the whole network; it is robust thanks to the
adoption of multipath routing; it supports the enforcement of QoS levels; it is
independent of the specific data plane used in the ISP's network; it can be
incrementally deployed and it can nicely coexist with other control planes.
Besides formally introducing the algorithms and messages of our control plane,
we propose an experimental validation in the simulation framework OMNeT++ that
we use to assess the effectiveness and scalability of our approach.Comment: 13 figures, 1 tabl
Implementation of Blockchain-Assisted Source Routing for Traffic Management in Software-Defined Networks
The control and infrastructure layers are split into Software-Defined Networks (SDNs). With the control and infrastructure planes split, new network applications may be developed with more simplicity and greater independence. On the other hand, the disadvantages of SDN create a slew of questions. In large-scale networks, such as Wide Area Networks (WANs) covering huge areas, more propagation delays substantially contribute to network convergence time. In addition, traditional SDN restricts network design flexibility due to the influence of controller location on network performance in large-scale networks. SDN-based source routing (SR) has emerged as a viable solution to the issues above, where the packet header field is used to specify a packet's route. This study presents an SR-based End-to-End (E2E) traffic management framework called SoRBlock. In SoRBlock, inter-domain routing uses blockchain technology, while intra-domain routing relies on the SR technique in SDNs. The simulation results show that the proposed SR-based SoRBlock framework outperforms the traditional hierarchical routing approach, HRA, in SDN networks by lowering path setup time (PST) and the number of controller messages. While the same (i.e., identical origin and target) service requests were used for all runs in the simulations, the proposed SoRBlock architecture presents almost three times less total PST between 45ms and 65ms than the HRA method between 130ms and 200ms due to the HRA approach's increased node-controller and controller-controller latencies. On the other hand, SoRBlock shows two times less PST ([75ms – 90ms]) than HRA ([150ms – 175ms]) when different service requests (i.e., different origin and target) were used. Concerning Controller Messages Processed (CMP), the HRA deals nearly 50% more controller messages between 7 and 15 than the SoRBlock between 3 and 10 when the number of domains varies, while the CMP in the SoRBlock scheme ([10 - 17]) approaches that in the HRA framework ([15 - 20]) regarding the ratio while the count of nodes rises in domains
Design of a Scalable Path Service for the Internet
Despite the world-changing success of the Internet, shortcomings in its routing and forwarding system have become increasingly apparent. One symptom is an escalating tension between users and providers over the control of routing and forwarding of packets: providers understandably want to control use of their infrastructure, and users understandably want paths with sufficient quality-of-service (QoS) to improve the performance of their applications. As a result, users resort to various “hacks” such as sending traffic through intermediate end-systems, and the providers fight back with mechanisms to inspect and block such traffic.
To enable users and providers to jointly control routing and forwarding policies, recent research has considered various architectural approaches in which provider- level route determination occurs separately from forwarding. With this separation, provider-level path computation and selection can be provided as a centralized service: users (or their applications) send path queries to a path service to obtain provider- level paths that meet their application-specific QoS requirements. At the same time, providers can control the use of their infrastructure by dictating how packets are forwarded across their network. The separation of routing and forwarding offers many advantages, but also brings a number of challenges such as scalability. In particular, the path service must respond to path queries in a timely manner and periodically collect topology information containing load-dependent (i.e., performance) routing information.
We present a new design for a path service that makes use of expensive pre- computations, parallel on-demand computations on performance information, and caching of recently computed paths to achieve scalability. We demonstrate that, us- ing commodity hardware with a modest amount of resources, the path service can respond to path queries with acceptable latency under a realistic workload. The ser- vice can scale to arbitrarily large topologies through parallelism. Finally, we describe how to utilize the path service in the current Internet with existing Internet applica- tions
Scale-free networks and scalable interdomain routing
Trabalho apresentado no âmbito do Mestrado em Engenharia Informática, como requisito parcial para obtenção do grau de Mestre em Engenharia InformáticaThe exponential growth of the Internet, due to its tremendous success, has brought to light some limitations of the current design at the routing and arquitectural level, such as scalability and convergence as well as the lack of support for traffic engineering, mobility, route differentiation and security.
Some of these issues arise from the design of the current architecture, while others are
caused by the interdomain routing scheme - BGP. Since it would be quite difficult to add support for the aforementioned issues, both in the interdomain architecture and in the in the routing scheme, various researchers believe that a solution can only achieved via a new architecture and (possibly) a new routing scheme.
A new routing strategy has emerged from the studies regarding large-scale networks, which
is suitable for a special type of large-scale networks which characteristics are independent of network size: scale-free networks. Using the greedy routing strategy a node routes a message to a given destination using only the information regarding the destination and its neighbours,
choosing the one which is closest to the destination. This routing strategy ensures the following remarkable properties: routing state in the order of the number of neighbours; no requirements on nodes to exchange messages in order to perform routing; chosen paths are the shortest ones.
This dissertation aims at: studying the aforementioned problems, studying the Internet configuration as a scale-free network, and defining a preliminary path onto the definition of a greedy routing scheme for interdomain routing
UCIP: User controlled internet protocol
Internet protocols have developed significantly over the last 50 years but have reached a point where the further improvements in performance, resilience, security and privacy cannot be achieved by simple incremental changes. This paper proposes a new IP protocol that puts the user's end host at the centre of major algorithmic decisions. It consist of three new mechanisms: a private source routing establishment protocol that allows inter-domain traffic routes to be decided by the user and kept private from the providers whilst allowing for anonymous connections where two node can communicate without knowing the identity/address of the other end point; a mechanism to control reception of packets that mitigates denial-of-service attacks and a new directory system that puts the end user at the core of the decisions enabling anycast and mobility with a pub-sub mechanism with fine grain capabilities for describe resources. These changes allow end nodes to have a much tighter control of how they send and receive their traffic and provide a paradigm shift for the Internet ecosystem
Private Routing in the Internet
Despite the breakthroughs in end-to-end encryption that keeps the content of Internet data confidential, the fact that packet headers contain source and IP addresses remains a strong violation of users' privacy. This paper describes a routing mechanism that allows for connections to be established where no provider, including the final destination, knows who is connecting to whom. The system makes use of inter-domain source routing with public key cryptography to establish connections and simple private symmetric encryption in the data path that allows for fully stateless packet transmission. We discuss the potential implications of real deployment of our routing mechanism in the Internet