International Journal of Mechanical Engineering and Computer Sep - Oct 2015
Applications, Vol 3, Issue 5 ISSN 2320-6349
Practical Resource Provision of Overlay Routing Relay
Nodes
P Janardana Rao1, K R Koteswara Rao2
#1Student of M.Tech ,#2 Assoc.Prof, Department of Computer Science and Engineering
Gokul group of Institutions, Bobbili, vizianagaram, AP.
Intersection directing has been proposed as of late as
Abstract:
Superimposed directing is an extremely appealing
a viable approach to accomplish certain steering
plan that permits enhancing certain properties the
properties, without going inside the long and
steering, for example, deferral or TCP throughput
repetitive procedure of institutionalization and
without the need to change the estimations of current
worldwide organization of another steering
underlay steering. Sending overlay directing requires
convention. For instance, overlay steering are utilized
the position and support of the overlay base. This
to enhance TCP execution over the Internet, where
ascents taking after the advancement issue. Locate
the principle thought includes of breaking the end-tothe negligible arrangement of overlay hubs that the
end input circle into littler circles which requires the
required properties of steering fulfilled. In this paper,
hubs equipped for performing TCP Piping would be
I examine this enhancement issue. Demonstrating this
available along the course at generally littlest
is NP-hard and determining non-insignificant guess
separations and a percentage of the illustrations for
calculation for it. I look at the useful parts of the plan
the utilization of overlay directing are papers like
by assessing the addition one can get more than a few
RON and Detour, at where overlay steering is utilized
genuine situations. The first is BGP steering and
to enhance dependability [1]. Yet another illustration
demonstrate that, utilizing the progressive
is the idea of the "Worldwide ISP" worldview, by
information considering the current BGP directing
which an overlay hub is utilized to diminish the
strategy in the web, that a relative little number of
dormancy in BGP steering. Keeping in mind the end
under 100 transfer server is adequate to empower the
goal to convey the overlay directing crosswise over
steering over the briefest way from a solitary source
the genuine physical framework, somebody needs to
to every single self-governing framework, decreasing
convey and oversee overlay hubs that will have the
the normal way length. Second one is extremely
new additional usefulness and with a non-immaterial
valuable for the TCP execution change. Furthermore,
expense both as far as capital and working expenses.
third one is voice-over-IP applications where the little
Accordingly, it is vital to concentrate on the
number of overlay hubs can fundamentally diminish
advantage one gets from enhancing the directing
the maximal shared postponement. Considering BGP
metric against this expense. In this paper, we focus
based most brief way directing over the Internet,
on this point and study the base number of
inquiry is mapped to least number of hand-off hubs
framework hubs that should be included request to
that are required keeping in mind the end goal to
keep up a particular property in the overlay steering
make the steering between a gatherings of
[3]. In the most limited way steering crosswise over
Autonomous Systems. The principle endeavor of this
the Internet BGP-based directing sample, this inquiry
paper takes after three nonstop periods of assessment.
is mapped with the base number of transfer hubs that
In the first place stage manages improvement of a
are required to make the directing between a
wide algorithmic system that can be utilized with
gathering of self-ruling frameworks (ASs) utilize the
proficient asset portion as a part of overlay directing.
hidden briefest way inside of them, In TCP execution
Second stage broaden a nontrivial gauge calculation
, this may finds the insignificant number of hand-off
and demonstrate its properties. Last stage display the
hubs required so as to verify that for every TCP
real advantage one can pick up from utilizing our
association, there is a way inside of the association
proposition as a part of three sensible situations, in
endpoints for which each predefined round-outing
particular BGP directing, TCP change, and VoIP
time [5]. (RTT), there is an overlay hub equipped for
applications
TCP Piping. Despite the particular conclusion
Keywords: Overlay network, Resource allocation,
personality a main priority, we characterize a general
TCP throughput, Autonomous systems (Ass).
advancement issue called the Overlay Routing
Resource Allocation (ORRA) issue and study its
I. Introduction
unpredictability which turns out that the issue is NP-
www.ijmca.org
Page 270
International Journal of Mechanical Engineering and Computer Sep - Oct 2015
Applications, Vol 3, Issue 5 ISSN 2320-6349
hard, and we display a non-minor estimate
calculation for it [4]. Note that in the event that we
are just intrigued by enhancing steering properties
between a solitary source hub and a solitary
destination, then the issue turns out to be simple, and
deciding the ideal number of hubs gets to be paltry
since the potential possibility for overlay
arrangement is less, and task would be great.
However, when we consider one-to-numerous or
numerous to-numerous situations, then the single
overlay hub may influence the way property of
numerous ways, and that prompts the choosing of
best areas turns out to be a great deal less
unimportant [10]. We test our general calculation in
three particular such cases, where we have an
expansive arrangement of source–destination sets,
and the objective includes of discovering the
insignificant arrangement of areas, such that utilizing
overlay hubs as a part of these areas permits to make
(courses are either underlay courses or courses that
utilization these new hand-off hubs) such that a
certain directing property is fulfilled [9]. The primary
situation we consider is AS-level BGP steering, at
where the objective is to locate the insignificant
number of transfer hub areas that can permit most
limited way directing between the source–destination
sets. Review the directing in BGP, which is approach
construct and depends in light of the business
relationship between the peering ASs, and thus, a
significant part of the ways in the Internet don't come
a most brief way (see [5]) The wonder is called as
way swelling, which is the inspiration for the
situations. We consider the one-to-numerous setting
where we need to enhance directing between a
solitary source and numerous destinations. This case
at where the calculation force is generally
noteworthy. since, in numerous to-numerous setting,
there is next to no measure of cover between the most
limited ways, and in this manner won't enhance
totally over the fundamental eager approach.1 We
illustrate, utilizing genuine avant-garde Internet
information, that calculation could propose the
moderately little arrangement of hand-off hubs which
can essentially diminish inactivity in current BGP
steering. The second situation we consider is the TPC
change case talked about above. In this, we test the
calculation on a manufactured irregular chart, and we
demonstrated the general structure could be
connected likewise to this case, results in near ideal
results [8].
II. Related Work
Utilizing connection directing to enhance system
execution is inspired by numerous works that studies
the wastefulness of assortments of systems
administration structural planning and applications.
www.ijmca.org
Examining an expansive arrangement of information,
investigate the inquiry. How great is web directing
from a client's point of view considering roundouting time, parcel misfortune rate, rate, and
transmission capacity? They demonstrated that in
30%-80% of the cases, there is another steering way
with better quality contrasted with the default
directing way. The creators demonstrate that TCP
execution is entirely influenced by the RTT. In this
way, breaking a TCP association into low-dormancy
sub association enhances the general association’s
execution. The creators demonstrate that by and
large, directing in the web are swelled and the real
length (in jumps) of steering ways between customer
is longer than least HOP separation between tham
Using overlay directing to enhance directing and
arrange execution has been considered before in a
few works. In the creators concentrated on the
steering wastefulness in the Internet and utilized an
overlay directing as a part of request to assess and
examine trial procedures enhancing the system over
the genuine environment. While the idea of utilizing
overlay steering to enhance directing plan was
displayed in this work, it didn't manage the
organization perspectives and the improvement part
of such framework .A versatile overlay system
(RON), which is a structural planning for applicationlayer overlay directing to be utilized on top of the
current Internet directing base, has been introduced.
Like our work, the principle objective of this building
design is to supplant the current steering plan, if
fundamental, utilizing the overlay foundation. This
work for the most part spotlights on the overlay
framework (observing and distinguishing steering
issues, and keeping up the overlay framework), and it
doesn't consider the expense connected with the
arrangement of such framework. Here principally
concentrates on hand-off situation issue, in which
hand-off hubs ought to be put in an intra-area system.
An overlay way, for this situation, is a way that
comprises of two most limited ways, one from the
source to a hand-off hub and the other from the
transfer hub to the destination. The target capacity in
this work is to discover, for every source–destination
match, an overlay way that is maximally disjoint
from the default most limited way. This issue is
spurred by the solicitation to expand the strength of
the system if there should be an occurrence of switch
disappointments. They present a directing
methodology, which replaces the briefest way
steering that courses activity to a destination by
means of foreordained middle of the road hubs
keeping in mind the end goal to maintain a strategic
distance from system blockage under high movement
variability. The main to really ponder the expense
Page 271
International Journal of Mechanical Engineering and Computer Sep - Oct 2015
Applications, Vol 3, Issue 5 ISSN 2320-6349
connected with the arrangement of overlay steering
framework. Considering two fundamental cases,
versatile directing, and TCP execution, they detail the
middle of the road hub position a san streamlining
issue, where the goal is to put a given number
transitional hubs keeping in mind the end goal to
improve the overlay steering and proposed a few
heuristic calculations for every application. Taking
after this profession, the asset distribution issue in
this paper as a general system that is not attached to a
particular application, but rather can be utilized by
any overlay plan. In addition, not at all like heuristic
calculations, the estimation arrangement calculation
introduced in our work, catching any overlay plan,
guarantees that the organization expense is limited
inside of the calculation guess proportion. Hub
position issues have been contemplated before in
distinctive settings in numerous works, considering
web store and web server situation .overlay hub
arrangement is in a general sense not quite the same
as the clients.
III. Performance Measurements
A. Effective Link-level SINR Measurement the SINR
in each MS is a good measurement to evaluate the
performance of the overall system. At every sampling
duration TS, the SINR in each MS is measured and
the average SINR of the MS is updated. Then, the
average SINR of all MSs in one cell is considered as
the effective SINR of the cell. Assuming that the
multi-path fading magnitudes Mp(t) and phases θp(t)
for the kth MS are constant for the sampling duration.
These values are calculated and updated using Jakes’
fading model after each sampling duration TS. The
frequency selective fading power profile value for the
i th sub-carrier of the kth MS at time t = nTS can be
calculated as [7]: Pk i [n] =
paths p=1 Mk p [n]Ak
2 , (1) where p represents
pej[θk p [n]−2πfiT k p ]
the multi-path path index, Ap and Tp are the
amplitude value corresponding to the long-term
average power and the relative time delay for the pth
path (from Table 21 in [7], Table 2-1 in [8]); and fi is
the relative frequency offset of the i th sub-carrier
within the spectrum. It is assumed here that the
fading profile is normalized so that E[P(i)] = 1. Then,
the i th sub-carrier SINR for the kth MS at time t =
nTS, γk i [n], can be calculated at system level as a
function of the sub-carrier power, the instantaneous
geometry (Gk[n]), the FFT size (N), the cyclic prefix
length (Np), the percentage of maximum total
available transmission power allocated to data subcarriers (RD = 80%), and the percentage number of
data sub-carriers over the number of total useful subcarriers per time slot (NSD/NST = 90%): γk i [n] =
Pk i [n] × Gk[n] × N N + Np × RD NSD/NST . (2)
The instantaneous geometry at time t = nTS for MS
www.ijmca.org
k: Gk[n] = Ior[n] N0 + S s=1 Is oc[n] , (3) where S is
the number of interfering sources for MS k
(consisting of all other BSs and relays using the same
resources that are allocated for MS k), N0 is the
variance of thermal noise, Ior is the received level
from the serving source over fast fading, and Is oc is
the received level from the sth interfering source over
fast fading. Effective SINR mapping for the kth MS
at time t = nTS is computed as: SINRk ef f [n] = −β
ln 1 Nu i∈Nu e− γk i [n] β , (4) where β is a
parameter based on the modulation and coding rate
combination at the transmitter (from Table 24 in [7]),
and Nu is the set of assigned sub-carriers for MS k.
Then, the average effective SINR for the kth MS is
updated to the time t = nTS: SINRk ef f = n i=1
SINRk ef f [i] n (5) B. System-level SINR
Measurement The performance of the system-level
simulation is determined based on the average of all
link-level performances. Hence, the effective celledge SINR can be determined as: SINRedge =
k∈Nedge SINRk ef f Nedge , (6) where Nedge is the
set of MSs in the cell-edge of given cell. The total
transmitted data rate of the kth MS is calculated: Rk
= Bk subcarrier log2(1 + SINRk ef f ) (7) where Bk
subcarrier is the total bandwidth of the assigned subcarriers for the kth MS. Then, the total cell-edge data
throughput is: Redge = k∈Nedge Rk (8) V
IV. Proposed System:
In the proposed system, the system concentrates on
this point and study the minimum number of
infrastructure nodes that need to be added in order to
maintain a specific property in the overlay routing. In
the shortest-path routing over the Internet BGP-based
routing example, this question is mapped to: What is
the minimum number of relay nodes that are needed
in order to make the routing between a groups of
autonomous systems (ASs) use the underlying
shortest path between them? In the TCP performance
example, this may translate to: What is the minimal
number of relay nodes needed in order to make sure
that for each TCP connection, there is a path between
the connection endpoints for which every predefined
round-trip time (RTT), there is an overlay node
capable of TCP Piping? Regardless of the specific
implication in mind, we define a general optimization
problem called the Overlay Routing Resource
Allocation (ORRA) problem and study its
complexity. It turns out that the problem is NP-hard,
and we present a nontrivial approximation algorithm
for it.
Page 272
International Journal of Mechanical Engineering and Computer Sep - Oct 2015
Applications, Vol 3, Issue 5 ISSN 2320-6349
Fig. Proposed System Architecture
V. Proposed Algorithm
The orthogonal resource allocation algorithm
(ORRA) is an indispensable integrated part of the
new OCWSAR system to obtain a frequency reuse
factor of 1 and reduce the ICI. The sf f f A ( 4 5 6)
s( 1 2 3) ff f
C Fig. 3. A possible
scenario to convert the frequency in one sector.
Details of the proposed ORAA are described in Fig.
4. Each cell is physically divided into three sectors:
X, Y, and Z. the relays are located at the cell-edge
area of each sector. To obtain a frequency reuse
factor of 1, each sector can use the total system
frequency resources. However, the frequency
resource allocated for each MS follows a certain
priority, based on the location of the MS and the
available resource. A. The algorithm at the BS
Firstly, the proposed ORAA is implemented at BSs
for BSinner MS (B-iM) and BS-relay (B-R)
communications. With the above frequency
converting scheme for relays, any subcarrier used in
the cell edge areas can be reused for B-iM
communications with a much reduced transmission
power. To make the distance between the sub-carriers
used by the inner MSs and the edge MSs of the same
sector as far as possible, the BS searches for available
sub-carriers in each sector starting in the opposite
direction to the relay search, as shown in Fig. 4.
Available sub-carriers are the sub-carriers that have
not been used for B-iMS and B-R communications in
the same sector. That is, for inner MSs in sector X,
the BS will start searching from the rightmost point
of the system bandwidth to the left. Similarly, the BS
will start searching both from the leftmost and
rightmost points to the center or from the leftmost
point to the right of the system bandwidth if inner
MSs are located in sector Y or Z, respectively. Table
I shows the pseudo code of the ORAA at BSs. B. The
algorithm at the relay Secondly, the proposed ORAA
is implemented for Relay edge MS (R-eM)
communications. Assuming that the kth edge MS
located in the cell-edge of sector X starts to activate,
the serving relay will start to search for available sub-
www.ijmca.org
carriers from the left of the system bandwidth to the
right. The first available sub-carriers will be assigned
to the kth edge MS. Available sub-carriers are the
sub-carriers that have not been used by other edge
MSs in the same cell-edge and the adjacent cell edge
areas of MS k. In this case, the adjacent cell-edge
areas of MS k are denoted as A1, A2, A3, and A4
VI. Future Enhancement
Hybrid Location-based protocol (HLAR) combines a
modified AODV protocol with a greedy-forwarding
geographic routing protocol. The expected
transmission count (ETX) metric to find the best
quality route. The modified form of AODV as
AODV –ETX, intermediate nodes report the broken
routes to their source node. To allow nodes to
calculate the quality (ETX) of shared links, nodes to
locally beacon packets periodically. The periodic
beacon packets include the node’s ID and the current
location coordinates. HLAR initiates the route
discovery in on-demand fashion. The RREQ packets
include a time-to-live (TTL) will be the source node
according to the hop count between the source node
and destination node. The TTL field is decremented
each time a current node cannot use location
information and RREQ Packet will be dropped once
its TTL field become zero. It allows the protocol to
avoid unnecessary flooding of the whole network. A
destination node replies to receives RREQ Packets
with a route reply (RREP) packets in three cases: 1. If
RREQ packet is first receives from source node 2. If
RREQ packet contains a higher source sequence
number than RREQ packets responded to the
Destination Node. 3. If RREQ Packet contains same
source sequence number as RREQ Packets respond
by the destination node, but the new packet indicates
a better quality route is available.
VII. Conclusion
In this paper, we addressed the fundamental problem
by developing an approximation algorithm to the
problem. Rather than considering a customized
algorithm for a specific application or scenario, we
suggested a general framework that fits a large set of
overlay applications. Considering three different
practical scenarios, we evaluated the performance of
the algorithm, showing that in practice the algorithm
provides close-to-optimal results. Improving routing
properties between a single source node and a single
destination, then the problem is not complicated, and
finding the optimal number of nodes becomes trivial
since the potential candidate for overlay placement is
small, and in general any assignment would be good.
However, when we consider one-to-many or manyto-many scenarios, then a single overlay node may
affect the path property of many paths, and thus
choosing the best locations becomes much less
Page 273
International Journal of Mechanical Engineering and Computer Sep - Oct 2015
Applications, Vol 3, Issue 5 ISSN 2320-6349
trivial. For example, the one-to-many BGP routing
scheme can be used by a large content provider in
order to improve the user experience of its customers.
The VoIP scheme can be used by VoIP services such
as Skype, Google Talk to improve call quality of
their customers. Many issues are left for further
research. One interesting direction is an analytical
study of the vertex cut used in the algorithm.
References
[1] J. Zhu, G. Liu, Y. Wang, and P. Zhang, ”A hybrid
inter-cell interference mitigation scheme for OFDMA
based E-UTRA downlink,” APCC’06.
[2] Y. J. Zhang and K. B. Letaief, ”Adaptive resource
allocation and scheduling for multiuser packet-based
OFDM networks,” IEEE ICC 2004.
[3] T. C. H. Alen, A. S. Madhukumar, and F. Chin,
”Capacity enhancement of a multi-user OFDM
system using dynamic frenquency allocation,” IEEE
Trans. on Broadcast., vol. 49, no. 4, pp. 344-353,
Dec. 2003.
[4] O. Mubarek, H. Yanikomeroglu, and S.
Periyalwar, ”Dynamic Frequency Hopping in
Cellular Fixed Relay Networks”, VTC 2005-Spring.
[5] Z. Kostic and N. Sollenberger ”Performance and
Implementation of Dynamic Frequency Hopping in
Limited-Bandwidth Cellular Systems,” IEEE Trans.
on Wireless Comm. vol.1, no.1, Jan. 2002.
[6] K. Yamamoto and S. Yoshida, ”Analysis of
Reverse Link Capacity Enhancement for CDMA
Cellular Systems Using Two-Hop Relaying,” IEICE
Trans. Fundamentals, vol. E87-A, no. 7, Jul. 2004.
[7] 3rd Generation Partnership Project; Technical
Specification Group Radio Access Network;
Feasibility Study for Orthogonal Frequency Division
Multiplexing (OFDM) for UTRAN enhancement,
3GPP TR 25.892 V6.0.0 (2004-06).
[8] Spatial Channel Model Text Description, SCM132, V5.0 (2003-04).
[9] H. Tangmunarunkit, R. Govindan, S. Shenker,
and D. Estrin, “The impactof routing policy on
Internet paths,” in Proc. IEEE INFOCOM,2001, pp.
736–742.
[10] M. Cha, S. Moon, C.-D.Park, and A. Shaikh,
“Placing relay nodes forintra-domain path diversity,”
in Proc. IEEE INFOCOM, Apr. 2006, pp.1–12.
[11] M. Kodialam, T. V. Lakshman, and S. Sengupta,
“Efficient and robustrouting of highly variable
traffic,” in Proc. HotNets III, 2004.
[12] S. Roy, H. Pucha, Z. Zhang, Y. C. Hu, and L.
Qiu, “On the placementof infrastructure overlay
nodes,” IEEE/ACM Trans. Netw., vol. 17, no.4, pp.
1298–1311, Aug. 2009.
[13] L. Qiu, V. N. Padmanabhan, and G. M. Voelker,
“On the placementof Web server replicas,” in Proc.
IEEE INFOCOM, 2001, vol. 3, pp.1587–1596.
www.ijmca.org
[14] E. Cronin, S. Jamin, C. Jin, A. R. Kurc, D. Raz,
and Y. Shavitt, “Constrainedmirror placement on the
Internet,” in Proc. IEEE INFOCOM,2001, vol. 1, pp.
31–40.
[15] M. R. Garey and D. S. Johnson, Computers and
Intractability: AGuide to the Theory of NPCompleteness. San Francisco, CA, USA:Freeman,
1979.
Page 274