Content distribution networks
662 resources related to Content distribution networks
- Topics related to Content distribution networks
- IEEE Organizations related to Content distribution networks
- Conferences related to Content distribution networks
- Periodicals related to Content distribution networks
- Most published Xplore authors for Content distribution networks
Reliability & Quality of Communication Networks,
ICC 2021 - IEEE International Conference on Communications
IEEE ICC is one of the two flagship IEEE conferences in the field of communications; Montreal is to host this conference in 2021. Each annual IEEE ICC conference typically attracts approximately 1,500-2,000 attendees, and will present over 1,000 research works over its duration. As well as being an opportunity to share pioneering research ideas and developments, the conference is also an excellent networking and publicity event, giving the opportunity for businesses and clients to link together, and presenting the scope for companies to publicize themselves and their products among the leaders of communications industries from all over the world.
2020 IEEE 17th Annual Consumer Communications & Networking Conference (CCNC)
IEEE CCNC 2020 will present the latest developments and technical solutions in the areas of home networking, consumer networking, enabling technologies (such as middleware) and novel applications and services. The conference will include a peer-reviewed program of technical sessions, special sessions, business application sessions, tutorials, and demonstration sessions.
The International Conference on Consumer Electronics (ICCE) is soliciting technical papersfor oral and poster presentation at ICCE 2018. ICCE has a strong conference history coupledwith a tradition of attracting leading authors and delegates from around the world.Papers reporting new developments in all areas of consumer electronics are invited. Topics around the major theme will be the content ofspecial sessions and tutorials.
Multimedia technologies, systems and applications for both research and development of communications, circuits and systems, computer, and signal processing communities.
Speech analysis, synthesis, coding speech recognition, speaker recognition, language modeling, speech production and perception, speech enhancement. In audio, transducers, room acoustics, active sound control, human audition, analysis/synthesis/coding of music, and consumer audio. (8) (IEEE Guide for Authors) The scope for the proposed transactions includes SPEECH PROCESSING - Transmission and storage of Speech signals; speech coding; speech enhancement and noise reduction; ...
Broadcast technology, including devices, equipment, techniques, and systems related to broadcast technology, including the production, distribution, transmission, and propagation aspects.
Video A/D and D/A, display technology, image analysis and processing, video signal characterization and representation, video compression techniques and signal processing, multidimensional filters and transforms, analog video signal processing, neural networks for video applications, nonlinear video signal processing, video storage and retrieval, computer vision, packet video, high-speed real-time circuits, VLSI architecture and implementation for video technology, multiprocessor systems--hardware and software-- ...
Covers topics in the scope of IEEE Transactions on Communications but in the form of very brief publication (maximum of 6column lengths, including all diagrams and tables.)
IEEE Communications Magazine was the number three most-cited journal in telecommunications and the number eighteen cited journal in electrical and electronics engineering in 2004, according to the annual Journal Citation Report (2004 edition) published by the Institute for Scientific Information. Read more at http://www.ieee.org/products/citations.html. This magazine covers all areas of communications such as lightwave telecommunications, high-speed data communications, personal communications ...
2010 International Conference on Computer Application and System Modeling (ICCASM 2010), 2010
Streaming media content distribution networks(SCDNS) are increasingly being used to disseminate data in today's Internet. A very important issue in SCDN is the content distribution strategy. This paper proposes a new content distribution strategy in which a content object was divided into two sections. The first part is replicated to all of cache server. The second part is replicated to ...
2010 International Conference on Intelligent Computing and Integrated Systems, 2010
The replica placement problems (RPPs) in the Content Distribution Networks have been widely studied. In this paper, the Multiple Minimum Cost Flow Model (MMCFM) with server storage constraints is proposed for the RPPs for the first time. Since traditional minimum cost flow algorithm can not be applied to solve our model, MMCFM is converted to an equivalent Mixed Integer Programming ...
2015 IEEE Global Communications Conference (GLOBECOM), 2015
Content Distribution Networks (CDNs) could benefit from peer-to-peer (P2P) network techniques to improve content delivery time by leveraging the upload capacity of the entire network. In most available solutions, peers first select a set of partners, and later select the pieces of content to exchange. It is fundamental instead that both peer and piece selection algorithms are performed in a ...
IEEE/ACM Transactions on Networking, 2017
Global video content distribution networks (CDNs) serve a significant fraction of the entire Internet traffic. Effective caching at the edge is vital for the feasibility of these CDNs, which can otherwise incur substantial costs and overloads in the Internet. We analyze the challenges and requirements for content caching on the servers of these CDNs which cannot be addressed by standard ...
6th Asia-Pacific Symposium on Information and Telecommunication Technologies, 2005
In content distribution networks (CDNs), the request routing which directs user requests to an adequate server from the viewpoint of improvement of latency for obtaining contents is one of the most important technical issues. In the request routing, network support technology enables a router to select an adequate server by using information of server load and network delay. In this ...
ICASSP 2010 - New Signal Processing Application Areas
IEEE Themes - Efficient networking services underpin social networks
The Other 5G: 60 GHz Wifi Access / B-Haul Solutions - Arogyaswami Paulraj - Brooklyn 5G Summit 2018
Quantum Communication for Tomorrow - W.J. Munro Plenary from 2016 IEEE Photonics Conference
IEEE Themes - Five incentive schemes for peer-to-peer networks
Modeling Device-to-Device Communications for Wireless Public Safety Networks - David Griffith - 5G Technologies for Tactical and First Responder Networks 2018
IEEE Themes - Distance-Dependent Kronecker Graphs For Modeling Social Networks
IEEE Entrepreneurship @ SXSW 2017: LOOX VR
Sensing and Decision Making in Social Networks
Part 3 of 3: Workshop on 5G Technologies for Tactical and First Responder Networks
Learning Lab for Chapter Recording and Distribution
Global Distribution Systems for the Smart Grid: Gordon Day
IEEE Top Trends for 2012 at CES: Metadata Automatically Organizes Digital Content
Patrizio Vinciarelli, Newell Award: APEC 2019
APEC Speaker Highlights - Doug Hopkins, University of Buffalo, Power Electronics/Smart-Grid
Care Innovations: Green Engineering (com legendas em portugues)
Joel Rodrigues: Communications Technology Advances Life Sciences
Food Engineering - The Future is Now: 2017 Brain Fuel President's Chat
Algorithms that Play and Design Games
Streaming media content distribution networks(SCDNS) are increasingly being used to disseminate data in today's Internet. A very important issue in SCDN is the content distribution strategy. This paper proposes a new content distribution strategy in which a content object was divided into two sections. The first part is replicated to all of cache server. The second part is replicated to a part of cache server. Compared with the strategy which take the content as a hole object, the client's perceive latency of the new strategy is low.
The replica placement problems (RPPs) in the Content Distribution Networks have been widely studied. In this paper, the Multiple Minimum Cost Flow Model (MMCFM) with server storage constraints is proposed for the RPPs for the first time. Since traditional minimum cost flow algorithm can not be applied to solve our model, MMCFM is converted to an equivalent Mixed Integer Programming (MIP) and furthermore an Integer Linear Programming (ILP). Branch and Bound Algorithm is used to obtain the optimal solution of ILP. In the simulation part, the performance of our algorithms is shown.
Content Distribution Networks (CDNs) could benefit from peer-to-peer (P2P) network techniques to improve content delivery time by leveraging the upload capacity of the entire network. In most available solutions, peers first select a set of partners, and later select the pieces of content to exchange. It is fundamental instead that both peer and piece selection algorithms are performed in a consistent and integrated way. To this aim, we propose a content distribution protocol that unifies piece and peer selection in a single algorithm which optimizes the swarming effects. Our approach leverages Flajolet-Martin sketches, a technique based on Bloom filters, to estimate the number of distinct pieces in the CDN, and then adopts a fractional knapsack problem approach to effectively utilize the entire upload capacity of each peer. We tested our solution with both simulations and Planetlab experiments, showing how the piece estimation at every peer is a good approximation of the global rarest piece across the network, and not just across the first hop neighborhood. Moreover, we show how our solution improves the average downloading time by up to 20%. If we consider only the fastest 50% of peers, the downloading time is improved by 100%. Furthermore, our solution decreases the average first content uploading time by 80% with respect to standard P2P protocols which use a local rarest first piece selection, and tit-for-tat as peer selection algorithm.
Global video content distribution networks (CDNs) serve a significant fraction of the entire Internet traffic. Effective caching at the edge is vital for the feasibility of these CDNs, which can otherwise incur substantial costs and overloads in the Internet. We analyze the challenges and requirements for content caching on the servers of these CDNs which cannot be addressed by standard solutions. We design multiple algorithms for this problem: a LRU- based baseline to address the requirements; a flexible ingress-efficient algorithm; an offline cache aware of future requests (greedy) to estimate the maximum efficiency we can expect from any online algorithm; an optimal offline cache (for limited scales); and an adaptive ingress control algorithm for reducing the server's peak upstream traffic. We use anonymized actual data from a global video CDN to evaluate the algorithms and draw conclusions on their suitability for different settings.
In content distribution networks (CDNs), the request routing which directs user requests to an adequate server from the viewpoint of improvement of latency for obtaining contents is one of the most important technical issues. In the request routing, network support technology enables a router to select an adequate server by using information of server load and network delay. In this system, a network support router selects a server based on information between router and server, so the placement of network support router is important to improve performance of request routing. In this paper, we investigate an efficient placement method of network support router making use of statistical characteristics of Internet topology
The replica placement problems (RPPs) in the Content Distribution Networks have been widely studied. In this paper, we propose an optimization model for the RPPs and design efficient algorithms to minimize the total cost of the network. The algorithms include three parts: replication algorithm preprocess, constraint p-median model and algorithm of solving constraint p-median models. In the simulation, we compare our algorithms to other heuristic methods numerically. The results show that our algorithms perform better with less cost.
This paper presents a micropayment-based architecture for P2P content distribution networks using the lightweight currency protocol. Under this architecture, autonomous peers form a dynamic overlay network that evolves as peers buy and sell documents with the lightweight currency protocol (LCP). By adopting a payment-based system, member peers are forced to contribute resources in order to obtain benefits, thus eliminating the free-rider problem. We present a document search mechanism that is based on bidding, with the use of micropayments.
With the rapid expansion in network flow and application types may be able to lead to under-utilization of the network with a consequent waste of resources and revenues. We focus on the design of a control plane for cloud-based adaptive video flowing distribution networks. By employing flow aware techniques, we design a dynamical Resource Allocation Controller which throttles the number of virtual machines in a Cloud-based CDN with the goal of minimizing the allocation costs while providing the highest video quality to the user. Results indicate that our resource allocation controller is able to significantly decrease allocation costs and to provide a high-quality video to the user.
The efficient distribution of stored information has become a major concern in the Internet. Since the Web workload characteristics shows that more than 60 % of network traffic is caused by image documents, how to efficiently distribute image documents from servers to end clients is an important issue. The proxy cache is an efficient solution to reduce network traffic. It has been shown that an image caching method (graceful caching) based on a hierarchical coding format showed better performance than conventional caching schemes. However, as the capacity of the cache is limited, how to efficiently allocate the cache memory to achieve a minimum expected delay time is still a problem to be resolved. This paper presents an integrated caching algorithm to deal with the above problem in the Internet. By analyzing the Web request distribution of graceful caching, both replacement and pre-fetching algorithms are proposed. We also show that our proposal can be carried out based on information readily available in the proxy server and it flexibly adapts its parameters to the hit rates and access pattern of users' requesting documents in the graceful caching. We finally verify the performance of this algorithm by simulations.
No standards are currently tagged "Content distribution networks"