Akamai state of the internet report, Q4 2009

Belson, David

doi:10.1145/1842733.1842738

Cited by 34 publications

(29 citation statements)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Such growth has been fuelled by the emergence of advanced web-based services (Web 2.0, SaaS cloud services, etc. ), enhanced client device capabilities (JavaScript browser runtimes, display), and increased downlink speeds [4]. This growing complexity, however, can dramatically slow down page retrieval.…”

Section: Introductionmentioning

confidence: 99%

Can SPDY really make the web faster?

Elkhatib

Tyson

Welzl

2014

2014 IFIP Networking Conference

View full text Add to dashboard Cite

Abstract-HTTP is a successful Internet technology on top of which a lot of the web resides. However, limitations with its current specification have encouraged some to look for the next generation of HTTP. In SPDY, Google has come up with such a proposal that has growing community acceptance, especially after being adopted by the IETF HTTPbis-WG as the basis for HTTP/2.0. SPDY has the potential to greatly improve web experience with little deployment overhead, but we still lack an understanding of its true potential in different environments. This paper offers a comprehensive evaluation of SPDY's performance using extensive experiments. We identify the impact of network characteristics and website infrastructure on SPDY's potential page loading benefits, finding that these factors are decisive for an optimal SPDY deployment strategy. Through exploring such key aspects that affect SPDY, and accordingly HTTP/2.0, we feed into the wider debate regarding the impact of future protocols.

show abstract

Section: Introductionmentioning

confidence: 99%

Can SPDY really make the web faster?

Elkhatib

Tyson

Welzl

2014

2014 IFIP Networking Conference

View full text Add to dashboard Cite

show abstract

“…The right-hand graph in Figure 4 compares HC and CBH performance when we applied a 1Mbps filter to the sender-to-receiver link. This recreates common broadband home Internet connections, with increasingly high downlink bandwidth and limited uplink bandwidth [2].…”

Section: Discussionmentioning

confidence: 99%

“…While broadband, both wired and mobile, is rapidly becoming ubiquitous in developed countries [2], it is not a panacea. Firstly, upload bandwidth remains a scarce resource for the average broadband consumer, for commercial and technical reasons that are unlikely to change in the near future [2]. Yet, in many examples mentioned above, clients tend to upload more than they download; e.g., in backup and file hosting/sharing systems.…”

Section: Introductionmentioning

confidence: 99%

Hash challenges: Stretching the limits of compare-by-hash in distributed data deduplication

Barreto

Veiga

Ferreira

2012

Information Processing Letters

View full text Add to dashboard Cite

We propose a technique for reducing communication overheads when sending data across a network. Our technique, called hash challenges, leverages existing deduplication solutions based on compare-by-hash by being able to determine redundant data chunks by exchanging substantially less meta-data. Hash challenges can be used directly on any existing compare-by-hash protocol, with no relevant additional computational complexity. Using real data from reference workloads, we show that hash challenges can save as much as 64% meta-data exchanged across the network, relatively to plain compare-by-hash. This implies reductions of up to 7% in overall transferred volume, and performance gains of up to 16% with typical asymmetrical broadband connections.

show abstract

“…The retrieval process is typically supported by an inverted index. Though we are not aware of any BoVW based P2P CBIR systems, many existing P2P text retrieval systems build a distributed inverted index in a highly efficient manner over DHT, using term ID as key and document ID as value [16], [17], [18], [19]. Generally, there are two strategies to distribute index tuples: document partition (or local indexing), and term partition (or global indexing), both are well exploited in the literature [31], [32], [33].…”

Section: Visual Feature Extractionmentioning

confidence: 99%

“…This is not a very big issue in shared-memory or distributed servers, but does pose a challenge in P2P networks, as the nodes in P2P networks are loosely coupled and have much lower bandwidth. As a result, term partition is a more popular choice in P2P networks [16], [17], [18], [19]. To further reduce the network cost and tackle the issue of workload balance with term partition, different techniques have been proposed.…”

Section: Visual Feature Extractionmentioning

confidence: 99%

Scalable Approach for Content-Based Image Retrieval in Peer-to-Peer Networks

Akshatha¹,

S²,

Monisha³

2018

Nciccnda

View full text Add to dashboard Cite

Peer-to-peer networking offers a modular solution for sharing visual data across the network. it is a demand issue to perform CBIR in peer-to-peer networks. While most of the existing methods focus on LSH visual features and have limitations of flexibility. In proposed system we use an innovative approach that is a p2p network with CBIR by employing the BOVW model. As images are scattered across the p2p network, which makes a static codebook less effective for retrieval tasks. here we propose a codebook updating method by sharpen the mutual information between the follow -up codebook, and the workload balance among peers that manage different code words. In order to further improve retrieval performance and reduce network cost.

show abstract

Akamai state of the internet report, Q4 2009

Abstract: In this paper, we review data gathered across Akamai's global server network about attack traffic, Internet and broadband penetration, and mobile connectivity, as well as trends seen in this data over time.

Cited by 34 publications

References 1 publication

Can SPDY really make the web faster?

Can SPDY really make the web faster?

Hash challenges: Stretching the limits of compare-by-hash in distributed data deduplication

Scalable Approach for Content-Based Image Retrieval in Peer-to-Peer Networks

Contact Info

Product

Resources

About