Sie sind auf Seite 1von 9

(IJCSIS) International Journal of Computer Science and Information Security, Vol. 9, No. 5, May 2011

MULTIMEDIA DESIGN ISSUES FOR INTERNET TELEPHONY PROTOCOLS IN CURRENT HIGH PERFORMANCE NETWORKS

A.Jayachandran Asst Prof,CSE Dept PSN College of Engineering and technology Tirunelveli,INDIA

jaya1jaya1@gmail.com

Dr.R.Dhanasekaran,Principal

Syed Ammal Engineering college,Ramnad,INDIA

rdhanashekar@yahoo.com

P. Rajan, Professor in MCA dept, PSN College of Engineering and Technology, Tirunelveli,INDIA

prajan1968@gmail.com

ABSTRACT:

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.

Key

security, Security

delivery, 3G/4G networks, Grid

Cloud computing

words

:

Peer

to

peer

Network

,

policy, Content

and

1.

INTRODUCTION

We describe how a scalable system of dense Wi-Fi sensors[6,7] can be built inexpensively. We build such a system and evaluate its performance. We provide specific example of why standard authentication and encryption scheme are in adequate to secure corporate Wi-Fi networks which motivate our solutions based on continuous monitoring of Wi-Fi networks. We show that, to provide comprehensive coverage for detecting security branches a dense deployment of RF sensor is necessary.

Magnetic and electromagnetic sensors do not require direct physical content and are useful for detecting proximity effects. Magneto resistive effect is a related phenomenon depending on the fact that the conductivity varies as the square of the applied flux density. Magnetic field sensors can be used to detect the remote presence of metallic objects. Eddy current sensors use magnetic probe coils to detect in the metallic structure such as pipes.

Thermal sensors are a family of sensors used to measure temperature or heat flux. Most biological organisms have developed sophisticated temperature sensing systems. Thermo resistive effects are based on the

231

http://sites.google.com/site/ijcsis/ ISSN 1947-5500

(IJCSIS) International Journal of Computer Science and Information Security, Vol. 9, No. 5, May 2011

fact that the resistance R changes with temperature T. For moderate changes the relation is approximately given for many metals by R/R = R T with R the temperature coefficient of resistance. The relationship for silicon is more complicated but it is well understood. Hence silicon is useful for detecting temperature changes.

Resonant temperature sensors rely on the fact that single crystal sio2 exhibit a change in resonant frequency depending on temperature change. Since this is a frequency effect it is more accurate than amplitude change effect and has extreme sensitivity and accuracy for small temperature changes.

2. On demand multimedia content

For a large content delivery networks that consists of hundreds are even thousands of geographically distributed CDN[5] servers like the hierarchical topology of the IP routers on the internet we believe that a hierarchical overlay network topology is required for the CDN servers to perform content routing and content delivery done efficiently.

Step 1: Try to satisfy the using local CDN server.

users

request

Step 2: If step 1 fails try to satisfy the user request using a CDN server inside the cluster including the local CDN server

Step 3: If step 2 fails try to satisfy the user request using a CDN server inside a nearby cluster

Step 4: If step 3 fails try to satisfy the user request using the origin server

232

3. Caching and content routing service capacity

Multicast over the internet was originally proposed at the network layer referred to as multicast. However after a decade of research there are still many hurdles in the deployment of IP multicast such as the lack of higher layer functionalities and scalable inter domain multicast routing protocols.

Data management – A document may be portioned into various parts permitting concurrent downloading from multiple peers[1] , the granularity and placement of these is critical.

Peer selection – The mechanism whereby a peer is selected as a server may take into account load balancing bandwidth availability and differentiate among peers who contribute more to the community.

Admission and scheduling policy – Limiting the number of concurrent down loaders and/or scheduling to provide differentiation priority among them.

Traffic – The request processes for documents along with the dynamic of how peers stay online and/or delete documents.

http://sites.google.com/site/ijcsis/ ISSN 1947-5500

(IJCSIS) International Journal of Computer Science and Information Security, Vol. 9, No. 5, May 2011

4.

Methodology

(a) Service capacity – since BT uses multiport downloads service capacity must be carefully defined. We estimate the service capacity as

Effective number of service = Total storage space / size

(b) The effective number of replicates available in the system including partial downloads. Since peers may exist or delete a file upon completing a download we can estimate service capacity based on the following formula

T * Volume – ( Number of finished – Number of seeds ) * size / size

(c)Throughput

and

delay

of

each

peer

We estimate the average instantaneous throughput seen by each peer as follows

Average throughput per peer = throughput / number of downloads

233

(c) Table comparisons

Existing:

Capacity

CD delay

P2P delay

1.2626

0.2619

0.2676

0.2159

0.2261

4.7244

0.1960

0.1960

 

0

0.1757

0.1968

12.0091

0.1480

0.0.1472

0.5405

0.1360

1.1371

0.0968

Proposed:

Capacity

CD delay

P2P

delay

0.13481

0.13472

0.0668

0.11180

0.11675

4.4275

0.09929

0.10119

1.9136

0.066592

0.06587

0.0758

0.03264

0.03221

1.3174

0.01649

0.01575

4.4876

We describe a set of network benchmark for measuring bandwidth , latency , software overhead which we have implemented over a wide variety of networks. We provide data from these benchmarks for both small and large message performance on many of these

http://sites.google.com/site/ijcsis/ ISSN 1947-5500

(IJCSIS) International Journal of Computer Science and Information Security, Vol. 9, No. 5, May 2011

benchmark for both small and large message performance on many of the super computer networks in use today and compare the performance of MPI to that of lower level network API.

Using our results, we examine various application speedups that can be achieved via network related optimizations such as overloading computations with communications, pipelining messages and the use of message packing. We provide a historical portrait of the trends in small message performance over the past 10 years.

5. Resource reservations

The site manager responsible for a resource makes a donation to a resource broker of its choosing for an agreed upon number of tokens. When a user wants to ‘buy’ this resource it contact the responsible resource broker and pays the required number of token and when the tokens ‘validity’ is checked get a ticket for that resource in return. The ticket is presented to the component manager responsible for the resource which verifies it a authenticity. The component manager then gives the user access credentials for that resource. The network hierarchy has 3 main hierarchical components i.e. user equipment, Radio access network and core network.

234

6.

Mobility

networks using IPV6

management

in

4G

High speed – 4G[9,10] systems should offer a peak speed of more than 10 Mbits per second in stationery mode with an average of 20 Mbits per second when traveling.

High network capacity – It should be at least 10 times that of 3G[9,10] systems. This will quicken the time load time of 10 MB file to 1 second on 4G from 200 seconds on 3G enabling high speed video to stream to phone and create a virtual reality experience on high resolution hand set screens fast/seamless handover across multiple networks. 4G wireless networks[8,11] should support global roaming across multiple wireless and mobile networks.

Next generation multimedia[4] support – The underlying network for 4G must be able to support fast speed and large volume of data transmission at a lower cost than today.

128 bit address space provides a sufficiently large number of address. High quality support for real time audio transmission short/ bursty connections of web applications , peer to peer[1] applications etc., Faster packet delivery , decreased cost processing no header checksum at each relay fragmentation only at the end points. Smooth hand off when the mobile host travel from one

http://sites.google.com/site/ijcsis/ ISSN 1947-5500

7.

(IJCSIS) International Journal of Computer Science and Information Security, Vol. 9, No. 5, May 2011

subnet to another. Causing a change in its care of address.

Range

address allocations

of

wireless

services

and

Broadcasting services – It include short waves like AM and FM radio as well as terrestrial television.

Mobile communication of voice and data – including maritime and aeronautical mobile for communications between ship , airplanes and land mobile for communications between a fixed base station and moving size such as a taxi fleet and paging services and mobile communications. Either between mobile user and a fixed network or between mobile user such as mobile telephone services. Fixed services either point to point or point to multi point services. Satellite used for broadcasting telecommunications and internet particularly over long distances. Other user including military radio astronomy metrological or scientific users.

Client

Transport

Internet

Network

Interface

235

Buffer Router IP Addres Token Ring LAN
Buffer
Router
IP
Addres
Token Ring
LAN
IP Address
IP Address
235 Buffer Router IP Addres Token Ring LAN IP Address X.25 packet switched Fig 1.1 This

X.25 packet

switched

Fig 1.1

This another case that seems to duplicate lower layer features. Some errors do escape lower layer error detection. This statement may sound unusual because it implies that even if data link error detection provides reliable transmission along each link there is still no guarantee of error free transmission between the source and destination. Suppose it receives the IP packet intact but an error that affect the packet current occur during reformatting of the frame containing the packet.

Server

Transport

Internet

Network

Interface

Fig 1.2

Transport Internet Network Interface Fig 1.2 http://sites.google.com/site/ijcsis/ ISSN 1947-5500 Internet

http://sites.google.com/site/ijcsis/ ISSN 1947-5500

Internet

(IJCSIS) International Journal of Computer Science and Information Security, Vol. 9, No. 5, May 2011

A client or server application interact directly with a transport layer protocol to establish common and to send or receive information. The transport layer protocol then uses lower layer protocol to send or receive individual messages , then a computer needs a complete stack of protocols to run either a client or a server.

Allocation

Prefix

Fraction of

space

address

space

Reserved

0000

1 / 256

0000

Un assigned

0000

1 / 256

0001

Reserved for

0000

1 / 128

NSAP

001

llocation

Reserved for

000 010

1 /128

IPX

allocation

Un assigned

0000

1 / 128

011

Un assigned

0000 1

1 / 32

Un assigned

0001

1 / 16

Un assigned

001

1 / 8

Provider

010

1 / 8

based

unicast

236

address

   

Un assigned

011

1

/ 8

Reserved for

100

1

/ 8

geographic

 

based

unicast

address

Un assigned

101

1

/ 18

Un assigned

110

1

/ 8

Un assigned

1110

1

/ 16

Un assigned

1111

0

1

/ 32

Un assigned

1111

10

1

/ 64

Un assigned

1111

1

/ 128

110

 

Un assigned

1111

1

/ 512

1110

0

 

Link

local

1111

1

/ 1024

use address

1110

10

 

Size

local

1111

1

/ 1024

use address

1110

11

 

Multicast

1111

1

/ 256

address

1111

 

http://sites.google.com/site/ijcsis/ ISSN 1947-5500

(IJCSIS) International Journal of Computer Science and Information Security, Vol. 9, No. 5, May 2011

8.

Strategic

instruments

to

limit

for termination. Such access prices

competition

 

are often negotiated privately between mobile operators.

 

A

call from a mobile operator to a

fixed line network involves the mobile operator collecting all the

revenue for the call but the fixed line network providing the termination of the call. As a result, the fixed line network usually changes for the termination of mobile to fixed calls. Typically the termination of mobile

to fixed call is treated in the same

way as the termination of other calls to fixed line networks being

regulated on a cost basis.

A call from a fixed line network to a

mobile operator often leads to an access price being set by the mobile operator. In the majority of market the termination of fixed to mobile calls has been priced many times

higher than the termination of mobile

to fixed calls, some times resulting in

the regulation of fixed to mobile termination process. An exception is the US where this access price is the same as the mobile to fixed access price due to the symmetry requirements under the 1996 telecom act.[2,3] Other exceptions are Canada, Hong Kong and Singapore where there are no fixed to mobile termination changes. Instead like the US mobile operators[4] recover the cost of terminating fixed to mobile calls from the mobile callers directly.

A call from a mobile operator to

another mobile operator may involve mobile operator charging each other

237

Wayne Thomson – SAS has been one of the first vendors to recognize the need for operationalizing analytics i.e. moving beyond just knowledge discovery. Open standard have been very critical to deploy analytical models in a heterogeneous environment.

Mike Hockins – We will be announcing our data rush based parallel data mining solution for the summer. Shortly thereafter we expect to announce support for reading and writing PMML both at design time and run time.

Robert Grossmann – I think cloud computing[10] is the disruptive technology that will have the greatest impact on data mining and predictive model in the near term.

9.

Metrological and scientific issues in internet

Processor in the cluster may not be identical. The communication network may have a regular but heterogeneous structure. The cluster may be a multi-user computer system. This is in particular makes the performance character of the processor dynamic and non identical. Mobile telecom system with different type of processor from embedded into mobile phones to central computers processing calls.

http://sites.google.com/site/ijcsis/ ISSN 1947-5500

(IJCSIS) International Journal of Computer Science and Information Security, Vol. 9, No. 5, May 2011

Embedded control multiprocessor system ex. Car, airplanes etc., Given a set of processors the speed of each of which is characterized by a positive constant.

Partition is the mathematical object into sub objects of the same type. There is one to one mapping between the position and the processors. The size of each partition is proportional to the speed of the processor owing the partition. Some additional restrictions to the relationship between the partitions are satisfied. The partitioning minimizes some functional, which is used to measure each partitioning. The whole computation is partitioned into a number of equal chunks. Each chunk is performed by separate process. The number of process run by each processor is proportional to the relative speed of the processor.

The performance of heterogeneous model network of computers quantifying the ability of the network to perform computations and communications. Performance model of applications quantifying the computations and communications to be performed by the application. Performance model of a set of heterogeneous processor which is used to estimate the execution time of computations. Performance model of communication network which is necessary to predict the execution time of communication operations. In the operation of external load and

238

paging all processors are supposed to demonstrate the same speed. Each processor is characterized by the two parameters i.e. Current CPU utilizations and the size of current available memory.

The serial code is provided by the application programmer. It is supposed that the code is representative for the computations performed during the execution of the application. The code is performed at runtime in the points on the application specified by the application programmer. It is supposed that the code is representative for the computations performed during the execution of the application. The code is performed at runtime in the points of the application specified by the application programmer. Thus the performed model of the processor provides current estimation of their speed demonstrated on the code representative for the particular application. The number of process executing the algorithm which normally of the parameter the model. The total volume of the computations to be performed by each processor during the execution of the algorithm. The total volume of data transferred between each pair of the process during the execution of the algorithm.

Currently owned and used space from the data user ISP’s. New space obtained by directly from internet

http://sites.google.com/site/ijcsis/ ISSN 1947-5500

(IJCSIS) International Journal of Computer Science and Information Security, Vol. 9, No. 5, May 2011

registries. Customer space private autonomous system currently owned and used data center. A new AS obtained directly from customer internet registries. One to one, One to many, Many to one and Many to many relationships are possible. 25% of the new space must be utilized immediately and 50% of the space is used within one year. To get more space and the added space must be utilized as 80%. The private IP address conflict with other customer networks. When the network communication is initiated and where the application that need to be run and that can be work across NAT

boundaries.[10,11]

Conclusion

In this paper we presented an alternative theory of the internet evolution and developed a new topology generator based on wealth evolution and random walks. Our method reconfigures the VNT gradually by dividing it into multiple stages. This would reduce dramatically the sites of matrices whose pseudo inverse matrices needed to be calculated at each stage. The eventual goal is the practical design of each scheme to achieve the performance outlined in this paper.

Abbreviations

ISP – Internet service Protocol

RFC – Requested flow control

CDN – Content delivery networks

MPI – Multi Program Interface

239

API – Application program interface

SAS – Source address service

PMMI – Phase modulation mobile interface

NAT – Network address technology

VNT – Virtual network terminal

References

1. of

Analysis

peer

to

peer

internet

telephony

protocols

by

Salman

A

Basket

2. Cyber security threats and counter measures by Buheita Fujiwara

3. Network security policy by Frederic

M Avolio July 2007

4. Multimedia content delivery networks by Jian Ni and H K Tsang

5. Evaluation

of

current

high

performance networks Hargrove

by

Paul

6. Enhancing the security of Wi-Fi networks by Paramvir Bahl

7. Wireless sensor networks by F L lewis

8. Flexible resource allocation in 3G networks by Mohamed Al-Fares

9. Wireless communications by Joshua S Gans

10. Open standard and cloud computing

by Michael Zeller Zementics

11. High performance grid computing by Jack Dongarra

http://sites.google.com/site/ijcsis/ ISSN 1947-5500