Topology discovery service for router-assisted multicast transport

Shapiro, J.K.; Kurose, James F.; Towsley, Don; Zabele, S.

doi:10.1109/opnarc.2002.1019225

Cited by 11 publications

(4 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The same situation arises whenever protocols require that network state be accessed on both the forward and backward path, for example in RSVP and PGM. Various solutions for this problem exist, including a protocol designed specifically for this purpose [22].…”

Section: Enhancing Reliable Multicastmentioning

confidence: 99%

Lightweight network support for scalable end-to-end services

Calvert

Griffioen

Wen

2002

Proceedings of the 2002 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications

View full text Add to dashboard Cite

Some end-to-end network services benefit greatly from network support in terms of utility and scalability. However, when such support is provided through service-specific mechanisms, the proliferation of one-off solutions tend to decrease the robustness of the network over time. Programmable routers, on the other hand, offer generic support for a variety of end-to-end services, but face a different set of challenges with respect to performance, scalability, security, and robustness. Ideally, router-based support for end-to-end services should exhibit the kind of generality, simplicity, scalability, and performance that made the Internet Protocol (IP) so successful. In this paper we present a router-based building block called ephemeral state processing (ESP), which is designed to have IP-like characteristics. ESP allows packets to create and manipulate small amounts of temporary state at routers via short, predefined computations. We discuss the issues involved in the design of such a service and describe three broad classes of problems for which ESP enables robust solutions. We also present performance measurements from a network-processor-based implementation.

show abstract

Section: Enhancing Reliable Multicastmentioning

confidence: 99%

Lightweight network support for scalable end-to-end services

Calvert

Griffioen

Wen

2002

Proceedings of the 2002 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications

View full text Add to dashboard Cite

show abstract

“…Within the context of single rate and multi-rate multicast service provisioning, studies have addressed issues of bandwidth/rate allocation [23, 31, 57, 59, 111, 115-119, 122, 134], routing [27,28,102,121,144] and reliability [30,34,60]. Most of the literature on rate allocation is done via the notion of fairness [23, 31, 111, 115-119, 122, 134], specifically, max-min fairness [14] and proportional fairness [63].…”

Section: Phmentioning

confidence: 99%

Decentralized Resource Allocation Mechanisms in Networks: Realization and Implementation

Stoenescu

Teneketzis

Systems and Control: Foundations &Amp; Applications

View full text Add to dashboard Cite

Summary.We discuss how decentralized network resource allocation problems fit within the context of mechanism design (realization theory and implementation theory), and how mechanism design can provide useful insight into the nature of decentralized network resource allocation problems. The discussion is guided by the unicast problem with routing and Quality of Service (QoS) requirements, and the multi-rate multicast service provisioning problem in networks. For these problems we present decentralized resource allocation mechanisms that achieve the solution of the corresponding centralized resource allocation problem and are informationally efficient. We show how the aforementioned mechanisms can be embedded into the general framework of realization theory, and indicate how realization theory can be used to establish the mechanisms' informational efficiency in certain instances. We also present a conjecture related to implementation in Nash equilibria of the optimal centralized solution of the unicast service provisioning problem. Introduction: Motivation and ChallengesToday's fast paced world requires a vast amount of information exchange in order to operate efficiently. With the various technological advances the number of types of services being offered (e.g. telephone connections, live audio broadcasting, live video broadcasting, library database access, e-mail, world wide web), is constantly increasing. Each type of service imposes different Quality of Service (QoS) requirements (e.g. delay, percentage of data packet loss, jitter) on the delivery methods. To address these needs extensive communication networks were developed in the past century. Many of these networks (such as telephone networks) were initially designed for the delivery of certain types of information and were later adapted to accommodate new information exchange needs.Most of today's networks, called integrated services networks, support the delivery of a variety of services to their users. One of the main challenges in integrated services networks is the design of resource allocation strategies which guarantee the

show abstract

“…Indeed, we assume that the signaling connections between upstream/downstream active matchmakers in the data distribution path are unicast, reliable, and bi-directional, and may be routed differently from the multicast data packets. A protocol such as the Active Topology Discovery Protocol (ATDP) [21] can be used to construct this signaling overlay. Figure 2 summarizes the relationship between the datapublishing/subscribing applications, the data-filtering and forwarding controls, and the active matchmakers:…”

Section: Figure 1 a Pub/sub Network Infrastructurementioning

confidence: 99%

Matchmaker: signaling for dynamic publish/subscribe applications

Kurose

et al.

11th IEEE International Conference on Network Protocols, 2003. Proceedings.

Self Cite

View full text Add to dashboard Cite

The publish/subscribe (pub/sub) paradigm provides content-oriented data dissemination in which communication channels are established between content publishers and content subscribers based on a matching of subscribers interest in the published content provided -a process we refer to as "matchmaking". Once an interest match has been made, content forwarding state can be installed at intermediate nodes (e.g., active routers, application-level relay nodes) on the path between a content provider and an interested subscriber. In dynamic pub/sub applications, where published content and subscriber interest change frequently, the signaling overhead needed to perform matchmaking can be a significant overhead. We first formalize the matchmaking process as an optimization problem, with the goal of minimizing the amount of matchmaking signaling messages. We consider this problem for both shared and per-source multicast data (content) distribution topologies. We characterize the fundamental complexity of the problem, and then describe several efficient solution approaches. The insights gained through our analysis are then embodied in a novel Active Matchmaker Signaling Protocol (AMSP). AMSP dynamically adapts to applications' changing publication and subscription requests through a link-marking approach. We simulate AMSP and two existing broadcastbased approaches for conducting matchmaking, and find that AMSP significantly reduces signaling overhead.

show abstract

Topology discovery service for router-assisted multicast transport

Cited by 11 publications

References 12 publications

Lightweight network support for scalable end-to-end services

Lightweight network support for scalable end-to-end services

Decentralized Resource Allocation Mechanisms in Networks: Realization and Implementation

Matchmaker: signaling for dynamic publish/subscribe applications

Contact Info

Product

Resources

About