Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Download
Standard view
Full view
of .
Look up keyword
Like this
1Activity
0 of .
Results for:
No results containing your search query
P. 1
Multimedia Design Issues for Internet Telephony Protocols in Current High Performance Networks

Multimedia Design Issues for Internet Telephony Protocols in Current High Performance Networks

Ratings: (0)|Views: 19|Likes:
Published by ijcsis
The rapid growth of media content distribution [5] on the internet in the past few years has brought with it commensurate increases in the cost of distributing the content. Underlying the internet access trends at a global scheme i.e. how people use the internet is a challenging problem i.e. typically addressed by network frames. We seek to understand the intrinsic reasons for the well known phenomenon of heavy tailed degree in the internet. AS graph and anywhere that the contrast to traditional model based on preferential attachment and centralized optimization the present degree of the internet can be explained by the evolution of wealth associated with each ISP. Our extensive numerical and simulation examples have shown that the proposed scheme achieves satisfied accuracy and computational efficiency. The effectiveness of the proposed detection and trace back methods are verified through extensive simulations and internet datasets.
The rapid growth of media content distribution [5] on the internet in the past few years has brought with it commensurate increases in the cost of distributing the content. Underlying the internet access trends at a global scheme i.e. how people use the internet is a challenging problem i.e. typically addressed by network frames. We seek to understand the intrinsic reasons for the well known phenomenon of heavy tailed degree in the internet. AS graph and anywhere that the contrast to traditional model based on preferential attachment and centralized optimization the present degree of the internet can be explained by the evolution of wealth associated with each ISP. Our extensive numerical and simulation examples have shown that the proposed scheme achieves satisfied accuracy and computational efficiency. The effectiveness of the proposed detection and trace back methods are verified through extensive simulations and internet datasets.

More info:

Published by: ijcsis on Jun 05, 2011
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less

06/05/2011

pdf

text

original

 
 
MULTIMEDIA DESIGN ISSUES FOR INTERNET TELEPHONY PROTOCOLS INCURRENT HIGH PERFORMANCE NETWORKS
A.JayachandranAsst Prof,CSE DeptPSN College of Engineeringand technologyTirunelveli,INDIA jaya1jaya1@gmail.comDr.R.Dhanasekaran,PrincipalSyed Ammal Engineeringcollege,Ramnad,INDIArdhanashekar@yahoo.comP. Rajan, Professor in MCAdept, PSN College of Engineering and Technology,Tirunelveli,INDIAprajan1968@gmail.com
ABSTRACT:The rapid growth of media contentdistribution[5] on the internet in the pastfew years has brought with itcommensurate increases in the cost of distributing the content. Underlying theinternet access trends at a global schemei.e. how people use the internet is achallenging problem i.e. typicallyaddressed by network frames. We seek tounderstand the intrinsic reasons for thewell known phenomenon of heavy taileddegree in the internet. AS graph andanywhere that the contrast to traditionalmodel based on preferential attachmentand centralized optimization the presentdegree of the internet can be explained bythe evolution of wealth associated witheach ISP. Our extensive numerical andsimulation examples have shown that theproposed scheme achieves satisfiedaccuracy and computational efficiency.The effectiveness of the proposeddetection and trace back methods areverified through extensive simulationsand internet datasets.Key words
:
Peer to peer , Networksecurity, Security policy, Contentdelivery, 3G/4G networks, Grid andCloud computing
 
1.
 
INTRODUCTION
We describe how a scalable system of denseWi-Fi sensors[6,7] can be builtinexpensively. We build such a system andevaluate its performance. We providespecific example of why standardauthentication and encryption scheme are inadequate to secure corporate Wi-Fi networkswhich motivate our solutions based oncontinuous monitoring of Wi-Fi networks.We show that, to provide comprehensivecoverage for detecting security branches adense deployment of RF sensor is necessary.Magnetic and electromagnetic sensors donot require direct physical content and areuseful for detecting proximity effects.Magneto resistive effect is a relatedphenomenon depending on the fact that theconductivity varies as the square of theapplied flux density. Magnetic field sensorscan be used to detect the remote presence of metallic objects. Eddy current sensors usemagnetic probe coils to detect in the metallicstructure such as pipes.Thermal sensors are a family of sensors usedto measure temperature or heat flux. Mostbiological organisms have developedsophisticated temperature sensing systems.Thermo resistive effects are based on the
(IJCSIS) International Journal of Computer Science and Information Security,Vol. 9, No. 5, May 2011231http://sites.google.com/site/ijcsis/ISSN 1947-5500
 
 
fact that the resistance R changes withtemperature T. For moderate changes therelation is approximately given for manymetals by
R/R =
R
T with
R thetemperature coefficient of resistance. Therelationship for silicon is more complicatedbut it is well understood. Hence silicon isuseful for detecting temperature changes.Resonant temperature sensors rely on thefact that single crystal sio2 exhibit a changein resonant frequency depending ontemperature change. Since this is afrequency effect it is more accurate thanamplitude change effect and has extremesensitivity and accuracy for smalltemperature changes.
2.
 
On demand multimedia content
For a large content delivery networks thatconsists of hundreds are even thousands of geographically distributed CDN[5] serverslike the hierarchical topology of the IProuters on the internet we believe that ahierarchical overlay network topology isrequired for the CDN servers to performcontent routing and content delivery doneefficiently.Step 1: Try to satisfy the users requestusing local CDN server.Step 2: If step 1 fails try to satisfy the userrequest using a CDN server inside thecluster including the local CDN serverStep 3: If step 2 fails try to satisfy the userrequest using a CDN server inside a nearbyclusterStep 4: If step 3 fails try to satisfy the userrequest using the origin server
3.
 
Caching and content routing servicecapacity
Multicast over the internet wasoriginally proposed at the network layer referred to as multicast.However after a decade of researchthere are still many hurdles in thedeployment of IP multicast such asthe lack of higher layerfunctionalities and scalable interdomain multicast routing protocols.Data management – A documentmay be portioned into various partspermitting concurrent downloadingfrom multiple peers[1] , thegranularity and placement of these iscritical.Peer selection – The mechanismwhereby a peer is selected as a servermay take into account load balancingbandwidth availability anddifferentiate among peers whocontribute more to the community.Admission and scheduling policy –Limiting the number of concurrentdown loaders and/or scheduling toprovide differentiation priorityamong them.Traffic – The request processes fordocuments along with the dynamicof how peers stay online and/ordelete documents.
(IJCSIS) International Journal of Computer Science and Information Security,Vol. 9, No. 5, May 2011232http://sites.google.com/site/ijcsis/ISSN 1947-5500
 
 
4.
 
Methodology
(a)
 
Service capacity – since BT usesmultiport downloads servicecapacity must be carefullydefined. We estimate the servicecapacity asEffective number of service = Totalstorage space / size(b)
 
The effective number of replicates available in the systemincluding partial downloads.Since peers may exist or delete afile upon completing a downloadwe can estimate service capacitybased on the following formulaT * Volume – ( Number of finished –Number of seeds ) * size / size(c)Throughput and delay of eachpeerWe estimate the averageinstantaneous throughput seen byeach peer as followsAverage throughput per peer =throughput / number of downloads
(c)
 
Table comparisonsExisting
:
Capacity CD delay P2P delay
1.2626 0.2619 0.26760.2159 0.2261 4.72440.1960 0.1960 00.1757 0.1968 12.00910.1480 0.0.1472 0.54050.1360 1.1371 0.0968
Proposed
:
Capacity CD delay P2Pdelay
0.13481 0.13472 0.06680.11180 0.11675 4.42750.09929 0.10119 1.91360.066592 0.06587 0.07580.03264 0.03221 1.31740.01649 0.01575 4.4876We describe a set of network benchmark for measuring bandwidth, latency , software overhead whichwe have implemented over a widevariety of networks. We provide datafrom these benchmarks for bothsmall and large messageperformance on many of these
(IJCSIS) International Journal of Computer Science and Information Security,Vol. 9, No. 5, May 2011233http://sites.google.com/site/ijcsis/ISSN 1947-5500

You're Reading a Free Preview

Download
scribd
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->