Please use this identifier to cite or link to this item:
http://dspace.dtu.ac.in:8080/jspui/handle/repository/13278
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | GODARA, AMIT | - |
dc.contributor.author | SRIVASTAVA, PIYUSH | - |
dc.contributor.author | GUPTA, SHOBHIT | - |
dc.date.accessioned | 2011-02-18T18:10:56Z | - |
dc.date.available | 2011-02-18T18:10:56Z | - |
dc.date.issued | 2006-01-31 | - |
dc.identifier.uri | http://dspace.dtu.ac.in:8080/jspui/handle/repository/13278 | - |
dc.description | BE THESIS | en_US |
dc.description.abstract | As we all know Internet is actually network of networks. There are millions of machines which are interacting simultaneously with each other through this single service. Client is never connected to the server directly, due to connections of various networks our request for the particular data from the server reach to us through various networks. Traceroute lets us determine the path that IP datagrams follow from our host to some other destination. It uses the IPv4 TTL field or the IPv6 hop limit field and two ICMP messages. It starts by sending UDP datagram to the destination with a TTL (or hop limit) of 1. This datagram causes the first-hop router to return an ICMP “time exceeded in transit error”. The TTL is then increased by one and another UDP datagram is sent, which locates the next router in the path. When the UDP datagram reaches the final destination, the goal is to have that host return an ICMP “port unreachable” error. This is done by sending the UDP datagram to a random port that is (hopefully) not in use on that host. | en_US |
dc.language.iso | en | en_US |
dc.relation.ispartofseries | TD-120; | - |
dc.subject | Traceroute | en_US |
dc.subject | Algorithm | en_US |
dc.title | TRACEROUTE ALGORITHM | en_US |
Appears in Collections: | B.E./B.Tech. Computer Engineering |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
GODARA-1-COE-8.pdf | 1.25 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.