A routing scheme for content-based networking

Carzaniga, Antonio; Rutherford, Matthew J.; Wolf, Alexander L.

doi:10.1109/infcom.2004.1356979

Cited by 247 publications

(211 citation statements)

References 15 publications

Supporting

Mentioning

209

Contrasting

Unclassified

Order By: Relevance

“…We compare five architectural approaches: MEDYM and H-MEDYM with the SPMST routing algorithm; two versions of CBF: CBF_MST as in [6], where a single CBF tree is built as the minimum spanning tree across all servers, and CBF_SPT as in [7], where CBF trees are shortest path trees rooted at publication servers; Channelization approach as in [18], using Forgy K-Means algorithm to cluster events into 50 channels, as this algorithm was found to produce the best partition results in the paper.…”

Section: Simulation Methodologymentioning

confidence: 99%

See 1 more Smart Citation

MEDYM: Match-Early with Dynamic Multicast for Content-Based Publish-Subscribe Networks

Cao

Singh

2005

Middleware 2005

View full text Add to dashboard Cite

Abstract. Design of distributed architectures for content-based publishsubscribe (pub-sub) service networks has been a challenging problem. To best support the highly dynamic and diversified content-based pub-sub communication, we propose a new architectural design called MEDYM -Match-Early with DYnamic Multicast. MEDYM follows the End-to-End distributed system design principle. It decouples a pub-sub service into two functionalities: complex, application-specific matching at network edge, and simple, generic multicast routing in the network. This architecture achieves low computation cost in event matching and high network efficiency and flexibility in event routing. For higher scalability, we describe a novel approach to extend MEDYM to a hierarchy structure called H-MEDYM, which effectively balances the trade-off between event delivery efficiency and server states maintenance. We evaluate MEDYM and H-MEDYM using detailed simulations and real-world experiments, and compare them with major existing design approaches. Results show that MEDYM and H-MEDYM achieve high event delivery efficiency and system scalability, and their advantages are most prominent when user subscriptions are highly selective and diversified.

show abstract

Section: Simulation Methodologymentioning

confidence: 99%

“…In this paper, we use the work by the Siena group in [6] and [7] as representatives for the CBF approach, as they are perhaps the most prominent and complete works in this direction. They have also designed efficient event forwarding algorithms in [8].…”

Section: Content-based Forwarding (Cbf)mentioning

confidence: 99%

MEDYM: Match-Early with Dynamic Multicast for Content-Based Publish-Subscribe Networks

Cao

Singh

2005

Middleware 2005

View full text Add to dashboard Cite

show abstract

“…With this regard, recent research proposals on future Internet [5,4,8,2,3] focus on devising a network layer anycast routing, which is "simply" based on names of contents, rather than on locations (i.e., IP address); consequently, in this paper, the term content-routing is synonymous with anycast routing-by-name. We observe that, before this wave of renewed interest, content-based routing has been widely studied for P2P overlay networks (e.g., [18]), improving also the simple routing-by-name with semantic functionality. Nevertheless, the inclusion of semantic functionality strongly increases the complexity of the architecture and may make critical its scalability at the Internet level.…”

Section: Content-routingmentioning

confidence: 96%

Network Layer Solutions for a Content-Centric Internet

Detti

Bléfari-Melazzi

2011

Trustworthy Internet

View full text Add to dashboard Cite

Nowadays most people exploit the Internet to get contents such as web pages, music or video files. These users only value "what" they download and are not interested about "where" content is actually stored. The IP layer does the opposite and cares about the "where" and not about the "what". This contrast between the actual usage of the Internet and the service offered by the IP layer is deemed to be the source of several problems concerning usability, performance, security and mobility issues. To overcome this contrast, research on the Future Internet is exploring novel socalled content-centric architectures, where the network layer directly provides users with contents, instead of providing communication channels between hosts. In this paper, we identify the main functionalities of a content-centric network (CONET), we discuss pros and cons of literature proposals for an innovative, content-centric network layer and we draw our conclusions, stating some general requirements that, in our opinion, a CONET should satisfy.

show abstract

“…For secure information sharing, distributed hash table technology is also widely used [4], [5]. XML publish-subscribe were also explored in [6], [7] that is closely related to the solutions pertaining to privacy preserving information brokering. A robust mesh is used in [8] for routing XML packets with a gab based solution for overlay networks.…”

Section: IImentioning

confidence: 99%

Secure and Dynamic On-Demand Access to Distributed Information through Information Brokering System

Karthik¹,

Vasumurthy²,

Nawaz³

2014

International Journal of Advanced Research in Computer and Comm

View full text Add to dashboard Cite

Distributed information systems emerged as solution for the needs of enterprises that share information via on-demand access. Information Brokering Systems (IBSs) came into existence to leverage usefulness of sharing information among organizations. The IBS is responsible to integrate loosely coupled systems forming a brokering overlay. The existing IBSs believe that the brokers are trusted and data can be shared through them confidently. However, adversaries can infer information from the metadata available. This is the problem to be addressed. Recently Li et al. proposed an approach for privacy preserving information brokering. They focused two kinds of privacy attacks namely inference attack and attribute-correlation attack. They also proposed two solutions for preventing these attacks. They are query segment encryption and automaton segmentation respectively. With insignificant overhead, their approach provides system-wide security. In this paper, we implemented privacy preserving on-demand access to distributed information brokering system. We built a prototype application that demonstrates the proof of concept.

show abstract

A routing scheme for content-based networking

Cited by 247 publications

References 15 publications

MEDYM: Match-Early with Dynamic Multicast for Content-Based Publish-Subscribe Networks

MEDYM: Match-Early with Dynamic Multicast for Content-Based Publish-Subscribe Networks

Network Layer Solutions for a Content-Centric Internet

Secure and Dynamic On-Demand Access to Distributed Information through Information Brokering System

Contact Info

Product

Resources

About