Using Service Proxies for Content Provisioning

Author(s):  
P. Kalliaras

In modern broadband mesh networks, communication between two end nodes is carried out not directly, but through a number of intermediate nodes. While these nodes’ only function may be to relay information from one point to another, they may also host computational elements which perform some service on behalf of other applications. We deal with the problem of optimally mapping multimedia content transcoding service elements onto network resources. There may be several places in the network where the required compression and decompression services could be performed. We would like to select the best locations that meet the application’s requirements. We propose a new approximation algorithm for constrained path optimization, which provides better scalability and simplicity than previous approaches. This is accomplished basically by partitioning the overall problem into smaller ones.

2021 ◽  
pp. 1-14
Author(s):  
Sampa Rani Bhadra ◽  
Ashok Kumar Pradhan ◽  
Utpal Biswas

For the last few decades, fiber optic cables not only replaced copper cables but also made drastic evolution in the technology to overcome the optoelectronic bandwidth mismatch. Light trail concept is such an attempt to minimize the optoelectronic bandwidth gap between actual WDM bandwidth and end user access bandwidth. A light trail is an optical bus that connects two nodes of an all optical WDM network. In this paper, we studied the concept of split light trail and proposed an algorithm namely Static Multi-Hop Split Light Trail Assignment (SMSLTA), which aims to minimize blocking probability, the number of static split light trails assigned and also the number of network resources used, at the same time maximizing the network throughput. Our proposed algorithm works competently with the existing algorithms and generates better performance in polynomial time complexity.


2013 ◽  
Vol 2013 ◽  
pp. 1-9 ◽  
Author(s):  
Avid Avokh ◽  
Ghasem Mirjalily ◽  
Jamshid Abouei ◽  
Shahrokh Valaee

This paper deals with the problem of multicast/broadcast throughput in multi-channel multi-radio wireless mesh networks that suffer from the resource constraints. We provide a formulation to capture the utilization of the network resources and derive analytical relationships for the network’s throughput in terms of the node utilization, the channel utilization, and the number of transmissions. Our model relies on the on-demand quality of service multicast/broadcast sessions, where each admitted session creates a unique tree with a specific bandwidth. As an advantage, the derived relationships are independent of the type of tree built for each session and can be used for different protocols. The proposed formulation considers the channel assignment strategy and reflects both the wireless broadcast advantage and the interference constraint. We also offer a comprehensive discussion to evaluate the effects of load-balancing and number of transmissions on the network’s throughput. Numerical results confirm the accuracy of the presented analysis.


2009 ◽  
Vol 19 (04) ◽  
pp. 553-572 ◽  
Author(s):  
ABHINAV BHATELÉ ◽  
LAXMIKANT V. KALÉ

In the early years of parallel computing research, significant theoretical studies were done on interconnect topologies and topology aware mapping for parallel computers. With the deployment of virtual cut-through, wormhole routing and faster interconnects, message latencies reduced and research in the area died down. This article shows that network topology has become important again with the emergence of very large supercomputers, typically connected as a 3D torus or mesh. It presents a quantitative study on the effect of contention on message latencies on torus and mesh networks. Several MPI benchmarks are used to evaluate the effect of hops (links) traversed by messages, on their latencies. The benchmarks demonstrate that when multiple messages compete for network resources, link occupancy or contention can increase message latencies by up to a factor of 8 times on some architectures. Results are shown for three parallel machines – ANL's IBM Blue Gene/P (Surveyor), RNL's Cray XT4 (Jaguar) and PSC's Cray XT3 (BigBen). Findings in this article suggest that application developers should now consider interconnect topologies when mapping tasks to processors in order to obtain the best performance on large parallel machines.


2013 ◽  
Vol 12 (1) ◽  
pp. 3147-3157
Author(s):  
Ramratan Ahirwal ◽  
Nitesh Kumar Chaurasiya ◽  
Yogendra Kumar Jain

A mobile adhoc network (MANET) is formed by a group of wireless mobile hosts or nodes without any fixed infrastructure. As there is no inner control in a MANET, a mobile node itself acts as a router. Undoubtedly, MANETs plays a critical job in situations where a wired infrastructure is neither available nor easy to install. Wireless mesh networks have large round trip time variations and these variations are dependent on the number of hops. The end-to-end throughput degrades rapidly with increase in number of hops. This is one of the biggest problems in MANET.In this paper we introduce an algorithm for avoiding congestion in MANETs. The algorithm demonstrates fast response and superior stability with the controlled packet dropping rate, and reduces end-to-end delay in MANETs, while still fully utilizing the network resources. Analysis and simulation show the strength and robustness of the algorithm. This method is simple and easy to use. We also illustrate the advantages of our proposed approach by comparing its results with standard AODV with recommended parameter settings.


2021 ◽  
Vol 11 (1) ◽  
Author(s):  
D. J. Ives ◽  
S. Yan ◽  
L. Galdino ◽  
R. Wang ◽  
D. J. Elson ◽  
...  

AbstractThe management of wavelength routed optical mesh networks is complex with many potential light path routes and numerous physical layer impairments to transmission performance. This complexity can be reduced by applying the ideas of abstraction from computer science where different equipment is described in the same basic terms. The noise-to-signal ratio can be used as a metric to describe the quality of transmission performance of a signal propagated through a network element and accumulates additively through a sequence of such elements allowing the estimation of end-to-end performance. This study aims to explore the robustness of the noise-to-signal ratio metric in an installed fibre infrastructure. We show that the abstracted noise-to-signal ratio is independent of the observers and their location. We confirm that the abstracted noise-to-signal ratio can reasonably predict the performance of light-paths subsequently set in our network. Having a robust network element abstraction that can be incorporated into routeing engines allows the network management controller to make decisions on the most effective way to use the network resources in terms of the routeing and data coding format.


Author(s):  
B. Aparna ◽  
S. Madhavi ◽  
G. Mounika ◽  
P. Avinash ◽  
S. Chakravarthi

We propose a new design for large-scale multimedia content protection systems. Our design leverages cloud infrastructures to provide cost efficiency, rapid deployment, scalability, and elasticity to accommodate varying workloads. The proposed system can be used to protect different multimedia content types, including videos, images, audio clips, songs, and music clips. The system can be deployed on private and/or public clouds. Our system has two novel components: (i) method to create signatures of videos, and (ii) distributed matching engine for multimedia objects. The signature method creates robust and representative signatures of videos that capture the depth signals in these videos and it is computationally efficient to compute and compare as well as it requires small storage. The distributed matching engine achieves high scalability and it is designed to support different multimedia objects. We implemented the proposed system and deployed it on two clouds: Amazon cloud and our private cloud. Our experiments with more than 11,000 videos and 1 million images show the high accuracy and scalability of the proposed system. In addition, we compared our system to the protection system used by YouTube and our results show that the YouTube protection system fails to detect most copies of videos, while our system detects more than 98% of them.


Sign in / Sign up

Export Citation Format

Share Document