Topic
Multihoming
About: Multihoming is a research topic. Over the lifetime, 1259 publications have been published within this topic receiving 20843 citations.
Papers published on a yearly basis
Papers
TL;DR: This foundation work identifies three negative side- effects of reordering introduced by CMT that must be managed before efficient parallel transfer can be achieved and proposes three algorithms which augment and/or modify current SCTP to counter these side-effects.
Abstract: Concurrent multipath transfer (CMT) uses the Stream Control Transmission Protocol's (SCTP) multihoming feature to distribute data across multiple end-to-end paths in a multihomed SCTP association. We identify three negative side-effects of reordering introduced by CMT that must be managed before efficient parallel transfer can be achieved: (1) unnecessary fast retransmissions by a sender; (2) overly conservative congestion window (cwnd) growth at a sender; and (3) increased ack traffic due to fewer delayed acks by a receiver. We propose three algorithms which augment and/or modify current SCTP to counter these side-effects. Presented with several choices as to where a sender should direct retransmissions of lost data, we propose five retransmission policies for CMT. We demonstrate spurious retransmissions in CMT with all five policies and propose changes to CMT to allow the different policies. CMT is evaluated against AppStripe, which is an idealized application that stripes data over multiple paths using multiple SCTP associations. The different CMT retransmission policies are then evaluated with varied constrained receive buffer sizes. In this foundation work, we operate under the strong assumption that the bottleneck queues on the end-to-end paths used in CMT are independent.
708 citations
4 May 1997
TL;DR: A new solution approach is introduced that offers protection against SYN flooding for all hosts connected to the same local area network, independent of their operating system or networking stack implementation, and requires neither special hardware, nor modifications in routers or protected end systems.
Abstract: The paper analyzes a network based denial of service attack for IP (Internet Protocol) based networks. It is popularly called SYN flooding. It works by an attacker sending many TCP (Transmission Control Protocol) connection requests with spoofed source addresses to a victim's machine. Each request causes the targeted host to instantiate data structures out of a limited pool of resources. Once the target host's resources are exhausted, no more incoming TCP connections can be established, thus denying further legitimate access. The paper contributes a detailed analysis of the SYN flooding attack and a discussion of existing and proposed countermeasures. Furthermore, we introduce a new solution approach, explain its design, and evaluate its performance. Our approach offers protection against SYN flooding for all hosts connected to the same local area network, independent of their operating system or networking stack implementation. It is highly portable, configurable, extensible, and requires neither special hardware, nor modifications in routers or protected end systems.
644 citations
1 Jan 2013
TL;DR: Locator/ID Separation Protocol (LISP) as discussed by the authors is a network-layer-based protocol that enables the separation of IP addresses into two new numbering spaces: EndpointIdentifiers (EIDs) and Routing Locators (RLOCs).
Abstract: This document describes a network-layer-based protocol that enables
separation of IP addresses into two new numbering spaces: Endpoint
Identifiers (EIDs) and Routing Locators (RLOCs). No changes are
required to either host protocol stacks or to the "core" of the
Internet infrastructure. The Locator/ID Separation Protocol (LISP) can
be incrementally deployed, without a "flag day", and offers Traffic
Engineering, multihoming, and mobility benefits to early adopters,
even when there are relatively few LISP-capable sites. Design and
development of LISP was largely motivated by the problem statement
produced by the October 2006 IAB Routing and Addressing Workshop. This
document defines an Experimental Protocol for the Internet community.
607 citations
TL;DR: It is shown that a larger backbone prefers a lower quality interconnection than the smaller one, and a "targeted degradation" strategy where the larger backbone lowers the quality of interconnection to its smaller rivals in turn is analyzed.
Abstract: We study the ‘backbone market’ in the Internet. After discussing the structure of the Internet, we use an extension of the Katz-Shapiro network model to analyze the strategies that would be used by dominant backbone. We show that a larger backbone prefers a lower quality interconnection than the smaller one. We then analyze a ‘targeted degradation’ strategy where the larger backbone lowers the quality of interconnection to its smaller rivals in turn. Finally, we show that the qualitative results are robust to the possibility of ‘multihoming’ by clients.
360 citations
Related Topics (5)
Performance Metrics
| Year | Papers |
|---|---|
| 2025 | 12 |
| 2024 | 14 |
| 2023 | 22 |
| 2022 | 43 |
| 2021 | 19 |
| 2020 | 29 |