Advance Routing Technology for Fast Ip Network Recovery

Only available on StudyMode
  • Topic: Routing, Routing protocol, Dijkstra's algorithm
  • Pages : 30 (3399 words )
  • Download(s) : 35
  • Published : May 30, 2013
Open Document
Text Preview
ADVANCE ROUTING TECHNOLOGY FOR FAST IP NETWORK RECOVERY

Mini Project Report Submitted to

Jawaharlal Nehru Technological University, Hyderabad.

In Partial fulfillment of the requirement for the award of the Degree of

Bachelor of Technology

In

Computer science and engineering

By

PENTA VENKATA MADHUSUDHANA RAO096A1A0518

Under the Guidance of

Mr. ERUKULLA AVINASH M.E

ASSISTANT PROFESSOR

[pic]

HASVITA INSTITUTE OF MANAGEMENT AND TECHNOLOGY

(Affiliated to JNT University, Hyderabad)

Main Road Keesara, R.R. Dist-501 301 2012-13

ACKNOWLEDGEMENT

We express our great pleasure to have an opportunity to take up the project work under the guidance of Sri Dr. Neelima, principal of HASVITA INSTITUTE OF MANAGEMENT AND TECHNOLOGY whose invariable references suggestions and encouragements have immensely helped us in the successful completion of this project.

We express our sincere thanks and gratitude to Mr. erukulla avinash M.E, HOD, Department of computer science and engineering, hasvita institute of management and technology for valuable help and encouragement throughout the project.

We express our deep sense of gratitude to our internal guide Asst.Prof.mr. erukulla avinash M.E, Department of computer science and engineering, hasvita institute of management and technology for valuable help and encouragement throughout the project.

Finally we thankful to everyone who was directly and indirectly helped us to make this project work a great success.

P.V.MADHUSUDHANA RAO (096A1A0518)

P.SOMESHWAR (096A1A0519)

P.PAVAN KUMAR (096A1A0520)

T.VINODA (096A1A0526)

CONTENTS

ABSTRACT

CHAPTER 1

1. Introduction

1. Feasibility study

CHAPTER 2

1. Requirements

CHAPTER 3

2. System Analysis

1. Existing System

2. Proposed System

3. Modules

CHAPTER 4

3. System Design

4.1 state chart diagram

CHAPTER 5

4. Sample Coding

CHAPTER 6

5. System Testing

6. Output Screens

ABSTRACT

As the Internet takes an increasingly central role in our communications infrastructure, the slow convergence o routing protocols after a network failure becomes a growing problem. To assure RAPID recovery from link and node failures in IP networks, we present a new recovery scheme called numerous Routing Configurations (NRC). Our proposed scheme guarantees recovery in all single failure scenarios, using a single mechanism to handle both link and node failures, and without knowing the root cause of the failure. NRC is strictly connectionless, and assumes only destination based hop-by-hop forwarding. NRC is based on keeping additional routing information in the routers, and allows packet forwarding to continue on an alternative output link immediately after the detection of a failure. It can be implemented with only minor changes to existing solutions. In this paper we presents, and analyze its performance with respect to scalability, endorsement path lengths, and load distribution after a failure. We also show how an estimate of the traffic demands in the network can be used to improve the distribution of the recovered traffic, and thus reduce the chances of congestion when NRC is used.

INTRODUCTION

As the Internet takes an increasingly central role in our communications infrastructure, the slow convergence routing protocols after a network failure becomes a growing problem. To assure RAPID recovery from link and node failures in IP networks, we present a new recovery scheme called numerous Routing Configurations (NRC). Our proposed scheme guarantees recovery in all single failure...
tracking img