Multy Layers Networks

In  this  paper
proposes
security  issues  and  its  solution  for  WiMAX  network.  Jamming  and  Scrambling  is  main  security  issues  regarding
Physical Layer. The lack of Physical infrastructure of wireless networks is inherently less secure. In this paper propose se
curity issues and its solution for
WiMAX network. Jamming and Scrambling is main security issues regarding Physical Layer. The lack of Physical infrastructure o
f wireless networks is
inherently less secure. The performance analysis of the WiMAX system has
been carried out for single and multicarrier jamming. It has been found that
the performance of the system varies significantly with different jamming signals. The performance of the WiMAX system has be
en studied under the
influence of the basis of Modulat
ion schemes (QPSK, BPSK, 16 QAM and 64 QAM), Types of antennas (Sector antenna, Omni directional antenna and
isotropic antenna) and Throughput on the basis of number of subcarriers destroyed. On the basis of simulation results and per
formance analysis foun
d
that  the  performance  of  BPSK  and  QPSK  is  better  than  other  modulation  scheme  under  single  carrier  jamming.  WiMAX  sector  anten
na  gives  better
performance than isotropic and WiMAX Omni antennas. Throughput is reduced when data subcarriers are destroyed in
uplink and downlink.  Uplink is
more  sensitive  to  data  subcarrier  reduction  compare  to  downlink.  The  performance  of  the  downlink  PUSC  is  better  than  uplink  P
USC  under  the
influence of the multicarrier jamming.

IJHMI - ASDFJournals.com

Computer Networking: A Top Down Approach , 5th edition. Jim Kurose, Keith Ross Addison-Wesley, July 2007. ... Our goal: ❑ get “feel” and terminology ❑ more depth, detail later in course ❑ approach: ❖ use Internet as example ... Overview: ❑ what's the Internet? ❑ ...

In this paper we introduce a new model to represent an interconnected network of networks. This model is fundamental to reason about the real organization of on-line social networks, where users belong to and interact on different networks at the same time. In addition we extend traditional SNA measures to deal with this multiplicity of networks and we apply the model to a real dataset extracted from two microblogging sites.

The rapid increase of the bandwidth demand have led to the growth of optical communications which are used for implementing not only backbones but also access networks. Due to the sensitivity of the applications relying on optical networks, security becomes a major concern. The paper evaluates the performance of the optical firewall proposed in [6] which is able to protect Optical Burst Switched (OBS) networks against physical layer attacks. We first describe the architecture of the optical firewall. Then, we present the design of the BHP (Burst Header Packet) waiting module which is the main component of the optical firewall architecture. Finally, we propose a simulation of the waiting module in order to evaluate the performance of the firewall.

http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=6149836

n this paper we introduce a new model to represent an interconnected network of networks. This model is fundamental to reason about the real organization of on-line social networks, where users belong to and interact on different networks at the same time. In addition we extend traditional SNA measures to deal with this multiplicity of networks and we apply the model to a real dataset extracted from two microblogging sites.

Quality of Service (QoS) provisioning in networks requires proper scheduling algorithm. Internet traffic,
especially real-time multimedia applications, is bursty in nature . Hence, in addition to the service rate
which is commonly used to isolate service of sessions, other parameters should be involved. In this paper
a scheduling algorithm is proposed that attempts to provide a balance between bursty and non-bursty
(smooth) traffic. We improve thewell-known packet scheduling algorithm, SCFQ.Our proposed algorithm
is proficient to compensate an adjustable amount of missed service to each session. The average delay of
the proposed algorithm is evaluated by simulation. An important advantage of our algorithm is that
byselecting correct parameter setting for each session, the average delay of a bursty session can be
reduced. Furthermore, compared to SCFQ our proposed algorithm does not necessitate any additional
computation.