Informed content delivery across adaptive overlay networks

Byers, John A.; Considine, Jeffrey; Mitzenmacher, Michael; Rost, Stanislav

doi:10.1145/633030.633031

Cited by 18 publications

(16 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In substitution to centralized and fully-coupled media flows, Application Layer Multicast (ALM) end-points based solution for large scale conference has been proposed [9][10][11]. These ALM solutions tend to produce self-organizing, efficient and self-improving overlay meshes that can be dynamically adapted to different network variations.…”

Section: A General Viewmentioning

confidence: 99%

Models for multimedia conference between browsers based on WebRTC

Elleuch

2013

2013 IEEE 9th International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob)

View full text Add to dashboard Cite

Several models and architectures are proposed to support multiparty communication over IP. Even if some of these solutions support large number of participants using a conference server, solutions that base their media distribution on peers are adapted to support only small conferencing groups. Deploying multimedia communication based on WebRTC API for more than browser-to-browser connection is not inherently supported and creates new challenge in terms of media stream distribution as well as membership and conferencing operation control overhead. Many conference models presented in this paper can support multi-party communication between endpoints over an IP networks. Otherwise, the use of WebRTC technology require direct P2P media negotiation between participants as well as signaling interaction with the Server to manage the conference. This paper introduces two specific conference models adapted to support WebRTC communication between browsers for both small scale and large scale conference. The proposed abstract protocols included in this work implements conference creation and browser joining/leaving and can be mapped using SIP/DSP primitives.

show abstract

Section: A General Viewmentioning

confidence: 99%

Models for multimedia conference between browsers based on WebRTC

Elleuch

2013

2013 IEEE 9th International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob)

View full text Add to dashboard Cite

show abstract

“…In an application of overlay networks, continuous reconfiguration of virtual topology by overlay management strives to establish paths with the most desirable end-to-end characteristics. The approximate reconciliation tree of Byers et al [29] uses BFs on top of a tree structure to minimize the amount of data transmitted for verification.…”

Section: R Wmentioning

confidence: 99%

A Memory-Efficient Hashing by Multi-Predicate Bloom Filters for Packet Classification

Mahapatra

2008

IEEE INFOCOM 2008 - The 27th Conference on Computer Communications

View full text Add to dashboard Cite

Hash tables (HTs) are poorly designed for multiple off-chip memory accesses during packet classification and critically affect throughput in high-speed routers. Therefore, an HT with fast on-chip memory and high-capacity off-chip memory for predictable lookup-throughput is desirable. Both a legacy HT (LHT) and a recently proposed fast HT (FHT) [1] have the disadvantage of memory overhead due to pointers and duplicate items in linked lists. Also, memory usage for an FHT did not consider the bits in counters for fair comparision with an LHT. In this paper, we propose a novel hash architecture called a Multi-predicate Bloom-filtered HT (MBHT) using parallel Bloom filters and generating off-chip memory addresses in the base-2 x number system, x∈{1, 2, · · · }, which removes the overhead of pointers. Using a larger base of number system, an MBHT reduces on-chip memory size by a factor of log 2 b 2 / log 2 b 1 where b 1 and b 2 are bases of number system (b 2 >b 1 ). Compared to an FHT, the MBHT is approximately x(log 2 n + 4)/(2 log 2 n) times more efficient for on-chip memory, where n is the number of keys. This results in a significant reduction in the number of offchip memory accesses. A simulation with a dataset of packets from NLANR [2] shows the on-chip memory reductions by 1.7 and 2 times over an LHT and an FHT are made. Besides, an MBHT of base-16 needs less off-chip memory accesses by 2117 in total URL queries of NLANR, compared to an FHT.This full text paper was peer reviewed at the direction of IEEE Communications Society subject matter experts for publication in the IEEE INFOCOM 2008 proceedings.

show abstract

“…The approximate reconciliation tree for overlay networks by Byers et al [5] uses BFs on top of a tree structure to minimize the amount of data transmitted for verification. In the packet processing domain, BFs in [9,18] were widely adapted for fast query with the known collision rate setback.…”

Section: Bf's Applications In Networkingmentioning

confidence: 99%

“…Then, the probability Pr{X u = v}, v > 0 can be easily derived based on Eq. (4) as the following Pr{X u =v}= v=t 0 +t 1 +t 2 +t 3 P 0 (t 0 ) · P 0 (t 1 ) · P 0 (t 2 ) · P 0 (t 3 ) (5) because there are two HITs, l-HIT and r-HIT , each having 0-and 1-trees. The sum in Eq.…”

Section: • False Indexing To An On-chip Key Table For a Usmentioning

confidence: 99%

A space- and time-efficient hash table hierarchically indexed by Bloom filters

Mahapatra

2008

2008 IEEE International Symposium on Parallel and Distributed Processing

View full text Add to dashboard Cite

Hash tables (HTs) are poorly designed for multiple memory accesses during IP lookup and this design flow critically affects their throughput in high-speed routers. Thus, a high capacity HT with a predictable lookup throughput is desirable. A recently proposed fast HT (FHT) [20] has drawbacks like low on-chip memory utilization for a high-speed router and substantial memory overheads due to off-chip duplicate keys and pointers. Similarly, a Bloomier filter-based HT (BFHT) [13], generating an index to a key table, suffers from setup failures and static membership testing for keys.In this paper, we propose a novel hash architecture which addresses these issues by using pipelined Bloom filters. The proposed scheme, a hierarchically indexed HT (HIHT), generates indexes to a key table for the given key, so that the on-chip memory size is reduced and the overhead of pointers in a linked list is removed. Secondly, an HIHT demonstrates approximately 5.1 and 2.3 times improvement in onchip space efficiency with at most one off-chip memory access, compared to an FHT and a BFHT, respectively. In addition to our analyses on access time and memory space, our simulation for IP lookup with 6 BGP tables shows that an HIHT exhibits 4.5 and 2.0 times on-chip memory efficiencies for 160Gbps router than an FHT and a BFHT, respectively.

show abstract

Informed content delivery across adaptive overlay networks

Cited by 18 publications

References 0 publications

Models for multimedia conference between browsers based on WebRTC

Models for multimedia conference between browsers based on WebRTC

A Memory-Efficient Hashing by Multi-Predicate Bloom Filters for Packet Classification

A space- and time-efficient hash table hierarchically indexed by Bloom filters

Contact Info

Product

Resources

About