Link Prediction And Link Establishment Based On Network Nodes Life Time In Mo...inventionjournals
In this paper we propose a new modified adhoc routing algorithm for adhoc network that locally repairs a link failure and also conflicts the noise and link modification simultaneously. Due to topology changes caused by nodes’ mobility in adhoc network, the link routes get disconnected frequently. Our proposed scheme does a local repair of link failure and also takes care of malicious nodes with the help of a reliability measure while performing route discovery using link-prediction routing algorithm(LPRA). These two performance metrics are integrated by Route link-prediction algorithm. This algorithm is carried out as follows, Select the least dynamic route link with the longest lifetime for persistent data forwarding. Node Lifetime and link lifetime prediction methods. The receiver can measure the signal strength when it receives the packets from sender in same power level and then it calculates the distance between two nodes by applying the radio propagation model in LPRA using adhoc network. Simulation results show that our proposed schemeperforms better in comparison to a popular existing technique
CONGESTION AWARE LINK COST ROUTING FOR MANETSIJCNCJournal
Due to the dynamic topology, self-configuration and decentralized nature of Mobile Ad hoc Network
(MANET), it provides many benefits in wireless networks and is easy to deploy. But the transmission of
data over ad hoc networks has elevated many technical issues for successful routing. Congestion is one of
the important issues which cause performance degradation of a network, due to long delay and high packet
loss. This paper proposes a Congestion aware Link Cost Routing for MANET where the protocol finds a
path with optimized linked cost based on SNR, Link delay, and the and remaining battery power. Along
with this optimization, in this protocol, every node finds its congestion status and participates in the route
discovery on the basis of its status. Data forwarding is also done based on the congestion status at the time
of forwarding. The protocol results in better performance in terms of packet delivery fraction, end to end
delay, throughput, and packet drop when compared to existing protocols.
Mobile environment pretense a number of novel
theoretical and optimization issues such as position, operation
and following in that a lot of requests rely on them for
desirable information. The precedent works are sprinkled
across the entire network layer: from the medium of physical
to link layer to routing and then application layer. In this
invention, we present outline solutions in Medium Access
Control (MAC), data distribution, coverage resolve issues
under mobile ad-hoc network environment based on
congestion control technique using Transmission Control
Protocol (TCP). In mobile ad-hoc network issues can arise
such as link disconnections, channel contention and recurrent
path loss. To resolve this issue, we propose a Cross Layer
based Hybrid fuzzy ad-hoc rate based Congestion Control
(CLHCC) approach to maximize network performance. Based
on the destination report it regulates the speed of data flow to
control data loss by monitoring the present network status
and transmits this report to the source as advice. The source
adjusts the sending flow rate as per the advice. This is
monitored by channel usage, ultimate delay, short term
throughput.
Efficient Load Balancing Routing in Wireless Mesh Networksijceronline
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
An Approach using Local Information to Build QoS Routing Algorithminventionjournals
The requirement for quality of service (QoS) is more and more sophisticated, such as the required bandwidth, the value of delay time or packet loss. To assure the network performance, localized QoS routing algorithms have recently been proposed as a promising alternative to the currently deployed global QoS routing schemes. Different from the traditional QoS routing algorithms which use global state information, the localized routing algorithms use local information collected from source node to make routing decisions. These localized routing algorithms can be solutions to users’ demand in the near future. In this paper, we propose a new localized QoS routing algorithm which can help to assure quality of service, and show our simulations which are better in results against other routing algorithms.
To Get any Project for CSE, IT ECE, EEE Contact Me @ 09666155510, 09849539085 or mail us - ieeefinalsemprojects@gmail.com-Visit Our Website: www.finalyearprojects.org
New adaptation method based on cross layer and TCP over protocols to improve ...IJECEIAES
Due to rapid growth of multimedia traffic used over the mobile ad-hoc networks (MANETs), to keep up with the progress of this constraint MANETs protocols becoming increasingly concerned with the quality of service. In view of the random mobility nodes in MANET, TCP becomes more unreliability in case of higher energy consumption and packet loss. In this paper we proposed a new optimization approach to enhance decision making of TCP based on some changes of IEEE 802.11 MAC uses cross layer approach. The aim is to minimize the impact of retransmissions of packet lost and energy consumption in order to analyse and chose the appropriate routing protocol for TCP that can be enhance QoS MANET. Our simulation results based QoS study using NS3 show that, our proposal achieved better performance of TCP in MANETs significantly, and also improved the throughput, energy consumption and facilitates the traffic transmission over routing protocol.
Rough set based QoS enabled multipath source routing in MANET IJECEIAES
The single constrained Quality of Service (QoS) routing in Mobile Ad-hoc NETwork (MANET) is disastrous in consideration of MANET characteristics, inference, collision and link failure as it maintains a single path. The QoS enabled routing yields better packet delivery and maintains consistency among nodes in the network by incorporating multi-constrained and multipath routing. The Dynamic Source Routing (DSR) is best suited source routing algorithm to maintain multipath information at the source node, but performance degrades with larger number of mobile nodes. Multilayer mechanism should be incorporated to maintain QoS metric information spreads across multiple layers of TCP/IP protocol stack. The proposed multipath QoS enabled source routing provides balanced routing by making use of all these features. The imprecise decision making strategy called Rough Set Theory (RST) is used at destination node for decision making. The Route REQuest (RREQ) messages coming from different routes are filtered by considering the QoS metrics of each and every route by making use of RST. The Route REPly (RREP) messages are generated and delivered to the source node for filtered RREQ messages. The proposed routing algorithm will reduce load on the network by reducing number of control messages exchanged for route establishment. This will evenly distribute load among all the nodes and it also avoid the scenarios like few nodes starved for resources. Finally, multipath routing always provides alternate routing option in case of route failure.
Link Prediction And Link Establishment Based On Network Nodes Life Time In Mo...inventionjournals
In this paper we propose a new modified adhoc routing algorithm for adhoc network that locally repairs a link failure and also conflicts the noise and link modification simultaneously. Due to topology changes caused by nodes’ mobility in adhoc network, the link routes get disconnected frequently. Our proposed scheme does a local repair of link failure and also takes care of malicious nodes with the help of a reliability measure while performing route discovery using link-prediction routing algorithm(LPRA). These two performance metrics are integrated by Route link-prediction algorithm. This algorithm is carried out as follows, Select the least dynamic route link with the longest lifetime for persistent data forwarding. Node Lifetime and link lifetime prediction methods. The receiver can measure the signal strength when it receives the packets from sender in same power level and then it calculates the distance between two nodes by applying the radio propagation model in LPRA using adhoc network. Simulation results show that our proposed schemeperforms better in comparison to a popular existing technique
CONGESTION AWARE LINK COST ROUTING FOR MANETSIJCNCJournal
Due to the dynamic topology, self-configuration and decentralized nature of Mobile Ad hoc Network
(MANET), it provides many benefits in wireless networks and is easy to deploy. But the transmission of
data over ad hoc networks has elevated many technical issues for successful routing. Congestion is one of
the important issues which cause performance degradation of a network, due to long delay and high packet
loss. This paper proposes a Congestion aware Link Cost Routing for MANET where the protocol finds a
path with optimized linked cost based on SNR, Link delay, and the and remaining battery power. Along
with this optimization, in this protocol, every node finds its congestion status and participates in the route
discovery on the basis of its status. Data forwarding is also done based on the congestion status at the time
of forwarding. The protocol results in better performance in terms of packet delivery fraction, end to end
delay, throughput, and packet drop when compared to existing protocols.
Mobile environment pretense a number of novel
theoretical and optimization issues such as position, operation
and following in that a lot of requests rely on them for
desirable information. The precedent works are sprinkled
across the entire network layer: from the medium of physical
to link layer to routing and then application layer. In this
invention, we present outline solutions in Medium Access
Control (MAC), data distribution, coverage resolve issues
under mobile ad-hoc network environment based on
congestion control technique using Transmission Control
Protocol (TCP). In mobile ad-hoc network issues can arise
such as link disconnections, channel contention and recurrent
path loss. To resolve this issue, we propose a Cross Layer
based Hybrid fuzzy ad-hoc rate based Congestion Control
(CLHCC) approach to maximize network performance. Based
on the destination report it regulates the speed of data flow to
control data loss by monitoring the present network status
and transmits this report to the source as advice. The source
adjusts the sending flow rate as per the advice. This is
monitored by channel usage, ultimate delay, short term
throughput.
Efficient Load Balancing Routing in Wireless Mesh Networksijceronline
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
An Approach using Local Information to Build QoS Routing Algorithminventionjournals
The requirement for quality of service (QoS) is more and more sophisticated, such as the required bandwidth, the value of delay time or packet loss. To assure the network performance, localized QoS routing algorithms have recently been proposed as a promising alternative to the currently deployed global QoS routing schemes. Different from the traditional QoS routing algorithms which use global state information, the localized routing algorithms use local information collected from source node to make routing decisions. These localized routing algorithms can be solutions to users’ demand in the near future. In this paper, we propose a new localized QoS routing algorithm which can help to assure quality of service, and show our simulations which are better in results against other routing algorithms.
To Get any Project for CSE, IT ECE, EEE Contact Me @ 09666155510, 09849539085 or mail us - ieeefinalsemprojects@gmail.com-Visit Our Website: www.finalyearprojects.org
New adaptation method based on cross layer and TCP over protocols to improve ...IJECEIAES
Due to rapid growth of multimedia traffic used over the mobile ad-hoc networks (MANETs), to keep up with the progress of this constraint MANETs protocols becoming increasingly concerned with the quality of service. In view of the random mobility nodes in MANET, TCP becomes more unreliability in case of higher energy consumption and packet loss. In this paper we proposed a new optimization approach to enhance decision making of TCP based on some changes of IEEE 802.11 MAC uses cross layer approach. The aim is to minimize the impact of retransmissions of packet lost and energy consumption in order to analyse and chose the appropriate routing protocol for TCP that can be enhance QoS MANET. Our simulation results based QoS study using NS3 show that, our proposal achieved better performance of TCP in MANETs significantly, and also improved the throughput, energy consumption and facilitates the traffic transmission over routing protocol.
Rough set based QoS enabled multipath source routing in MANET IJECEIAES
The single constrained Quality of Service (QoS) routing in Mobile Ad-hoc NETwork (MANET) is disastrous in consideration of MANET characteristics, inference, collision and link failure as it maintains a single path. The QoS enabled routing yields better packet delivery and maintains consistency among nodes in the network by incorporating multi-constrained and multipath routing. The Dynamic Source Routing (DSR) is best suited source routing algorithm to maintain multipath information at the source node, but performance degrades with larger number of mobile nodes. Multilayer mechanism should be incorporated to maintain QoS metric information spreads across multiple layers of TCP/IP protocol stack. The proposed multipath QoS enabled source routing provides balanced routing by making use of all these features. The imprecise decision making strategy called Rough Set Theory (RST) is used at destination node for decision making. The Route REQuest (RREQ) messages coming from different routes are filtered by considering the QoS metrics of each and every route by making use of RST. The Route REPly (RREP) messages are generated and delivered to the source node for filtered RREQ messages. The proposed routing algorithm will reduce load on the network by reducing number of control messages exchanged for route establishment. This will evenly distribute load among all the nodes and it also avoid the scenarios like few nodes starved for resources. Finally, multipath routing always provides alternate routing option in case of route failure.
EFFICIENT PACKET DELIVERY APPROACH FOR ADHOC WIRELESS NETWORKS cscpconf
A wireless ad-hoc network is a collection of nodes which are selfconfiguring,
connected by wireless links. The nodes are free to move randomly and
organize themselves arbitrarily; thus, the network's topology may change rapidly and
unpredictably. These kinds of networks are very flexible and they do not require any
existing infrastructure. Therefore, ad-hoc wireless networks are suitable for temporary
communication links. The biggest challenge in these kinds of networks is to find a path
between the communication end points of nodes that are mobile. Due to the limited
transmission range of wireless interfaces, the communication traffic has to be relayed
over several intermediate nodes to enable the communication between two nodes.
Therefore, these kinds of networks are also called multi-hop ad-hoc networks. The
proposed model is designed to improve the problems of real-time event-based
communication. It improves the packet delivery ratio by prior prediction and reduces
end-to-end packet delay. This in turn improves performance of the routing process
significantly and increases the Quality of Service (QoS).
Fast Distribution of Replicated Content to Multi- Homed ClientsIDES Editor
Clients can potentially have access to more than
one communication network nowadays due to the availability
of a wide variety of access technologies. On the other hand,
service replication has become a trivial approach in overlay
networks to provide a high availability of data and better QoS.
In this paper, we consider such a multi-homed client seeking
a replicated service in overlay network (e.g., CDN, peer-topeer).
Our aim is to improve the content distribution by
proposing a new model for being applied at the applicationlevel
and in a fully distributed way. Basically, our model
proposes to determine the best mirror server that could be
reached through each client’s network interface based on
application utility function. Then, it consists of downloading
the requested content from the determined best servers
simultaneously through their associated interfaces. Each best
server should deliver a specific estimated range of bytes (i.e.,
content chunk) to an independent TCP socket opened at the
client side for being finally aggregated at the applicationlevel.
Our real experiments show that our model is able to
considerably improve the QoS (e.g., content transfer time)
perceived by the client comparing to the traditional content
distribution techniques.
Packet delivery ratio, delay, throughput, routing overhead etc are the strict quality of service requirements
for applications in Ad hoc networks. So, the routing protocol not only finds a suitable path but also the path
should satisfy the QoS constraints also. Quality of services (QoS) aware routing is performed on the basis
of resource availability in the network and the flow of QoS requirement. In this paper we developed a
source routing protocol which satisfying the link bandwidth and end –to- end delay factor. Our protocol
will find multiple paths between the source and the destination, out of those one will be selected for data
transfer and others are reserve at the source node those can be used for route maintenance purpose. The
path selection is strictly based on the bandwidth and end-to-end delay in case two or more then two paths
are having the same values for QoS constraints then we will use hop as a parameter for path selection.
DISTRIBUTED TRAFFIC BY LOAD-BALANCING APPROACH FOR AOMDV IN AD-HOC NETWORKScscpconf
Mobile ad hoc network is a collection of wireless mobile nodes, which are connected over a wireless medium. There is no pre-existing communication infrastructure (no access points, no
base stations) and the nodes can freely move and self-organize into a network topology. Such a network can contain two or more nodes. Hence, balancing the load in an Ad hoc network is
important because the nodes have limited communication resources such as bandwidth, buffer space and battery power. This paper presents a new approach to load balancing based on
residual energy of nodes for distribute the traffic evenly among the network nodes. We are exploiting the multipath routing protocol AOMDV, which defines link-disjoint paths between the
source and the destination in every route discovery. We add the energy metric for load balancing (ELB-AOMDV). The performance is compared between ELB-AOMDV and LBAOMDV.
INVESTIGATING MULTILAYER OMEGA-TYPE NETWORKS OPERATING WITH THE CUT-THROUGH T...IJCNCJournal
The continuous increase in the complexity of data networks has motivated the development of more effective Multistage Interconnection Networks (MINs) as important factors in providing higher data transfer rates in various switching divisions. In this paper, semi-layer omega-class networks operating with a cut-through forwarding technique are chosen as test-bed subjects for detailed evaluation, and this network architecture is modelled, inspected, and simulated. The results are examined for relevant singlelayer omega networks operating with cut-through or ‘store and forward’ forwarding techniques. Two series of experiments are carried out: one concerns the case of uniform traffic, while the other is related to hotspot traffic. The results quantify the way in which this network outperforms the corresponding singlelayer network architectures for the same network size and buffer size. Furthermore, the effects of the dimensions of the switch elements and their corresponding reliability on the overall interconnection system are investigated, and the complexity and the relevant cost are examined. The data yielded by this investigation can be valuable to MIN engineers and can allow them to achieve more productive networks with lower overall implementation costs.
Adaptive QoS Multicast Routing with Mobility Prediction in MANETs ijasuc
A Mobile Ad hoc NETwork (MANET) is a collection of wireless mobile hosts that form a temporary network
without a centralized administration or wired infrastructure. Due to the high mobility of nodes, the network
topology of MANETs changes very fast, making it more difficult to find the routes that message packets use.
Network control with Quality of Service (QoS) support is a key issue for multimedia applications in MANET.
Most of the real time applications have stringent requirements on bandwidth, delay, delay-jitter, packet loss
ratio, cost and other QoS metrics. This paper proposes a Multi-constrained QoS routing with mobility
prediction protocol. If the node has enough resources to transmit data packets, it uses the Global
Positioning System (GPS) to get the location information of the mobile nodes and selects the routing path
with the maximum Route Expiration Time (RET). A set of static and mobile agents are used to find the
multicast routes and transmit the packets. Extensive simulations have been conducted to evaluate the
performance of MC_MAODV using Network Simulator (NS-2). The simulation results show that the
proposed protocol achieves good performance in terms of improving packet delivery ratio and minimizing
end-to-end delay.
QoS Oriented Coding For Mobility Constraint in Wireless Networksiosrjce
IOSR Journal of Electronics and Communication Engineering(IOSR-JECE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of electronics and communication engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in electronics and communication engineering. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
ECA MODEL BASED QOS AODV ROUTING FOR MANETSIJCNCJournal
Applications like banking, interactive multimedia, movie on demand, VOIP, etc., are delay sensitive by
nature. The QoS given to users will be affected by network delay, which can be mitigated by employing
QoS routing and efficient data transfer. To build routing table, normal AODV routing uses flooding
technique, which will not consider QoS requirements. Hence QoS based routing which is stable for the
entire application is essential, which understands the dynamic nature of the MANET and establishes the
required route, in minimum possible time. We have proposed an intelligent routing protocol based ECA
model and AODV for establishing QoS route.
The simulation results shows that the ECA model gives better results, while considering the local
connectivity time, source to destination connectivity time, number of data packets successfully delivered to
the destination, local and global error correction time, compared to AODV.
A New Bi-level Program Based on Unblocked Reliability for a Continuous Road N...IJMER
With increasing demands for better and more reliable service, developing a method for designing a highly-reliability road network has become a critical issue. A Network Design Problem is used to determine a set of design parameters leading to the creation of an optimal road network. Moreover, the performance of an Origin-Destination pair with high traffic demands is a top priority in the optimizing process. A bi-level programming technique, that is upper-level and lower-level programs, can be used to formulate the Continuous Network Design Problem. This study establishes a new type of bi-level program based on unblocked reliability. The proposed bi-level program is applied to analyze a real local road network that has 22 nodes and 62 links. A set of link capacity expansions is determined by solving the proposed bi-level program using the Hooke-Jeeves algorithm. This kind of capacity expansion results in optimization by maximizing the balance between the unblocked reliability of the entire road network and the road network expansion ratio. The new, proposed bi-level program can comply with the various limits on environment and financial resources.
Transfer reliability and congestion control strategies in opportunistic netwo...IEEEFINALYEARPROJECTS
To Get any Project for CSE, IT ECE, EEE Contact Me @ 09849539085, 09966235788 or mail us - ieeefinalsemprojects@gmail.co¬m-Visit Our Website: www.finalyearprojects.org
Dear Students
Ingenious techno Solution offers an expertise guidance on you Final Year IEEE & Non- IEEE Projects on the following domain
JAVA
.NET
EMBEDDED SYSTEMS
ROBOTICS
MECHANICAL
MATLAB etc
For further details contact us:
enquiry@ingenioustech.in
044-42046028 or 8428302179.
Ingenious Techno Solution
#241/85, 4th floor
Rangarajapuram main road,
Kodambakkam (Power House)
http://www.ingenioustech.in/
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
Traffic-aware adaptive server load balancing for softwaredefined networks IJECEIAES
Servers in data center networks handle heterogeneous bulk loads. Load balancing, therefore, plays an important role in optimizing network bandwidth and minimizing response time. A complete knowledge of the current network status is needed to provide a stable load in the network. The process of network status catalog in a traditional network needs additional processing which increases complexity, whereas, in software defined networking, the control plane monitors the overall working of the network continuously. Hence it is decided to propose an efficient load balancing algorithm that adapts SDN. This paper proposes an efficient algorithm TAASLB-traffic-aware adaptive server load balancing to balance the flows to the servers in a data center network. It works based on two parameters, residual bandwidth, and server capacity. It detects the elephant flows and forwards them towards the optimal server where it can be processed quickly. It has been tested with the Mininet simulator and gave considerably better results compared to the existing server load balancing algorithms in the floodlight controller. After experimentation and analysis, it is understood that the method provides comparatively better results than the existing load balancing algorithms.
DYNAMIC CONGESTION CONTROL IN WDM OPTICAL NETWORKcscpconf
This paper is based on Wavelength Division Multiplexing (WDM) optical networking. In this optical networking, prior to data transfer, lightpath establishment between source and
destination nodes is usually carried out through a wavelength reservation protocol. This wavelength is reserved corresponding to a route between the source and destination and the
route is chosen following any standard routing protocol based on shortest path. The backward reservation protocol is implemented initially. A fixed connected and weighted network is
considered. The inputs of this implementation are the fixed network itself and its corresponding shortest path matrix. After this initial level of implementation, the average node usage over a time period is calculated and various thresholds for node usage are considered. Above threshold value, request arriving at that path selects its next shortest path. This concept is
implemented on various wavelengths. The output represents the performance issues of dynamic congestion control.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
EFFICIENT PACKET DELIVERY APPROACH FOR ADHOC WIRELESS NETWORKS cscpconf
A wireless ad-hoc network is a collection of nodes which are selfconfiguring,
connected by wireless links. The nodes are free to move randomly and
organize themselves arbitrarily; thus, the network's topology may change rapidly and
unpredictably. These kinds of networks are very flexible and they do not require any
existing infrastructure. Therefore, ad-hoc wireless networks are suitable for temporary
communication links. The biggest challenge in these kinds of networks is to find a path
between the communication end points of nodes that are mobile. Due to the limited
transmission range of wireless interfaces, the communication traffic has to be relayed
over several intermediate nodes to enable the communication between two nodes.
Therefore, these kinds of networks are also called multi-hop ad-hoc networks. The
proposed model is designed to improve the problems of real-time event-based
communication. It improves the packet delivery ratio by prior prediction and reduces
end-to-end packet delay. This in turn improves performance of the routing process
significantly and increases the Quality of Service (QoS).
Fast Distribution of Replicated Content to Multi- Homed ClientsIDES Editor
Clients can potentially have access to more than
one communication network nowadays due to the availability
of a wide variety of access technologies. On the other hand,
service replication has become a trivial approach in overlay
networks to provide a high availability of data and better QoS.
In this paper, we consider such a multi-homed client seeking
a replicated service in overlay network (e.g., CDN, peer-topeer).
Our aim is to improve the content distribution by
proposing a new model for being applied at the applicationlevel
and in a fully distributed way. Basically, our model
proposes to determine the best mirror server that could be
reached through each client’s network interface based on
application utility function. Then, it consists of downloading
the requested content from the determined best servers
simultaneously through their associated interfaces. Each best
server should deliver a specific estimated range of bytes (i.e.,
content chunk) to an independent TCP socket opened at the
client side for being finally aggregated at the applicationlevel.
Our real experiments show that our model is able to
considerably improve the QoS (e.g., content transfer time)
perceived by the client comparing to the traditional content
distribution techniques.
Packet delivery ratio, delay, throughput, routing overhead etc are the strict quality of service requirements
for applications in Ad hoc networks. So, the routing protocol not only finds a suitable path but also the path
should satisfy the QoS constraints also. Quality of services (QoS) aware routing is performed on the basis
of resource availability in the network and the flow of QoS requirement. In this paper we developed a
source routing protocol which satisfying the link bandwidth and end –to- end delay factor. Our protocol
will find multiple paths between the source and the destination, out of those one will be selected for data
transfer and others are reserve at the source node those can be used for route maintenance purpose. The
path selection is strictly based on the bandwidth and end-to-end delay in case two or more then two paths
are having the same values for QoS constraints then we will use hop as a parameter for path selection.
DISTRIBUTED TRAFFIC BY LOAD-BALANCING APPROACH FOR AOMDV IN AD-HOC NETWORKScscpconf
Mobile ad hoc network is a collection of wireless mobile nodes, which are connected over a wireless medium. There is no pre-existing communication infrastructure (no access points, no
base stations) and the nodes can freely move and self-organize into a network topology. Such a network can contain two or more nodes. Hence, balancing the load in an Ad hoc network is
important because the nodes have limited communication resources such as bandwidth, buffer space and battery power. This paper presents a new approach to load balancing based on
residual energy of nodes for distribute the traffic evenly among the network nodes. We are exploiting the multipath routing protocol AOMDV, which defines link-disjoint paths between the
source and the destination in every route discovery. We add the energy metric for load balancing (ELB-AOMDV). The performance is compared between ELB-AOMDV and LBAOMDV.
INVESTIGATING MULTILAYER OMEGA-TYPE NETWORKS OPERATING WITH THE CUT-THROUGH T...IJCNCJournal
The continuous increase in the complexity of data networks has motivated the development of more effective Multistage Interconnection Networks (MINs) as important factors in providing higher data transfer rates in various switching divisions. In this paper, semi-layer omega-class networks operating with a cut-through forwarding technique are chosen as test-bed subjects for detailed evaluation, and this network architecture is modelled, inspected, and simulated. The results are examined for relevant singlelayer omega networks operating with cut-through or ‘store and forward’ forwarding techniques. Two series of experiments are carried out: one concerns the case of uniform traffic, while the other is related to hotspot traffic. The results quantify the way in which this network outperforms the corresponding singlelayer network architectures for the same network size and buffer size. Furthermore, the effects of the dimensions of the switch elements and their corresponding reliability on the overall interconnection system are investigated, and the complexity and the relevant cost are examined. The data yielded by this investigation can be valuable to MIN engineers and can allow them to achieve more productive networks with lower overall implementation costs.
Adaptive QoS Multicast Routing with Mobility Prediction in MANETs ijasuc
A Mobile Ad hoc NETwork (MANET) is a collection of wireless mobile hosts that form a temporary network
without a centralized administration or wired infrastructure. Due to the high mobility of nodes, the network
topology of MANETs changes very fast, making it more difficult to find the routes that message packets use.
Network control with Quality of Service (QoS) support is a key issue for multimedia applications in MANET.
Most of the real time applications have stringent requirements on bandwidth, delay, delay-jitter, packet loss
ratio, cost and other QoS metrics. This paper proposes a Multi-constrained QoS routing with mobility
prediction protocol. If the node has enough resources to transmit data packets, it uses the Global
Positioning System (GPS) to get the location information of the mobile nodes and selects the routing path
with the maximum Route Expiration Time (RET). A set of static and mobile agents are used to find the
multicast routes and transmit the packets. Extensive simulations have been conducted to evaluate the
performance of MC_MAODV using Network Simulator (NS-2). The simulation results show that the
proposed protocol achieves good performance in terms of improving packet delivery ratio and minimizing
end-to-end delay.
QoS Oriented Coding For Mobility Constraint in Wireless Networksiosrjce
IOSR Journal of Electronics and Communication Engineering(IOSR-JECE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of electronics and communication engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in electronics and communication engineering. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
ECA MODEL BASED QOS AODV ROUTING FOR MANETSIJCNCJournal
Applications like banking, interactive multimedia, movie on demand, VOIP, etc., are delay sensitive by
nature. The QoS given to users will be affected by network delay, which can be mitigated by employing
QoS routing and efficient data transfer. To build routing table, normal AODV routing uses flooding
technique, which will not consider QoS requirements. Hence QoS based routing which is stable for the
entire application is essential, which understands the dynamic nature of the MANET and establishes the
required route, in minimum possible time. We have proposed an intelligent routing protocol based ECA
model and AODV for establishing QoS route.
The simulation results shows that the ECA model gives better results, while considering the local
connectivity time, source to destination connectivity time, number of data packets successfully delivered to
the destination, local and global error correction time, compared to AODV.
A New Bi-level Program Based on Unblocked Reliability for a Continuous Road N...IJMER
With increasing demands for better and more reliable service, developing a method for designing a highly-reliability road network has become a critical issue. A Network Design Problem is used to determine a set of design parameters leading to the creation of an optimal road network. Moreover, the performance of an Origin-Destination pair with high traffic demands is a top priority in the optimizing process. A bi-level programming technique, that is upper-level and lower-level programs, can be used to formulate the Continuous Network Design Problem. This study establishes a new type of bi-level program based on unblocked reliability. The proposed bi-level program is applied to analyze a real local road network that has 22 nodes and 62 links. A set of link capacity expansions is determined by solving the proposed bi-level program using the Hooke-Jeeves algorithm. This kind of capacity expansion results in optimization by maximizing the balance between the unblocked reliability of the entire road network and the road network expansion ratio. The new, proposed bi-level program can comply with the various limits on environment and financial resources.
Transfer reliability and congestion control strategies in opportunistic netwo...IEEEFINALYEARPROJECTS
To Get any Project for CSE, IT ECE, EEE Contact Me @ 09849539085, 09966235788 or mail us - ieeefinalsemprojects@gmail.co¬m-Visit Our Website: www.finalyearprojects.org
Dear Students
Ingenious techno Solution offers an expertise guidance on you Final Year IEEE & Non- IEEE Projects on the following domain
JAVA
.NET
EMBEDDED SYSTEMS
ROBOTICS
MECHANICAL
MATLAB etc
For further details contact us:
enquiry@ingenioustech.in
044-42046028 or 8428302179.
Ingenious Techno Solution
#241/85, 4th floor
Rangarajapuram main road,
Kodambakkam (Power House)
http://www.ingenioustech.in/
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
Traffic-aware adaptive server load balancing for softwaredefined networks IJECEIAES
Servers in data center networks handle heterogeneous bulk loads. Load balancing, therefore, plays an important role in optimizing network bandwidth and minimizing response time. A complete knowledge of the current network status is needed to provide a stable load in the network. The process of network status catalog in a traditional network needs additional processing which increases complexity, whereas, in software defined networking, the control plane monitors the overall working of the network continuously. Hence it is decided to propose an efficient load balancing algorithm that adapts SDN. This paper proposes an efficient algorithm TAASLB-traffic-aware adaptive server load balancing to balance the flows to the servers in a data center network. It works based on two parameters, residual bandwidth, and server capacity. It detects the elephant flows and forwards them towards the optimal server where it can be processed quickly. It has been tested with the Mininet simulator and gave considerably better results compared to the existing server load balancing algorithms in the floodlight controller. After experimentation and analysis, it is understood that the method provides comparatively better results than the existing load balancing algorithms.
DYNAMIC CONGESTION CONTROL IN WDM OPTICAL NETWORKcscpconf
This paper is based on Wavelength Division Multiplexing (WDM) optical networking. In this optical networking, prior to data transfer, lightpath establishment between source and
destination nodes is usually carried out through a wavelength reservation protocol. This wavelength is reserved corresponding to a route between the source and destination and the
route is chosen following any standard routing protocol based on shortest path. The backward reservation protocol is implemented initially. A fixed connected and weighted network is
considered. The inputs of this implementation are the fixed network itself and its corresponding shortest path matrix. After this initial level of implementation, the average node usage over a time period is calculated and various thresholds for node usage are considered. Above threshold value, request arriving at that path selects its next shortest path. This concept is
implemented on various wavelengths. The output represents the performance issues of dynamic congestion control.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Engineering Research Publication
Best International Journals, High Impact Journals,
International Journal of Engineering & Technical Research
ISSN : 2321-0869 (O) 2454-4698 (P)
www.erpublication.org
Hop Count Based Interest Selection and Content Forwarding Scheme for Vehicula...IJCNCJournal
Vehicular Named Data Networks (VNDN) face challenges in efficiently disseminating content due to high mobility and intermittent connectivity. To address these challenges, a Hop Count based Interest Selection and Content Forwarding (HISCF) scheme for VNDNs is proposed. The scheme focuses on mitigating interest flooding, reducing data packet duplication, and alleviating network congestion. HISCF consists of two components: interest selection and content forwarding. The selection process chooses a vehicle based on hop count and Interest Satisfaction Ratio (ISR) to forward the interest packet. Content forwarding is performed considering a hop count limit and pending interests, ensuring efficient content delivery. The HISCF scheme is evaluated using extensive simulations in ns-3 with ndnSIM. Performance metrics such as Data Packet Replication Count (DPRC), total number of interest packets forwarded, Interest Response Time (IRT) and routing overhead are analysed. Results show that HISCF outperforms naïve VNDN, reducing DPRC, minimizing interest packets forwarded, and decreasing average IRT. The findings demonstrate that HISCF effectively mitigates interest broadcast storms, reduces data packet duplication, and improves content delivery efficiency in VNDNs. This study contributes to VNDN research advancement and provides insights for designing effective content forwarding mechanisms in vehicular networks.
Hop Count Based Interest Selection and Content Forwarding Scheme for Vehicula...IJCNCJournal
Vehicular Named Data Networks (VNDN) face challenges in efficiently disseminating content due to high mobility and intermittent connectivity. To address these challenges, a Hop Count based Interest Selection and Content Forwarding (HISCF) scheme for VNDNs is proposed. The scheme focuses on mitigating interest flooding, reducing data packet duplication, and alleviating network congestion. HISCF consists of two components: interest selection and content forwarding. The selection process chooses a vehicle based on hop count and Interest Satisfaction Ratio (ISR) to forward the interest packet. Content forwarding is performed considering a hop count limit and pending interests, ensuring efficient content delivery. The HISCF scheme is evaluated using extensive simulations in ns-3 with ndnSIM. Performance metrics such as Data Packet Replication Count (DPRC), total number of interest packets forwarded, Interest Response Time (IRT) and routing overhead are analysed. Results show that HISCF outperforms naïve VNDN, reducing DPRC, minimizing interest packets forwarded, and decreasing average IRT. The findings demonstrate that HISCF effectively mitigates interest broadcast storms, reduces data packet duplication, and improves content delivery efficiency in VNDNs. This study contributes to VNDN research advancement and provides insights for designing effective content forwarding mechanisms in vehicular networks.
Enhancement of qos in multihop wireless networks by delivering cbr using lb a...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Enhancement of qos in multihop wireless networks by delivering cbr using lb a...eSAT Journals
Abstract One of the most complicated issues is to measuring the delay performance of end to end nodes in Multi-hop Wireless Networks. The two nodes are communicating via hopping over the multiple wireless links. The fact that is each node has to concentrate not only its own generated traffic, but also relayed one. Observing unfairness particularly for transmissions among nodes that are more than one hop Most of the existing works deals with the joint congestion control and scheduling algorithm, which does not focusing the delay performance. In turn, considering the throughput metric alone although for congestion control flows, throughput is the repeated difficult performance metric Packet delay is also important because practical congestion control protocols need to establish the timeouts for the retransmissions based on the packet delay, such parameters could significantly impact the speed of recovery when loss of packets occurred. The related issues on the delay-performance First, for long flows, the end to end delay may grow in terms of square with based on the number of hops. Second, it is difficult to control the end-to-end delay of each flows. TDMA schedules the transmissions in a fair way, in terms of throughput per connection, considering the communication requirements of the active flows of the network. It does not work properly in the multi-hop scenario, because it is generated only for single hop networks, We propose The Leaky Bucket Algorithm, in addition to joint congestion control and scheduling algorithm in multi-hop wireless networks. The proposed algorithm not only achieves the provable throughput and also considering the upper bounds of the delay of each flow. It reduces the transmission time by delivering packets at a constant bit rate even it receives the packet at a busty way. Keywords- Multi-hop wireless networks, congestion control, Performance, Delay, Flow, Throughput.
Vehicular ad hoc networks (VANETs) have seen tremendous growth in the last decade, providing a vast
range of applications in both military and civilian activities. The temporary connectivity in the vehicles can also
increase the driver’s capability on the road. However, such applications require heavy data packets to be shared on
the same spectrum without the requirement of excessive radios. Thus, e-client approaches are required which can
provide improved data dissemination along with the better quality of services to allow heavy traffic to be easily
shared between the vehicles. In this paper, an e-client data dissemination approach is proposed which not only
improves the vehicle to vehicle connectivity but also improves the QoS between the source and the destination. The
proposed approach is analyzed and compared with the existing state-of-the-art approaches. The effectiveness of the
proposed approach is demonstrated in terms of the significant gains attained in the parameters namely, end to end
delay, packet delivery ratio, route acquisition time, throughput, and message dissemination rate in comparison with
the existing approaches.
Robust Resource Allocation in Relay Node Networks for Optimization ProcessIJCERT
Overlay steering has risen as a promising way to deal with enhances unwavering quality and effectiveness of the Internet. For one-jump overlay source steering, when a given essential way experiences the connection disappointment or execution debasement, the source can reroute the movement to the destination by means of a deliberately set transfer hub. Be that as it may, the over-substantial activity going through the same transfer hub may bring about incessant bundle misfortune and postponement jitter, which can corrupt the throughput and usage of the system. To defeat this issue, we propose a Load-Balanced One-jump Overlay Multipath Routing calculation (LB-OOMR), in which the activity is first part at the source edge hubs and afterward transmitted along numerous one-bounce overlay ways. So as to decide an ideal split proportion for the activity, we plan the issue as a direct programming (LP) definition, whose objective is to minimize the more regrettable case system blockage proportion. Since it is hard to take care of this LP issue in commonsense time, a heuristic calculation is acquainted with select the transfer hubs for building the disjoint one-jump overlay ways, which enormously lessens the computational multifaceted nature of the LP calculation. Reproductions in light of a genuine ISP system and an engineered Internet topology demonstrate that our proposed calculation can diminish the system clog proportion significantly, and accomplish top notch overlay directing administration.
Link Stability Based On Qos Aware On - Demand Routing In Mobile Ad Hoc Networks
BGP-papaer
1. An Investigation into the Limitations of the Border
Gateway Protocol
“Border Gateway Protocol (BGP) should be upgraded to prevent
the possibility of large quantities of network traffic from being
misdirected. The system underpins the flow of internet traffic, with
around 12,000 routers using BGP to direct traffic between
130,000 networks.”
Stephen Dugan, Network Consultant
The Networked Multimedia Research Group
University College London
Abstract
As the Internet is evolving, increased
significance is vital towards its reliability and
performance. Increased heterogeneity driven
by wireless and optical switching; and
transitions to internet telephony and
television, depend for their success on ability
of routing protocols to realize the
performance objectives.
Inter-domain routing is clearly central
to the Internet and BGP, as the only deployed
inter-domain routing protocol is the focal
point of all concerns. BGP dates back to the
time of commercialization of the Internet and
is widely deployed and maintained. BGP
works well in practice but is now evident that
it suffers from a significant set of problems
and limitations. Though equivocally
recognized that the reliability and
performance of BGP is critical to the
functioning of the Internet; it does not
however provide performance or security
guarantees.
This paper surveys two of the critical
BGP limitations, namely load balancing and
BGP security. We have tried to explore the
aforesaid limitations in the existing scenario
and the systemic and operational implications
of proposed solutions. Our study, through
this paper, not only emphasizes on the
prevailing scenario, the problems and
solutions but also calls for further
introspection.
Inter-domain Routing: The Basics
The current Internet is a decentralized
collection of computer networks from all
around the world. Each of these networks
is typically known as a domain or an
autonomous system (AS). An AS is a
network or group of networks under a
common routing policy, and managed by
a single authority. Today, the Internet is
basically the interconnection of more than
20,000 ASes[28]. Interdomain routing focuses
on the exchange of routes to allow the
transmission of packets between different
ASes using the inter-autonomous system
routing protocol, the Border Gateway
Protocol (BGP).
Load Balancing: The Scenario
Consider a network, where exists, from
one router, multiple paths to a single
destination (say, net Z) and having the
same link cost. The process by which one
can distribute the traffic equally form the
router to destination, net Z, is called Load
balancing. Load balancing can be done or
achieved either on a packet by packet basis or on
a session by session basis [21].
The significance of load balancing
in a network corresponds to better link
utilization; ignoring which one might
observe a state of either links getting
flooded or some of links not being
utilized at all. In dynamic routing protocol
like BGP, only ‘one’ best path towards the
destination is preferred and all other paths
Hamid Shahzad & Nishant Jain
Department of Microelectronics and Information Technology
Royal Institute of Technology (KTH), Stockholm
2. 2
are ignored. But in case of two or multiple
paths having the same metric value, load
balancing could be of great impact for better
utilization of given bandwidth within network.
The succeeding text in this section,
through some cases, identifies some critical
scenarios regarding load balancing in inter-
domain routing using BGP.
Consider a case in which the
customer’s AS has multiple links with the
provider’s AS. The network topology is such
that links originate from one router in the
customer’s AS and terminate at multiple
routers within the provider’s AS.
The question that attains significance
here is how to achieve load balancing over
multiple paths when sending traffic from
customer’s network if a.) all the available
paths have same metric, or b.) if all possible
paths do not have same metric?
In another scenario, multiple routers at the
customer’s end have BGP peering with
multiple routers of the same provider, thus
having more than two paths to the
destination. Again, load balancing deems
inapplicable here because of BGP’s inherent
behavior of selecting the best path from all
paths.
Similarly, in a case where a single
router of the customer’s network is
multihomed to two different service
providers, one faces the same problem. Again,
the load balancing is not practically possible
because of BGP’s behavior to use one best
path from all the paths learned through
different AS for a single destination.
Load Balancing: Preliminary Suggestions
The aforesaid scenarios indicates that need of
the hour is to formulate suggestions to induce
support for load balancing in the BGP. The
significance lies in the fact that each link in
the network should be utilized equally for the
better utilization of given bandwidth, to the
best of available capacity. Considering the
inherent behavior of BGP to select and use
one best path, practical load balancing on
multiple links seems to be a distant reality.
From the techniques available, the one
that could substantially substitute for load
balancing is load sharing. Succeeding text
explains systematic implementation of
load sharing.
Considering a situation where
customer’s AS has multiple links with that
of the provider’s, one can achieve load
balancing by storing all the possible paths
to the destination, having the same metric,
in the router routing table. Whenever the
router is asked to forward the routing
information, it selects paths alternatively
from all paths each time. So what is
advantage? And how selection of the
routes from routing table will occur? The
advantage is that all paths with the same
metric value will be available in same
routing table. Hence a mechanism, like the
round robin scheme, could be adopted to
select the paths alternatively. In this way
almost all possible paths to the destination
can be equally used without stressing or
overloading just one path. At one time
one can store up to six possible paths
towards the same destination. Load
sharing through this process will be
possible only if customer’s AS is receiving
identical updates from the fix provider.
This method will not be applicable in a
multi-provider scenario [2].
This approach can be enhanced to
adapt to a situation where the links have
different metric, for example have
different costs. The routes are first
stored in the routing table of the router
and then a policy is set for router to use
the routes based on their cost. The
approach is that router should use the
lower cost routes more than the higher
cost routes. This enhanced approach is
called unequal cost load balancing.
It is known that load balancing is
unachievable in a scenario where multiple
routers within the customer’s AS are
connected to the same provider. In this
case load sharing is achieved by the
adapting to the concept of traffic sharing.
3. 3
Here, the inter-domain routing is efficiently
implemented by defining the policies to use
one link for forwarding and receiving routing
information under normal circumstances. In
other words, the preferred link takes the lead
all the times. If this link goes down due to
some malfunction then the handle is
transferred to the other available link for
forwarding the routing updates. By doing
this, traffic sharing as well as network stability
is achieved; ensuring that multiple links
remain in use.
Furthermore, consider another
scenario where the single router from
customer’s AS is connected to two different
providers. Here the customer’s AS has
multiple outward connection. BGP’s behavior
of selecting one best path will again inhibit
load balancing and load sharing deems to be
an efficient way of attaining similar objective.
Load sharing is implemented by defining a
policy in the customer’s network. The policy
should be defined to divide all the end users
which exist in the customer’s network in two
groups. The segregation into groups should
be based on IP prefixes in a way that end
users from one group are strained to use one
link (say ISP1) and the ones from other group
use another link (say ISP2) to reach the
internet. Both incoming and outgoing traffic
for end users will flow from their allocated
link.
BGP Security: The Issues
There is an increasing level of concern
amongst many operators and researchers that
the vulnerabilities of BGP may cause large
disruptions of service under possible attacks
[26, 27]. This and subsequent sections will
focus on security related issues that exist with
the current inter-domain routing architecture
and BGP protocol.
BGP messages are subject to
modification, deletion, forgery, and replay.
The causes of these exploits are normally:
malicious intent or misconfigured BGP
routers. Spurious messages can originate from
malicious sources or accidentally
misconfigured peers.
Spurious messages originating
from malicious sources can manipulation
the data packets to introduce errors in
routing tables. There exists three primary
limitations of that contribute towards
security concerns. Firstly, BGP does not
protect the integrity, originality and source
authentication of messages. Secondly,
BGP does not validate an AS’s authority
to announce reachability information.
Lastly, BGP does not ensure the
authenticity of the path attributes
announced by an AS.
The effects of misconfiguring a
BGP router can also be similar to those of
an attack. The two types of globally
identified misconfigurations that
contribute towards BGP security are: a.)
origin misconfiguration, where a router
exports a route it should have filtered and
b.) origin misconfiguration, where an AS
accidentally injects a prefix into the global
BGP tables.
BGP security relates to three types
of communication scenarios: control
messages when setting up a session,
reachability updates and error messages
throughout the duration of a session.
Manipulation in either of the aforesaid
communication scenarios corresponds to
the following security vulnerabilities in
BGP: a.) Eavesdropping, b.) Message
Replay, c.) Message Insertion, d.) Message
Deletion, e.) Message Modification, f.)
Man-in-Middle & g.) Denial of Service.
Eavesdropping can be simply
understood as unauthorized interception
and listening to data on the wire; thus
gaining unauthorized access to sensitive
policy and route information being
forwarded between ASes.
Message replay is unauthorized
interception and recording of messages,
then resending them to the original
recipient; thus confusing the routing
protocol. Withdrawn routes can be re-
4. 4
asserted or valid ones could be withdrawn
with this type of vulnerability.
Message insertion is to insert forged
messages into a BGP session; thus
erroneously terminating BGP sessions
between peers or injecting bad routing data.
Transport protocol, TCP, provides limited
protection while BGP does not directly
protect against this.
Message deletion is to intercept and
delete a message passed between BGP peers;
thus leading to erroneous routing tables.
Message modification is to remove
messages from a BGP session, modifies them,
and reinserts them. This leads to erroneous
routing, disruption of peering relationships
thus resulting in routing failures.
Man-in-the-middle vulnerability is
similar to that of message insertion, deletion
and modification where an authorized entity
inserts itself between two peers and poses as
the sender to the receiver and vice versa. The
vulnerability exists because BGP does not
provide authentication of sources.
Denial of service vulnerability is where
the victim router is flooded with messages.
This flood the routing table with fake or
unnecessary routes, causing the table size to
exceed its capacity.
BGP Security: The Solution
To summarize, there are two main types of
security issues that exist with the current inter-
domain routing architecture and BGP
protocol. One, being the possible attacks on
the transmission of BGP messages by
legitimate routers and the other relates to the
lack of authentication in BGP.
Given that two BGP peers maintain a
BGP session over a TCP connection between
themselves, the endpoints of this TCP
connection (IP addresses and port numbers)
can often easily be determined by a distant
attacker. Furthermore, for a BGP router, a
BGP session remains up as long as BGP
messages can be exchanged over the TCP
connection. This implies that if the TCP
connection fails for any reason, the BGP
session fails as well. An attacker could
exploit this weakness by sending spoofed
TCP segments to cause a TCP connection
supporting a BGP session to fail.
One solution to address this problem
is to authenticate the TCP segments
carrying BGP messages by relying on
MD5 [28]. This forces BGP peers to
maintain a shared password. Another
solution is to use filters on the border
routers to ensure that spoofed packets
using local addresses as sources cannot
reach the network. This solution is also
applicable to ensure that a distant attacker
is not able to send spoofed BGP messages
inside an existing BGP session. These
solutions, however, do not tackle the root
of the problem and that is, how to devise
robust BGP sessions among BGP routers.
The second type of security issues
relates to the lack of authentication in
BGP where a BGP router can be
configured to advertise any IP prefix. In
any case, a BGP router should only be
allowed to advertise IP prefixes that have
been either allocated to its ASes, or
learned from legitimate peer or customer
ASes.
A first solution to improve the
security of BGP is implementation of S-
BGP. S-BGP relies on a public key
infrastructure (PKI) to allow routers to
include route verification with each
advertisement. Route verification is a
cryptographic signature confirming that
the S-BGP speaker is allowed to advertise
this path. The main concerns about S-
BGP compared to BGP are the cost
(CPU, memory, and bandwidth) of
producing, storing, and distributing
attestations, and the need to bootstrap the
PKI. Therefore, several alternate solutions
have been proposed to lower the cost of
securing BGP .
Another solution is the
implementation of Secure origin BGP
(SoBGP), which is an extension to BGP
[Ng 2002]. SoBGP adds small security
5. 5
enhancements to the existing BGP protocol
by introducing a new message type,
SECURITY. The SECURITY message is
used by BGP speakers to share certificates
and verifications. The data of these messages
are signed by the sender and allows the
receiver to validate the public key bindings,
policy, or routing data.
SoBGP provides three types of
certificates transported by the SECURITY
message: Entity, Policy and Authorization.
The entity certificate is used to verify the
existence of an source) within a routing
system. The policy certificate provides
information about an AS, which can be
used to validate its authenticity. The
authorization certificate provides information
about an AS’s authority to announce an
address. This latter certificate is used to
provide origin authentication.
An upcoming solution to secure
interdomain routing is the Interdomain Route
Validation (IRV) service. The IRV server in
an AS queries IRV servers in other ASes for
validation of received routing information.
Upon reception of an update message, a
receiving BGP speaker will request to its local
IRV service for the confirmation of accuracy
of the received information. The query
transaction is executed over a secure transport
(e.g., IPsec, TLS/SSL). Because the IRV
queries sources directly over a secure
transport, it does not incur the signature costs
of S-BGP style attestation generation or
validation.
Each AS is responsible for
determining when an update messages should
be validated. Upon deciding a message is
suspicious, the AS can query all of the
relevant ASes to verify the authenticity and
accuracy of the contents.
An origin is authenticated in IRV in a
similar manner to how sources are
authenticated.
A path is validated by querying each
AS in the path. The path is deemed valid if
the ASes acknowledge transmission of the
path. This operation may consume many
resources or take considerable time. Such
queries should be performed by an
external service.
Conclusion
In the past few years the Internet has
largely expanded in several ways. First, the
number of ASes connected to the Internet
has increased enormously Secondly, the
number of connections per AS to the
network has also significantly augmented
and thirdly, the number and diversity of
the applications supported in the Internet
have remarkably increased as well. This
tendency has increased the demands on
the scale of the network, and hence is
placing significant pressure on the
scalability and security of BGP.
Several issues remain to be solved
in the area of interdomain routing or
needs further research.
For the better utilization of link
bandwidth in the network, though this
paper describes implementation of some
existing techniques to induce the support
for load balancing, but the area is wide
open for further research to either
develop advanced and efficient load
balancing techniques or to develop an
enhanced BGP protocol with inherent
support for load balancing.
On the security side, the issues
that are being addressed today are hop
integrity, origin authentication and path
validation. Enhancements to the protocol,
such as TCP MD5 Signatures, serve to
add much needed security measures.
While moving towards more
complex solutions and public key
infrastructures seems like a lot of work
but it may be the best way to ensure that
the Internet stays reachable and secure in
the years to come.
6. 6
References
[1] Y. Rekhter and T. Li, "A Border Gateway
Protocol 4 (BGP-4)," RFC 1771, Mar. 1995.
[2] S. Halabi and D. McPherson, Internet
Routing Architectures, 2nd ed., Cisco Press,
2001.
[3] T. Bu, L. Gao, and D. Towsley, "On
Routing Table Growth," Proc. IEEE Global
Internet Symp., 2002.
[4] S. Bellovin et al., "Slowing Routing Table
Growth by Filtering Based on Address
Allocation Policies," unpublished manuscript,
June 2001.
[5] IETF Site Multihoming in IPv6 Working
Group,
http://www.ietf.org/html.charters/multi6-
charter.html.
[6] A. D. Jaggard and V. Ramachandran,
"Towards the Design of Robust Inter-domain
Routing Protocols," IEEE Network, Special
Issue on Interdomain Routing, Nov./Dec.
2005.
[7] S. Murphy, "BGP Security Vulnerabilities
Analysis," Internet draft, draft-ietf-idr-bgp-
vuln-01.txt, Oct. 2004, work in progress.
[8] A. Heffernan, "Protection of BGP
Sessions via the TCP MD5 Signature
Option," RFC 2385, Aug. 1998.
[9] R. Mahajan, D. Wetherall and T.
Anderson," Understanding BGP
Misconfigurations," ACM SIGCOMM 2002,
Aug. 2002.
[10] S. Kent, C. Lynn, and K. Seo, "Secure
Border Gateway Protocol (S-BGP)," IEEE
JSAC, Apr. 2000.
[11] G. Goodell et al., "Working Around BGP:
An Incremental Approach to Improving
Security and Accuracy of Interdomain
Routing," NDSS, Feb. 2003.
[12] W. Aiello, J. Ioannidis, and P. McDaniel,
"Origin Authentication in Interdomain
Routing," Proc. 10th ACM Conf. Comp. and
Commun. Sec., 2003.
[13] R. White, "Securing BGP through Secure
Origin BGP," IP J., Sept. 2003.
[14] Y.-C. Hu, A. Perrig, and M. Sirbu, "SPV:
Secure Path Vector Routing for Securing
BGP," ACM SIGCOMM 2004, Sept. 2004.
[15] M. Zhao, S. Smith, and D. Nicol,
"The Performance Impact of BGP
Security," IEEE Network, special issue on
Interdomain Routing, Nov./Dec. 2005.
[16] B. Huffaker et al., "Distance Metrics
in the Internet," IEEE Int'l. Telecommun.
Symp., 2002.
[17] D. Walton, A. Retana, and E. Chen,
"Advertisement of Multiple Paths in
BGP," Internet draft, draft-walton-bgp-
add-paths-04.txt, Aug. 2005, work in
progress.
[18] R. K. C. Chang and M. Lo, "Inbound
Traffic Engineering for Multihomed ASes
Using AS Path Prepending," IEEE
Network, Mar. 2005.
[19] B. Quoitin et al., "Interdomain Traffic
Engineering with Redistribution
Communities," Comp. Commun., vol. 27,
no. 4, 2004.
[20] F. Guo et al., "Experiences in
Building a Multihoming Load Balancing
System," INFOCOM 2004, 2004.
[21] Security Issues in the Border Gateway
Protocol (BGP). Evangelos Kranakis P.C.
van Oorschot Tao Wan, School of
Computer Science, Carleton University,
Ottawa, Canada.
[22] www.cisco.com (BGP e-Learning
Project).
[23] http://web.it.kth.se/~khan
[24]www.noxs.it/documentazione/multi_
homing_wp.pdf
[25]www.cisco.com/traffic-engineering
[26] RFC 1773 - Experience of BGP-4.
[27] RFC 1774 - Protocol Analysis
[28] CIDR report, http://www.cidr-
report.org. July 2005.