a
Department of Computing
BSc(Hons) Computer Networks and Security
ASSIGNMENT
Level:
Module:
Assignment:
6 (Full-time equivalent Year 3)
COM635 Network Management
Routing protocol design
Submission deadline: :
11:55 pm, Sunday 27th December 2020
Estimated completion time:
Set by:
Verified by:
25 hours
Nigel Houlden
Vic Grout
To be completed by student:
I certify that, other than where collaboration has been explicitly
permitted, this work is the result of my individual effort and that
all sources for materials have been acknowledged. I also confirm
that I have read and understood the codes of practice on
plagiarism contained within the Glyndwr Academic Regulations
and that, by signing this printed form or typing my name on an
electronically submitted version, I am agreeing to be dealt with
accordingly in any case of suspected unfair practice.
Are extenuating circumstances being claimed?
YES / NO
Name:
-----------------------------------------------------------------------------Student number:
-----------------------------------------------------------------------------Date submitted:
-----------------------------------------------------------------------------Signature:
If so, give reference number:
--------------------------------------
1
To be completed by lecturer:
Summary of specific feedback on this work:
Summary of advice for improvement of future work:
Detailed comments follow, either on separate sheets or annotated to student’s work …
Grade/Mark:
Assignment Brief
The selection of an appropriate Routing Protocol is an important management decision; it must fit with the network
design overall and be scalable. To give you a deeper insight into why the choice of Routing protocol is important, you are
tasked to design your own.
For this assignment you are to design a theoretical routing protocol. During your lectures you will have covered how
many of the more common Routing Protocols calculate ‘cost’, use metrics and how frequently they pass updates.
Your final design although theoretical must work with the Internet Protocol (IP): either IPv4, IPv6 or both.
You must consider the factors above and others that you think are relevant when designing your Routing Protocol.
Your submission should be a 3000 (±10%) word report. Tables, references and diagrams will not be included in the
word count.
The submission must be via Moodle in Microsoft Word format.
Example (non-exhaustive)
C= kb+
1
k2b
256 − l
k5
+ kd
[1]
3
r−k
4
Equation [1] gives the cost calculation for EIGRP, indicating the K values and which metrics they influence, your
Routing Protocol must have a cost calculation. The calculation you produce will obviously include metric(s) values, you
must justify why you have made these selections.
Figures 1 and 2 show the packet format and the internal packet route format for EIGRP, the structure of figure 2 is a
Type, Length, Value (TLV) that fits in to the EIGRP packet format. Table 1 gives the description of each field in the
EIGRP packet format. Your design should have similar figures showing the structure of a routing packet.
Version (8)
Opcode (8)
Flags (32)
Sequence Number (32)
Checksum (16)
2
Acknowledgment Number (32)
Autonomous System Number (32)
Type (16)
Length (16)
Value (32)
Other Type, Length and Value (TLV’s)
Figure 1 EIGRP Packet Format
Next Hop (32)
Delay (32)
Bandwidth (32)
Reliability (8)
Prefix Length (8)
MTU (24)
Load (8)
Hop Count (8)
Reserved (16)
Destination (8 / 16 / 24 / 32)
Figure 2 EIGRP IP Internal Route Packet Format
Field
Version
Opcode
Checksum
Flags
Sequence &
Acknowledge
Type / Length /
Value
Description
Identifies the EIGRP process version
Identifies the EIGRP packet type – Update (0x01), Query (0x03), Reply (0x04), Hello (0x05). It
determines the TLVs that follow the EIGRP header.
The checksum of the entire EIGRP packet, excluding the IP header.
1st LSB bit (0x00000001) – Initial bit, used indicate the first set of routing updates upon establishing
a new neighbour relationship.
2nd LSB bit (0x00000002) – Conditional Receive bit, used in the Cisco proprietary reliable multicast
protocol – Reliable Transport Protocol (RTP).
Used by RTP for reliable EIGRP message exchange.
TLVs are comprise of a 16-bit Type field, a 16-bit Length field, and a vary number of fields depends
on the type of TLV.
General TLVs:
0x0001 – EIGRP parameters – K values and hold time. Size of 12 bytes.
0x0002 – Message Digest 5 (MD5) authentication data. Size of 40 bytes.
0x0003 – Sequence. Used by RTP.
0x0004 – Software versions – IOS and EIGRP release versions. Size 8 bytes.
0x0005 – Next Multicast Sequence. Used by RTP.
0x0006 – EIGRP stub parameters.
IP TLVs:
0x0102 – IP internal route. Size of 28 bytes.
0x0103 – IP external route. Size of 48 bytes.
Table 1Description of EIGRP Packet Structure
Your design should have originality, justification, simplicity and a packet structure.
Guidance
3
Students are encouraged to make a prompt start on assignment work and are given appropriate support to do so. All
material submitted for review by the cut-off date above will receive formative feedback allowing the work to be developed
and improved. Any guidance given after the cut-off date above may, depending on its level and nature, be taken into
account in the grading criteria that follow.
Also note that, although it will be fairly easy, to come up with a cost/objective metric/function and packet structure, higher
marks will only be gained for properly assessing and justifying your choices.
Grading Criteria
A grade C will be awarded for a report that shows awareness of essential routing requirement, possibly achieved
with significant guidance after the review cut-off.
A grade B will be awarded for a report that shows improved awareness of, and insight into, routing protocol
technologies, showing originality, possibly achieved with some guidance after the review cut-off. There will
be some justification of solutions offered.
A B+ grade will be awarded for a report that shows significant awareness of, and insight into, relevant routing
technologies, including strategies for future development of the Routing protocol, achieved with minimal
guidance after the review cut-off. There will be good justification of solutions offered.
An A grade will be awarded for a design showing everything from a B+ grade criteria plus integration with current
routing technology, achieved with no guidance after the review cut-off. There will be convincing justification of
solutions offered.
Learning Outcomes
1. Evaluate network provision and compare solutions KS1 –KS10
2. Apply appropriate modelling, simulation and optimisation techniques in
network planning. KS1, KS4, KS6, KS7,KS10
4. Make informed judgements relating to diverse networking algorithms KS1,KS4,
KS6, KS7,KS10
5. Compare and contrast existing and emergent networking technologies KS1 –KS10
4
5
Contents
Introduction .............................................................................................................................................................7
Apply appropriate modelling, simulation and optimisation techniques in network Planning. ............................13
Calculating Cost ......................................................................................................................................................13
The routing protocol calculates cost................................................................................................................13
Packet Headers ......................................................................................................................................................14
Operation ...............................................................................................................................................................15
Overhead................................................................................................................................................................15
Make informed judgements relating to diverse networking algorithms ..............................................................16
Compare and contrast existing and emergent networking technologies .............................................................17
Cost of various access technologies ......................................................................................................................17
References .............................................................................................................................................................20
6
Introduction
In the world of computer networks, there are two important components that are known as the source and
destination. The information that is passed is said to be communicated from these two components time to time.
They are different kinds of paths that can be considered. Therefore the process of selecting the best path over
other paths is known as routing which is done by programmed devices known as protocols. There are standard
protocols that help us to ensure the safety of data transfer. The use of a routing protocol basically connects and
reaches various end points that allows to collaborate failures that take place in links and nodes as well as additions
and withdrawals of other addresses. The use of routing protocols is that they are most typically distributed as it
runs on every specific router that is connected in a network. The purpose of a routing protocol is that it
acknowledges the way how routers have their means of communicating to each other as well as enhancing them
to collaborate with certain nodes that can be found in a computer network
1. Evaluate network provision and compare solutions
Overview of Routing Protocols
The purpose of routing protocols is to learn about open courses that exist in an attempt to coordinate, produce
steering tables and decide on protocol choices. RIP, IGRP, EIGRP, OSPF, IS-IS, and BGP are perhaps the most
well-known directional conventions. Although a broad variety of steering conventions are defined by those two
types, there are two basic routing protocol types. The important forms include relation state and separation vector
conventions.
Distance vector protocols advertise their steering table at ordinary continuous spans to all easily associated
neighbors using a great deal of data transmission and are delayed to reach. All switch tables must be refreshed
with that new data at the point where a course becomes unavailable. With and switch advertising new data to its
neighbors, the problem is that it takes a long effort for all switches to have a current precise system perspective.
Separation vector conventions make use of non-adaptable fixed-length subnet veils.
Connect state protocols advertise routing changes only as they happen, all the more efficiently using transmission
power. Switches do not publicize the steering table, making it faster to merge. The routing convention would
flood the system with new course data linking state ads to all neighbor switches per zone attempting to access the
system. The incremental shift is all that is advertised as a multicast LSA update to all switches. They use subnet
covers of variable length, which are flexible and tend to be all the more effective.
7
Open shortest path first – OSPF
Accessible Shortest Path First is a convention for a genuine link state established as an open standard for steering
IP through large multi-merchant systems. In order to impart course info, a link state convention will send interface
state promotions to every single associated neighbor of a similar territory. When started, each OSPF-enabled
switch will send hi-bundles to all legally related OSPF switches.
Data, such as switch clocks, switch ID, and subnet cover, are included in the welcome parcels. They become
OSPF neighbors in the event that the switches agree on the details. When switches become neighbors, they
generate adjacencies by entering state databases when trading. Thus, adjacencies are set up by switches on
highlight point and highlight multipoint joins (as defined by the OSPF interface typesetting).
An allocated switch will be used by switches with OSPF interfaces arranged as communicate (Ethernet) and
NBMA (Frame Relay) to set these adjacencies.
Areas
With doled out regions aligned with a central spine of switches, OSPF uses a chain of value. Each region is
distinguished by at least one switch that is adjacent to each region. Spine zone 0, stub zones, not very squat areas,
and dense regions have been characterized by OSPF. Zone 0 is used to collect switches connected to an allocated
office or WAN connections around a few workplaces. Both territory 0 switches associated with a complete job
using an Ethernet fragment at a center office are desirable. This accommodates superior parceling of the area and
forestalls should a switch association fall flat. Area 0 is the travel area for all traffic coming from the regions that
have been joined together. Any traffic between the zones must first pass through region 0. Stub territories use a
default course to send traffic bound for an external device, such as EIGRP, since no outer courses are sent or
received by the zone fringe switch. Between the zone and the intra-territory zone
Thickset territories are a specific Cisco that utilizes a default path between region and external objectives. The
ABR does not submit or get LSA's from outside or between territories. External courses with type 7 LSA would
be publicized by the not very thick zone ABR. Outer courses are not provided in that form of region. It is not
shocking to be directed between territory and intra-zone. Internal switches, spine switches, territorial outskirt
switches (ABR), and self-ruling system limit switches are defined by OSPF (ASBR). The internal switches to one
territory are clear. Territorial outskirt switches have interfaces that are distributed to more than one region, such
as zone 0 and region 10, respectively. An individual system limit transfer has OSPF assigned interfaces and an
alternative guidance convention, such as EIGRP or BGPP. When a territory has no immediate association with
region 0, a virtual link is used. For an area that is not associated with region 0, a virtual link is formed between a
territorial fringe switch and a zone outskirt switch for a region associated with region 0. The design of the region
8
requires the consideration of the topographical area of workplaces and traffic flows across the enterprise. It is
necessary to have the option of summing up addresses per zone for certain workplaces and restricting
communication traffic.
Convergence
With the SPF (Dijkstra) calculation, which determines the shortest way from source to target, fast union is
cultivated. From running SPF, the guiding table is operated, which specifies all courses from neighbor switches.
Because each OSPF switch has a duplicate of the geography database and the guiding table for its particular area,
any course changes are distinguished faster than the conventions of the separation vector and backup action
courses are resolved.
Assigned Router
For example, Ethernet and Non-Broadcast Multi-Access communications systems such as Frame Relay have an
assigned switch (DR) and a reinforcement assigned switch (BDR) that are selected. Assigned switches set up
adjacencies on that system section on all switches. This is to eliminate communications from all switches that
give their neighbors ordinary hi-bundles. The DR sends multicast packages to all switches for which it has set up
neighborhoods. It is the BDR that sends multicasts to specific switches in the event that the DR fizzles. A switch
ID is appointed to any switch, which is the highest relegated IP address on a working interface. For all guiding
procedures, OSPF uses the switch ID (RID).
Characteristics
Connection State
• Routes IP
• Routing Ads: Partial when changes to courses happen
• Metric: Composite Cost to Destination of every switch (100,000,000/interface speed)
• Hop Count: Zero (Limited by Network)
• Subnet Masks of Variable Length
• Network Class Address or Subnet Boundary Summarization
• Load adjusting across 4 equivalent cost courses
• Forms of Router: Internal, Backbone, ABR, ASBR
• Types of region: Backbone, Stubby, Not-So-Stubby, Stubby Totally
• Types of LSA: intra-region (1,2), between territory (3,4), outer (3,4), outside (5,7)
• Timers: Interval of Hello and Interval of Dead (extraordinary for network types)
• LSA Multicast Address: Don't Filter! 224.0.0.5 and 224.0.0.6 (DR/BDR)
• Types of Interface: Point to Point, Broadcast, Non-Broadcast, Multipoint Point, Loopback
9
Border Gateway Protocol – BGP
The Border Gateway Protocol is a convention on the outside door, which is special in comparison to the
conventions on the inside entryway discussed so far. The qualification is important because to some degree, the
term independent framework is used differently with conventions, such as EIGRP, than with BGP. BGP course
between self-governing systems, which are assigned a particular AS number, for example, outside door
conventions. With one or a few BGP switches, AS numbers may be assigned to an office. Target IP addresses
and associated AS-Path to achieve the goal and a next-bounce transfer address are included in the BGP guiding
table. The AS-Path is an array of AS numbers connected with steering packages that speak to every office. Balance
that with EIGRP, which also uses standalone frameworks. The thing that matters is that their systems of selfruling allude to a clear set of switches within the equivalent authoritative system.
Multiple self-ruling systems can be coordinated by an EIGRP scheme. The company thoroughly supervises them
for the characterization of course rundown, allocation, and sifting. Internet Service Providers (ISP) and large
business companies that have double-homed web connections with single or double switches housed to similar
or distinctive Internet Service Providers use BGP for a lot. BGP can coordinate course bundles over an ISP, which
is a separate field of instruction supervised by them.
The ISP has its own AS number named by InterNIC, which is doled out. New customers may either demand an
AS task from the ISP or InterNIC for their office. When using BGP, an exceptional AS number task is expected
for clients when they interface. A particular request or grouping has 10 characterized characteristics, which BGP
uses as metrics to determine the best way to achieve a target.
At their switch, organizations with just one circuit connection with an ISP will perform a default course that
advances any bundles that are connected to an outer device. With all IGP switches on the system (EIGRP, RIP,
OSPF, etc that involve the trading of complete steering tables, BGP switches can redistribute guiding data
(peering). Steady notifications are sent with geography adjustments when it is completed. In comparison to
sending/accepting the entire web steering table, each BGP switch can be arranged to channel guiding contact with
course maps.
10
BGP Routing Table Components

Destination IP Address / Subnet Mask

AS-Path

Next Hop IP Address

Interior Gateway Routing Protocol (IGRP)

Interior Gateway Routing Protocol is a separation vector steering convention created by Cisco Systems
for directing various conventions across little and medium-sized Cisco systems.
It is special and allows you to use Cisco switches. This is different from the IP RIP and IPX RIP developed for
multi-seller systems.
IGRP trains IP, IPX, DECnet, and AppleTalk, making it adaptable for clients with a wide variety of conventions.
It is more adaptable to a degree than RIP as it underpins a bounce tally of 100, only advertises at regular intervals,
and uses a composite of five different measures to pick the best way target.
Note that because IGRP encourages less as much as possible, it uses less transfer speed than RIP, but combines
much more slowly as it is 90 seconds before IGRP switches are aware of changes in system geography. The role
of different self-sufficient structures is interpreted by IGRP and thus sums up the organization of class limits.
There is also the possibility of stacking balance traffic through equivalent or inconsistent cost methods of
measurement.
Characteristics
• Vector of distance
• IP, IPX, Decnet, Appletalkk courses
Steering Table Advertisements Every 90 seconds
Transfer speed, Latency, Reliability, Load, MTU Size Metric:
• Count of Hops: 100
Set Subnet Masks for Duration
Organization Class Address Summarization
Burden Balancing across 6 cost ways same or inconsistent ( IOS 11.0 )
• Metric Formula = least course of objective BW * Delay (usec)
Split Horizon
Clocks: Invalid Timer (270 seconds), Flush Timer (630 seconds), Timer Hold-down (280 sec)
11
Enhanced Interior Gateway Routing Protocol (EIGRP)
The Enhanced Interior Gateway Routing Protocol is a convention established by Cisco Systems to steer multiple
conventions over a Cisco organization. It has characteristics of both separation vector steering conventions and
state-directing conventions of connections. It is special and allows you to use Cisco switches. In order to choose
the best way target, EIGRP will implement similar conventions to IGRP courses (IP, IPX, Decent, and Appletalk)
and use indistinguishable composite measurements from IGRP.
There is also the possibility of stacking balance traffic through comparable or inconsistent cost methods of
measurement. Outline is programmed at an address of the device class anyway, it can also be configured to sum
up at subnet limits very well. IGRP and EIGRP are also programmed for redistribution. A jump tally of 255 and
variable-length subnet covers are provided.
Combination
It is faster to combine with EIGRP because it uses a calculation called double update calculation or DUAL, which
is run when a switch distinguishes that a particular course is unavailable. The switch asks its neighbors for a
realistic alternative. That is defined as a neighbor with a particular target that does not trigger any guiding circles
with the lowest cost path. With the new course and the corresponding measurements, EIGRP will update its
steering table. Course modifications are uniquely encouraged to affect switches as changes occur. That uses
transfer speed more efficiently than conventions for separation vector steering.
Autonomous Systems
The role of different self-ruling systems, which are types operating under the identical management space, is
viewed by EIGRP. Doling out different independent structure numbers, for instance, with OSPF, is not for
characterizing a spine. It is used with IGRP and EIGRP to alter course redistribution, sifting, and emphasis
outlines.
Characteristics
• Vector for Advanced Distance
• IP, IPX, Decnet, Appletalkk courses
• Routing Ads: Partial when changes to courses happen
• Bandwidth, Latency, Reliability, Load, MTU Size Metrics:
12
• Hop Count: 2555.
• Subnet Masks of Variable Length
• Network Class Address or Subnet Boundary Summarization
• Load Balancing across 6 cost ways same or inconsistent (IOS 11.0)
• Timers: Active time Active time (180 sec)
• Metric Calculation = least objective course BW * Delay (msec) * 256
• Split Horizon
• Address of LSA Multicast: 224.0.0.10
2. Apply appropriate modelling, simulation and optimisation techniques in network Planning.
The routing protocol allows communication nodes to share information on different networks to establish and
maintain routing tables. Examples of documented routing protocols are: RIP, IGRP, EIGRP, OSPF. Common
specific routing protocols can be followed by routers, which can create forwarding tables for different routing
protocols. For routing, convergence times and fault detection, that requires table sizes.
Calculating Cost
The routing protocol calculates cost
The routing protocol decides, using an algorithm, which route is the shortest to a destination. In reality, to
determine the cost of the routes, each routing algorithm uses metrics. Metrics are commonly characterized as
attributes such as hop count, latency, delay, load, and efficacy. The routing configuration is dependent upon the
parameters used. RIP uses only the interpretation of statistics on the hop count. Maximal latency and bandwidth
are used by IGRP, although other parameters are also modified.
Present a formula and explain it if appropriate.
The Cost Calculation mentioned here
Composite matrix is used to measure the value, which is often used for research purposes by neighbors. This is in
beliefs
KS1 (Bandwidth) – 32
KS2 (Load) – 8
13
KS3 (Delay) – 32
KS4 (Reliability) – 8
KS5 (MTU) – 24
As only bandwidth and delay is employed to calculate the value. The formula used for cost calculation is
EIRGP Metric – 256* ((KS1*Bandwidth) + (KS2*Bandwidth)/(256-Load) + (KS3*Delay)*(KS5/(Reliability +
KS4)))
As values of KS1 and KS3 are set to 32, and KS2 and K4 are set to eight and KS5 is about to 24. Therefore the
formula becomes
Metric = 256* (Bandwidth + Sum of all Delay) Where the bandwidth – (10^7/least bandwidth) and Delay = (sum
of all delays / 10)
Packet Headers
14
Table 1
Operation
As with standard DV protocols such as RIP and IGRP, EIGRP does not expect routine changes: routing
modifications can be made only if a change happens. If a route is missing, the modifications stop; null and flush
timers extend and expand (the timers are not reset) before the direction of the routing table is eventually flushed
off. Periodic shifts make up for this convergence loop. The EIGRP-built solution has the benefit that periodic
updates would not consume grid resources. To assess neighborly relations and accept a neighbor's absence, EIGRP
relies on small packets of greetings.
EIGRP requires secure synchronization for all communications surrounding it. Neighbors accept notices and if
an acknowledgment is not received, EIGRP can retransmit the post. EIGRP makes use of the Diffusing Update
Algorithm for all route computations (DUAL). DUAL's convergence distances are smaller than traditional DV
algorithms in the magnitude range. DUAL can obtain those low convergence times in addition to the least costly
path, by keeping a list of loop-free routes to each destination. EIGRP relies on neighborly relationships to easily
distribute changes across the network in the routing table; two routers are neighbors before that point.
Overhead
For all accompanying communications, EIGRP needs secure connectivity. Messages are approved by neighbors,
and if no permission is granted, EIGRP will retransmit the notification. For all path computations, EIGRP utilizes
the Diffusing Update Algorithm (DUAL). DUAL's convergence distances are smaller than conventional DV
15
algorithms in order of magnitude. By bringing a list of loop-free routes to each destination, DUAL can obtain
those low convergence times, apart from the least expensive path. EIGRP focuses on neighborly relationships for
the efficient distribution of network-wide changes in the routing table.
Make informed judgements relating to diverse networking algorithms
Value, jump check, throughput, load balance, delay, jitter, data transfer capacity, parcel misfortune rate, etc are
the most well-known presentation pointers for directing estimation. Conventional directing calculations'
evaluation measurements are predominantly isolated into two segments. One is for the necessity of the
organization's general help quality, for example, bounce check, throughput, cost, load balance, transfer speed, and
so on, and the other is for the prerequisite of business-based information transmission quality, for example, delay,
jitter, pace of parcel misfortune, and so forth Most directing calculations improve at least one measurements for
the general nature of the organization's administration or enhance the general nature of the administration, given
that some transmission quality is met. Since each organization has distinctive transmission quality necessities, a
large portion of the ebb and flow steering calculations are not educated by much examination about how various
organizations with a specific organization yield assurance can get better transmission.
As association loads are improved, the two calculations require a more extended running time than other regular
calculations. Our proposed calculations are hence more proper for frameworks that need more point by point test
results, better execution of hardware, and details that are not very high progressively. Another issue to be
addressed later on is the way to fabricate a multi-target calculation with lower unpredictability and quicker
execution. The issue of high computational unpredictability will be settled as the preparing limit of equipment
gadgets develops. Likewise, the organization of conveyed multi-regulator designs in SDN would address the issue
of high overhead control planes with the extension of the organization size. In the paper, our proposed directing
calculations are expected for SR in SDN. Obviously, it is likewise conceivable to stretch out our way to deal with
ordinary dispersed organizations and organizations that don't utilize SR. Our proposed directing calculation can
be utilized in the course figuring of ordinary disseminated networks.
The normal run season of different calculations. The two directing calculations that we propose need longer
running occasions than other customary calculations. To locate the ideal arrangement, the MOPSO calculation
requires a few emphasess. Besides subsequent to choosing the ideal k ways, our calculation adds the way
assessment stage, which isn't expressed before by different calculations. In the proposed Algorithm 2, the
improved MOPSO calculation upgrades the concurrent speed search effectiveness while advancing the
connection loads. It requires some investment for the proposed Algorithm 2 than for the proposed Algorithm 1.
The two calculations that we proposed require more calculation and increment the control plane's computational
16
multifaceted nature. Anyway the computational intricacy of control planes will be eased with the upgrade of the
handling limit of equipment gadgets and the utilization of disseminated multi-regulators in SDN.
Compare and contrast existing and emergent networking technologies
Remote organization innovation, for example, WiMAX, satellites, inflatables and laser association advances
might be an elective methods for web network for beacons situated in far off territories of Scotland. Anyway a
portion of the appropriated web frameworks have battled before, as the distance ventured out by wired
organizations to arrive at rustic zones makes it excessively expensive for country regions to introduce and look
after organizations (Singh. also, Aggarwal 2017). Wi-Fi innovation can possibly streamline various outside
necessities into a restricted assortment of prerequisites. WiMAX has conveyed 70 Mbps of high information move
speeds that compass up to 50 Kms. WiMAX is more worried about availability than Wi-Fi networks. WiMAX
has various administrations provided by the Digital Bridge Company, including BridgeMAXX (Jain 2016). The
organization utilizes long pinnacles with a scope of five miles that help to give country zones Internet
administrations.
17
Cost of various access technologies
Table 1: Comparison of capabilities and costs of various access technologies
Different types of Internet connectivity and its infrastructure, including the cost, availability and speed of internet
access in the region, are recommended for light consideration. The protection of the internet connection is an
essential aspect of protecting customers' and other visitors' data and information at the lighthouse. This will impact
18
the company's financial viability in the industry. Installing the required internet link will help to improve the
market profit of the lighthouse. If the lighthouse is improved by the use of the internet connection, the
maintenance.
WiMAX may, on the other hand, be suggested for the lighthouse to have long-range internet access in the remote
areas of the lighthouse due to the remote location of the lighthouse. The reliability of the network will be high,
helping to provide the region with quality network connections. The use of WiMAX in the lighthouse would
minimize the cost of installation and internet charges. Wired network access, on the other hand uses wires that
raise the installation price. In this way, confirming the reasons why, among other open Internet inventions, Rubha
Reidh should receive WiMAX as the key need. In rural areas, the use of unlicensed WIMAX is often remarkably
inexpensive despite the fact that it has a notable weakness that; unlicensed range has problems with arrangement
reaction and misfortune of knowledge that are not always predominant with permitted range.
Currently, with regard to the relation between creativity, separation and adaptability, particularly when continuous
electrical cables are put on a similar electrical shaft somewhat below the electrical cables. If the lighthouse is
assured of a steady stream of sightseers, this must be obtained, why say this because it has high affiliation and
support costs and administration or membership costs. Despite the fact that it offers additional administrations
such as TV motions inside the crossover Fiber link base, coaxial links used are persuasive yes, but expensive.
However, when there is high operation and usage of the Internet and numerous administrations within the
organisation, the lighthouse can only receive fiber optic innovation. It would not be financially perceptive for
organizations that do not rely heavily on Internet usage to embrace this innovation as it would not have ample
movement. Because enormous transmission, it will resemble a misuse of money.
19
References
Barton, L.J., Soshnev, A.A. and Geyer, P.K., 2015. Networking in the nucleus: a spotlight on LEM-domain
proteins. Current opinion in cell biology, 34, pp.1-8.
Bhatia, S., Chauhan, A. and Nigam, V.K., 2016. The Internet of Things: A Survey on Technology and Trends.
Bore, I., Rutherford, C., Glasgow, S., Taheri, B. and Antony, J., 2017. A networkatic literature review on
eWOM in the hotel industry: Current trends and suggestions for future research. Hospitality & Society, 7(1),
pp.63-85.
Charrier, B., Coates, J.C. and Stavridou, I., 2017. Surfing amongst oil-tankers: Connecting emerging research
fields to the current international landscape. Trends in plant science, 22(1), pp.1-3.
Edwards, S.L. and Wang, V., 2016. Young peoples’ use of social networking sites: their perspectives of
cyberbullying issues and recommendations for suitable interventions.
El Kadiri, S., Grabot, B., Thoben, K.D., Hribernik, K., Emmanouilidis, C., Von Cieminski, G. and Kiritsis, D.,
2016. Current trends on ICT technologies for enterprise information systems. Computers in Industry, 79, pp.1433.
Gómez, R.C., Luchian, E., Ivanciu, I.A., Taut, A., Dobrota, V. and Rivière, E., 2017, June. On the impact of
indirect WAN routing on geo-replicated storage. In Local and Metropolitan Area Networks (LANMAN), 2017
IEEE International Symposium on (pp. 1-6). IEEE.
Jain, P.C., 2016, December. Recent trends in next generation terabit Ethernet and gigabit wireless local area
network. In Signal Processing and Communication (ICSC), 2016 International Conference on (pp. 106-110).
IEEE.
Khan, S., Pathan, A.S.K. and Alrajeh, N.A. eds., 2016. Wireless sensor networks: Current status and future
trends. CRC Press.
Laumer, S., Shami, N.S., Muller, M. and Geyer, W., 2017, February. The Challenge of Enterprise Social
Networking (Non-) Use at Work: A Case Study of How to Positively Influence Employees’ Enterprise Social
Networking Acceptanc. In Proceedings of the 2017 ACM Conference on Computer Supported Cooperative
Work and Social Computing (pp. 978-994). ACM.
Lebeau, L.E. and Ielpi, A., 2017. Fluvial channel belts, floodbasins, and aeolian ergs in the Precambrian Meall
Dearg Formation (Torridonian of Scotland): Inferring climate regimes from pre-vegetation clastic rock
records. Sedimentary Geology.
Lin, H., Chen, C., Wang, J., Qi, J., Jin, D., Kalbarczyk, Z. and Iyer, R.K., 2016. Self-healing attack-resilient
pmu network for power system operation. IEEE Transactions on Smart Grid.
Müller-Stewens, B. and Möller, K., 2017. Performance in new product development: a comprehensive
framework, current trends, and research directions. Journal of Management Control, 28(2), pp.157-201.
20
Navimipour, N.J. and Charband, Y., 2016. Knowledge sharing mechanisms and techniques in project teams:
Literature review, classification, and current trends. Computers in Human Behavior, 62, pp.730-742.
Schlechtendahl, J., Kretschmer, F., Sang, Z., Lechler, A. and Xu, X., 2017. Extended study of network
capability for cloud based control systems. Robotics and Computer-Integrated Manufacturing, 43, pp.89-95.
Singh, A. and Aggarwal, C.E.H., 2017. Broadband vpn lan internet via wi-fi without wi-fi router using android
mobile. International Education and Research Journal, 3(5).
Singh, A. and Aggarwal, C.E.H., 2017. Vpn broadband lan sharing with wi-fi nano based usb
adapter. International Education and Research Journal, 3(5).
Tordera, E.M., Masip-Bruin, X., García-Almiñana, J., Jukan, A., Ren, G.J. and Zhu, J., 2017. Do we all really
know what a Fog Node is? Current trends towards an open definition. Computer Communications.
21