THE INTERNET AND ITS PROTOCOLS A COMPARATIVE APPROACH PDF

adminComment(0)

The Internet and Its Protocols A Comparative Approach This page intentionally left blank The Internet and Its Proto. The Internet and Its Protocols: A Comparative Approach (The Morgan Kaufmann Series in Networking) [Adrian Farrel] on ciofreedopadkin.ga *FREE* shipping on. The Internet and its protocols: a comparative by Adrian Farrel. The Internet and its protocols: a comparative approach. by Adrian Farrel. Print book. English.


The Internet And Its Protocols A Comparative Approach Pdf

Author:YOULANDA JAFFRAY
Language:English, Arabic, Portuguese
Country:Chile
Genre:Technology
Pages:756
Published (Last):02.01.2016
ISBN:372-3-38190-738-4
ePub File Size:15.74 MB
PDF File Size:12.78 MB
Distribution:Free* [*Registration Required]
Downloads:43742
Uploaded by: EVIE

download The Internet and Its Protocols - 1st Edition. Print Book & E-Book. Internet and Its Protocols. 1st Edition. A Comparative Approach. The Internet and Its Protocols: A Comparative Approach (The Morgan. Kaufmann Series in Networking) PDF Read by Adrian Farrel eBook or site. The Internet and Its Protocols: A Comparative Approach (The Morgan Kaufmann . Kaufmann Series in Networking) by Adrian Farrel ebook PDF download.

Skip to content. Search for books, journals or webpages All Webpages Books Journals. View on ScienceDirect. Adrian Farrel. Hardcover ISBN: Morgan Kaufmann. Published Date: Page Count: View all volumes in this series: The Morgan Kaufmann Series in Networking. Sorry, this product is currently out of stock.

Flexible - Read on multiple operating systems and devices. Easily read eBooks on smart phones, computers, or any eBook readers, including site. When you read an eBook on VitalSource Bookshelf, enjoy such features as: Access online or offline, on mobile or desktop devices Bookmarks, highlights and notes sync across all your devices Smart study tools such as note sharing and subscription, review mode, and Microsoft OneNote integration Search and navigate content across your entire Bookshelf library Interactive notebook and read-aloud functionality Look up additional information online by highlighting a word or phrase.

Some of these operate directly over data-link layer protocols, some use IP, and others utilize transport protocols. Functionally, many routing protocols maintain sessions between adjacent or remote computers, making matters still more confusing. Operationally, however, the routing protocols are network layer commodities.

However, the MPLS protocols themselves are responsible for installing the forwarding rules within the network, and they operate more at the level of routing protocols running over IP or making use of the transport protocols and establishing sessions between neighbors.

Refer to Figure 1. In some cases a five-layer IP model is used that merges the top three OSI layers into a single application layer, but others choose to discard the model entirely after introducing it as a concept to explain that features and functions are provided by protocols in a layered manner. This book takes a middle road and only uses the architectural model loosely to draw distinctions between the data-link protocols that are responsible for transporting IP data, the IP protocol itself as a network protocol, and the transport protocols that provide distinctive services to application programs.

One component might handle management of the router, another could have responsibility for forwarding data, and yet another might be given the task of dealing with control protocol interactions with other computers in the network. When a network is viewed as a collection of computers partitioned in this way, it can be seen that messages and information move around the network between components with the same responsibility. For example, one computer might process some data using its dedicated data-processing component.

The first computer sends the data on to another computer where it is also processed by the dedicated data-processing component, and so on across the network. This view builds up to the concept of processing planes in which networked computers communicate for different purposes.

Communications between computers do not cross from one plane to another, so that, for example, the management component on one computer does not talk to the control protocol component on another computer.

However, within a single computer there is free communication between the planes. Four planes are generally described. The Data Plane is responsible for the data traffic that passes across the network. The Management Plane handles all management interactions such as configuration requests, statistics gathering, and so forth. The Control Plane is where the signaling and control protocols operate to dynamically interact between network computers.

The Routing Plane is usually considered as distinct from the Control Plane simply because the routing protocols that dynamically distribute connectivity and reachability information within the network are usually implemented as separate components within network computers. Some people like to add a fifth plane, the Application Plane. However, application transactions tend to be end-to-end and do not require any interaction 8 Chapter 1 Overview of Essentials Network computers have a presence in each of the planes Management Plane Control Plane Routing Plane Data Plane Figure 1.

Of course, the key interaction at each computer is that every other plane uses the Data Plane to transfer data between computers. Other interactions might include the Routing Plane telling the Data Plane in which direction to send data toward its destination, the Data Plane reporting to the Management Plane how much data is being transmitted, and the Management Plane instructing the Control Plane to provision some resources across the network.

In Figure 1. The dotted lines within each plane indicate the communication paths between the computers. In the Data Plane, the communication paths map to the physical connections of the network, but in the other planes the communications use logical connections and the underlying Data Plane to form arbitrary associations between the computers.

The connectivity can be different in each plane. The Transport Plane is sometimes shown as separate from the Data Plane. This allows a distinction between the physical transport network which may include fiber rings, repeaters, and so forth, and the components such as the Internet Protocol and data-link layer software that manage the data transfer between computers. An application generates a stream of data to be sent to a remote application for example, the contents of a file being sent across FTP and hands it to the presentation layer for buffering, translation, and encoding into a common format.

There is then a pause while the session layer sets up an end-to-end connection. The transport layer chops this data up into manageable pieces for transmission and prepends a header to give coordinates to the remote transport component, and then passes the data to the network layer.

1st Edition

The data-link layer prepends its own header and may also chop the data up further, if necessary. The data-link layer presents the data to the physical layer, which encodes it for transmission as a bit stream according to the physical medium.

The effect of this is that a considerable amount of protocol overhead may be needed to transmit some data end to end, as shown in Figure 1. At the data-link layer, protocol and data messages are known as frames.

At the network and transport layers they are called packets. At higher layers they are known simply as messages.

An MTU at the network layer, therefore, describes the largest network layer packet that can be encapsulated into a data-link layer frame. The MTU at the data-link layer describes the largest frame that can be supported by the physical layer.

This means that the operational details of the data-link layer protocols are beyond the scope of the book. However, the following short sections give an overview of some of the important data-link technologies and provide useful background to understanding some of the reasons behind the nature of IP and its related protocols.

It is important to understand how IP is encapsulated as a payload of data-link protocols and also how data-link technologies are used to construct networks of differing topologies. This can help when decoding packet traces and can explain why IP packets are a particular size, why the Internet protocols have their specific behaviors, and how IP networks are constructed from a collection of networks built from different data-link technologies.

There is a very large number of data-link layer protocols. Normal data speeds are either 10 or 1. Ethernet is a point-to-point or multi-access technology. A pair of nodes may be connected by a single cable, or multiple nodes may participate in a network. In the latter case, the network is typically drawn as on the left-hand side of Figure 1. In practice, however, connectivity is provided through hubs, which allow multiple nodes to connect in.

A hub is not much more than a cable splitter: Ethernet messages, as shown in Figure 1. These are 6-byte bit MAC addresses that uniquely identify the sender and intended recipient.

When a node wants to send an Ethernet message it simply formats it as shown and starts to send. This can cause a problem called a collision if more than one node sends at once.

Collisions result in lost frames because the signal from the two sending nodes gets garbled. This is often given as a reason not to use Ethernet, but a node that wants to send can perform a simple test to see if anyone else is currently sending to considerably reduce the chance of a collision. This can be combined with a random delay if someone is sending so that the node comes back and tries again when there is silence on the wire.

The risk of collisions can be further reduced by the use of Ethernet switches that replace hubs in Figure 1.

The Internet of Things: Key Applications and Protocols

As can be seen in Figure 1. These fields together allow the receiver to synchronize and know that a data frame is coming. The first proper fields of the frame are the destination and source addresses.

In the The minimum frame length not counting preamble and start delimiter is 64 bytes, so the minimum payload length is 46 bytes. If fewer bytes need to be sent, the data is padded up to the full 46 bytes. The Ethernet differs from Instead, the length field is reinterpreted as a payload type indicator. Values greater than 1, that is values that could not be misinterpreted as lengths are used to indicate the type of the payload for example, IP so that the receiver can deliver the data to the right application.

In this format, the payload length is still constrained to be between 46 and 1, bytes. The last 4 bytes of the message carry a cyclic redundancy check CRC. The CRC is a simple checksum computed on the whole frame to protect against accidental corruption. It is worth noting that the simplicity, stability, and relative cheapness of Ethernet lead not only to its popularity as a networking protocol but also to its use as a communications infrastructure in compound devices, allowing line cards and central processors to communicate across a bus or backplane.

As its name suggests, the 1. A token passes around the ring from node to node, and when a node wishes to transmit it must wait until it has the token. This prevents the data collisions seen in Ethernet, but increases the amount of time that a node must wait before it can send data. As with Ethernet, Token Ring is a multi-access network, meaning that any node on the ring can send to any other node on the ring without assistance from a third party.

It also means that each node sees data for which it is not the intended recipient. In Ethernet, each node discards any frames that it receives for which it is not the destination, but in Token Ring the node must pass the frame further around the ring, and it is the responsibility of the source node to intercept frames that it sent to stop them from looping around the ring forever.

Of course, a major disadvantage of a ring is that it is easily broken by the failure of one node. To manage this, Token Rings are actually cabled as shown on the right-hand side of Figure 1. Each computer is on a twin cable spur from a Multiple Access Unit MAU , making the network look like a hub-and-spoke configuration. The MAU is responsible for taking a frame and sending it to a node; the node examines the frame and passes it on along the ring by sending it back to the MAU on its second cable; the MAU then sends the frame to the next node on the ring.

MAUs may also be chained together as shown in Figure 1. Token Ring frames are not substantially different from Ethernet frames because they have to do the same things: There are three fields that comprise the token shown in gray in Figure 1. It is connection-oriented, meaning that data between two end points flows down the same path through transit nodes in a regulated way. Alternatively, the connections may be preestablished through management or configuration actions, in which case they are known as permanent virtual circuits PVCs.

English abstract

The links in an ATM network are point-to-point, with each ATM switch responsible for terminating a link and either switching the ATM frames called cells on to the next link or delivering the data to the local application.

ATM nodes are often shown connected together in a ring topology. This has nothing to do with the data-link or physical layer technologies but much to do with the economics and the applications that can be built. A full mesh of point-to-point links connecting each pair of nodes in a network would be very expensive since it requires a lot of fiber, as shown in the network on the left of Figure 1.

Full internode connectivity can be achieved through a much more simple network since ATM can switch cells along different paths to reach the right destination.

However, as shown in the network in the center of Figure 1. ATM networks are often fibered as rings, providing cheap resilience. The network on the right-hand side of Figure 1. ATM cells are all always exactly 53 bytes long.

The standard data-bearing cell, as shown in Figure 1. The header information indicates whether flow control is used on the connection Generic Flow Control field , the destination address of the connection Virtual Path Indicator and Virtual Channel Indicator , how the cell should be handled in case of congestion the Cell Loss Priority field , and the Header Error Control field. The last remaining field the Payload Type field indicates how the data is wrapped.

PT C 16 Chapter 1 Overview of Essentials padded and it is the responsibility of the network level protocol for example, IP to supply enough information in length fields to determine where the data ends and where the padding starts. Originally intended as ways of carrying multiple simultaneous voice connections telephone calls over the same fiber, SONET and SDH use a technique known as time division multiplexing TDM to divide the bandwidth of the fiber between the data streams so that they all get a fair share and so that they all deliver data at a steady rate voice traffic is particularly sensitive to data that arrives in fits and starts.

PoS has been one of the factors enabling the rapid growth of the Internet because it makes use of existing infrastructure, allows high bandwidth, and offers relatively long hundreds of kilometers links.

TDM makes it possible for several smaller data flows to be combined on a single fiber, allowing several data streams to share a single physical link. SONET traffic may be further combined using different wavelengths on a single fiber through wave division multiplexing WDM to increase the amount of traffic carried. Connections to desktop computers that is, hosts very rarely use PoS. Instead, they are connected to dedicated routers using local area network technologies such as Ethernet or Token Ring.

The routers are responsible for directing traffic between areas of the network and for aggregating the low-bandwidth traffic onto highbandwidth links. The PPP frame, shown in Figure 1. This makes it easy for the receiver to spot when a frame starts and to distinguish data from an idle line. Note that the overhead of control information to data for PoS is very low about 3 percent for large packets compared with the other chief technique for sending data over fiber-optic links Asynchronous Transfer Mode [ATM] , where the overhead is as much as 15 percent of the data transmitted.

Dial-up networking should be considered to cover communications over any link that is activated for the duration of a transaction and then is dropped again. This includes phone lines, ISDN, cable modems, and so on. Dial-up networking poses particular challenges in IP and is discussed at greater length in Chapter The IEEE defines the This may be used on its own or in association with an When a SNAP header is used with The SNAP header fields are used to identify the payload protocol.

The transport protocols are shown in gray. SCTP is a relatively new transport protocol and currently only a few new protocols utilize it, but there is no technical reason apart from inertia caused by the existing deployed implementations why protocols that use TCP should not use SCTP. The routing protocols are shown with a cross-hatched background.

Note that they are distributed across the figure and use different transport mechanisms.

[PDF Download] IPv6 Second Edition: Theory Protocol and Practice 2nd Edition (The Morgan Kaufmann

See also Figure Further Reading Background material to some of the key networking technologies can be found in the following books: Academic Press. Further Reading 21 Token Ring: Broadband Networking: Artech House. The IEEE series of standards can be obtained from http: Some of the pertinent standards are: There is a chicken-and-egg definition that describes the Internet as the collection of all networked computers that interoperate using IP, and IP as the protocol that facilitates communication between computers within the Internet.

IP version four IPv4 is the most common version of the protocol in use, and this chapter focuses on that version. This chapter includes a brief section that examines the motivation for IP before moving on to examine the format of IPv4 messages, the meanings of the standard fields that they carry, and the checksum algorithm used to safeguard individual messages against accidental corruption. The way data is packaged into individual messages is explained.

Fundamental to the operation of IP are the addresses that are used to identify the senders and receivers of individual messages. IPv4 addressing is the subject of Section 2. There is information on how the address space is subdivided for ease of management and routing.

Section 2. It shows how messages are delivered based on the destination IP addresses and introduces three protocols designed to help discover and manage IP addresses within a network: IP also defines some optional fields that may be included in IP messages as needed. These fields manage a set of advanced features that are not used in standard operation but may be added to data flows to enhance the function provided to the applications that are using IP to transfer their data.

Everything else in this book depends on that choice since all of the many protocols described utilize IP to carry their messages, use IP addresses to identify nodes and links, and assume that data is being carried using IP.

If we want to play in the Internet we must use IP. It is, however, worth examining some of the motivation behind IP to discover why it was developed, what problems it solves, and why it continues to be central to the Internet. Each of these protocols has different formats for its frames and addresses as described in the previous chapter , and these formats are not interchangeable.

As long as all hosts are attached to the same physical medium there is no issue, but as we begin to construct networks from heterogeneous physical network types we must install special points of connection that convert from one data-link protocol to another.

There are some issues that immediately raise their heads when we try to do this. First, the addressing schemes on the two connected networks are different. When a frame with an Ethernet address is moved to a Token Ring the addresses must be mapped. As the number of network types increases, this addressing mapping function gets ever more complicated. A simpler solution is to provide an overarching addressing scheme that requires every node to implement just one address mapping function between the local physical addressing and the systemwide IP addressing.

The next problem is that the different networks do not all support the same size data frame. To demonstrate this in an extreme case, if a Token Ring network sends frames to an X. What is needed is a higher-level protocol that can be invoked to fragment the data into smaller pieces.

Many physical link types and data-link layer protocols are fundamentally unreliable—that is, they may drop frames without warning. Some are capable of detecting and reporting errors, but few can recover from such problems and retransmit the lost data such that the higher-layer protocols that is, the transport and application protocols that use the links are protected from knowledge of the problems. This means that a protocol must be run at a higher level to reliably detect and report problems.

IP does this, but does not attempt to recover from problems—this function is devolved further up the stack to become the responsibility of transport or application layer protocols. Ultimately, we need a single protocol that spans multiple physical network types to deliver data in a uniform way for the higher-level protocols. The path taken by the data is not important to the higher-level protocols although they may wish to control the path in some way and individual pieces of data are free to find their different ways across the network as resources are available for their transmission.

IP provides all of these functions, as shown in Figure 2. IPv4 is now ubiquitous, although it should be noted that version six of the protocol IPv6; see Chapter 4 is gaining support in certain quarters. IP is a protocol for universal data delivery across all network types.

Data is packaged into datagrams that comprise some control information and the 26 Chapter 2 The Internet Protocol payload data to be delivered. Datagram is a nice word invented to convey that this is a record containing some data, and with overtones from telegram and aerogram it gives a good impression that the data is being sent from one place to another.

Datagrams are connectionless because each is sent on its own and may find its own way across the network independent of the other datagrams. Each datagram may take a different route through the network. Note a very subtle difference between a packet and a datagram: A packet is any protocol message at the network or transport layer, and a datagram is any connectionless protocol message at any protocol layer, but usually at the network, transport, or session layers.

Thus, in IPv4, which is a connectionless protocol, the words packet and datagram may be used interchangeably. The control information in an IP datagram is necessary to identify the sender and recipient of the data and to manage the datagram while it is in transit. The control information is grouped together at the start of the datagram in a header.

It is useful to place the header at the start of the datagram to enable a computer to access it easily without having to search through the entire datagram. All of the datagram headers are formatted in the same way so that a program processing the datagrams can access the information it needs with the minimum of fuss.

The remainder of this section is dedicated to a description of the IPv4 header and to details of how IPv4 carries data within datagrams. This is shown as a byte-by-byte, bit-by-bit structure in Figure 2.

The first nibble shows the protocol version version four indicates IPv4; a value of 6 would be used for IPv6—see Chapter 4. The next nibble gives the length of the header, and because there are only 4 bits available in the length field and we need to be able to have a header length of more than 15, the length is counted in units of 4-byte words. The length field usually contains the value 5 because the count includes all bytes of the header that is, 20 , but may be greater if IP options are included in the header see Section 2.

The Type of Service byte is used to classify the datagram for prioritization, use of network resources, and routing within the network; this important function is described further in Section 2. Next comes a 2-byte field that gives the length of the entire datagram. The length of the data carried by the datagram can be calculated by subtracting the header length from the 2.

Obviously, this places a limit on the amount of data carried by one IP datagram to 65, bytes less the size of the header. The next three fields are concerned with how a datagram is handled if, part way across the network, it reaches a hop that must break the datagram up into smaller pieces to forward it.

This process is called fragmentation and is covered in the next section. The fields give an identifier for the original datagram so that all fragments can be grouped together, flags for the control of the fragmentation process, and an offset within the original datagram of the start of the fragment.

It is used to prevent datagrams from being forwarded around the network indefinitely through a process called looping, as shown in Figure 2. The original intent of the TTL was to measure the number of seconds that a datagram was allowed to live in the network, but this quickly became impractical because each node typically forwards a datagram within 1 second of receiving it and there is no way to measure how long a packet took to be transmitted between nodes.

So, instead, the TTL is used as a count of the number of hops the datagram may traverse before it is timed out. Implementations vary as to whether they decrement the TTL for the first hop from the source. This is important since it controls the meaning of the value 1 in the TTL when a datagram is created; it may mean that the packet may traverse just one hop, or it may mean that the packet is only available for local delivery to another application on the source node see Section 2.

In Figure 2. Node B is misconfigured 28 Chapter 2 The Internet Protocol and, instead of passing the datagram to the destination, it forwards it to node C— a forwarding loop exists. When the datagram arrives at node C for the second time, node C prepares to forward it to node A.

But when it decrements the TTL it sees that the value has gone to zero so it discards the packet. Many higher-layer protocols recommend initial values for the TTL field. These recommendations are based on some understanding of the scope of the higher-layer protocol, such as whether it is intended to operate between adjacent nodes or is supposed to span the entire network.

After the TTL, the IP header carries a protocol identifier that tells the receiving node what protocol is carried in the payload. This is important information as it tells the receiver to which application or software component the datagram should be delivered. Table 2. Note that there are only values that can be defined here and, although obviously when IP was invented this was thought to be plenty, the list of protocols defined and maintained by the Internet Assigned Numbers Authority Table 2.

IANA at their Web site http: The current solution to this is to make new protocols use a transport protocol such as UDP see Chapter 7 , which has the facility to carry far more client protocols. After the protocol identifier comes a 2-byte field that carries the Header Checksum used to verify that the whole of the header has been received without any accidental corruption.

The checksum processing is described in greater length in Section 2. Finally, within the standard IP header come two address fields to identify the sender of the message and its intended destination. IP addresses are 4-byte quantities that are usually broken out and expressed as 4-decimal digits with dots between them. Thus, the IP address field carrying the hexadecimal number 0xac would be represented as The choice of addresses for nodes within the network is not a random free-for-all because structure is needed both to ensure that no two nodes have the same address and to enable the address to be used for directing the datagram as it passes through the network.

IP options are used to add selective control to datagrams and are optional. Finally, there is the payload data that IP is carrying across the network.

Each has different characteristics that affect the way IP is used. For example, each has its own Protocol Data Unit PDU maximum size the largest block of data that can be transmitted in one shot using the network technology.

For X. IP itself allows a datagram of up to 65, bytes, as we have already seen, but some action has to be taken if the amount of data presented to the IP layer for transmission is greater than the maximum PDU supported by the network. Some network technologies support breaking the packet up into smaller pieces and reassembling it at the destination.

ATM is an example of this, which is a good thing since the ATM cell allows for only 48 bytes of data—if IP datagrams had to be made to fit inside ATM cells there would only be 28 bytes of data in each datagram! Other technologies, however, cannot segment and reassemble data, so there is a need for IP to limit the size of packets that are presented to the network.

Figure 2. Each datagram is assigned a unique Datagram Identifier which is placed in the IP header. This field might have been used to allow the datagrams to be reordered or to detect lost datagrams, and so it would not be unreasonable to make the value increase by one for each datagram, but this is not a requirement in RFC and must not be assumed.

The real purpose of this field comes into play if a datagram must be fragmented part-way across the network. Some applications may not be willing to have their data chopped up into separate datagrams—it may cause them a problem if they have to wait for all of the datagrams in a sequence to arrive before they can start to process the first one. This may be more of an issue for control protocols than it is for data transfer, since a control message must be processed in its entirety but data can simply be written to the output device as it arrives.

Consider the network shown in Figure 2. Here Node A is attached to an X.

When Node A sends packets to Node B it makes sure that no packet is larger than bytes. As the packet progresses, it traverses the X. When they transition to the Token Ring where the maximum PDU is 17, bytes, the packets can continue to be forwarded to the destination.

[PDF Download] The Internet and Its Protocols: A Comparative Approach (The Morgan Kaufmann

However, suppose Node B wishes to send a reply to Node A. These are forwarded toward Node A until they encounter the Ethernet, where they are too large. For the datagram to be forwarded, it must be fragmented into pieces that are no larger than 1, bytes.

Again, when the fragments reach the X. The process of fragmentation is illustrated in Figure 2. When data is presented to IP by an application it is broken up to be carried in separate datagrams, as already described.

When the datagrams reach a network where the maximum PDU is smaller than the datagram size, they are fragmented into smaller datagrams.

The IP header of each of the fragments is copied from the original datagram so that the TTL, source, and destination are identical. The datagram identifier of each of the fragments is the same so that all fragments of the original datagram can be easily identified. Each of the fragments must be collected and assembled into a single data stream to be passed to the application as if the whole original datagram had been received intact. This should simply be a matter of concatenating the data from the fragments, but there are two issues caused by the fact that datagrams might arrive out of order because of different paths or processing through the network.

We need to know where each fragment fits in the original datagram. This is achieved by using the Fragment Offset field in the IP header.

This is handled by insisting that fragmentation may only occur on 8-byte boundaries. If fragmentation of the data into blocks of less than 8 bytes were required, performance would be so bad that we might as well give up anyway.

So, as fragments arrive they can be ordered and the data can be reassembled. Implementations typically run a timer when the first fragment in a series arrives so that sequences that never complete because a datagram was lost in the network are not stored forever.

Many applications do not support receipt of out-of-order fragments and will reject the whole datagram if this happens, but they still use the fragment Offset and the Datagram Length to reassemble fragments and to detect when fragments are out of order.

Failed reassembly results in discarding of the entire original datagram. The second issue is determining the end of the original datagram. Initially, this was obvious because the Datagram Length less the Header Length indicated the size of the Payload Data, but each fragment must carry its own length. When the fragments are reassembled there is no way of knowing when to stop. We could wait for the receipt of a fragment with a different Datagram Identifier, but this would not help us if a fragment was lost or arrived out of order.

The problem is solved by using the third bit of the Flag field to indicate when there are more fragments—the More Fragments MF bit is set to 1 whenever there is another fragment coming and to zero on the last fragment. Note that the rule for fragmenting existing fragments is that if the original datagram has the MF bit set to 1, then all resultant fragments must also have this bit set to 1. If the original fragment has the bit set to zero, then all fragments except the last must have the MF bit set to 1 the last must retain the zero value.

Unfragmented datagrams carry a Fragment Offset of zero and the MF bit set to zero. Note that IP uses lazy reassembly of fragments. That is, reassembly is only done at the destination node and not at transit nodes within the network even if the datagrams are passing from a network with small PDUs to one that can handle larger PDUs. This is a pragmatic reduction in processing since it is 34 Chapter 2 The Internet Protocol unclear to a transit node that further fragmentation will not be needed further along the path.

It also helps to reduce the buffer space that would be needed on transit nodes to store and reassemble fragments. An application may want to prevent fragmentation within the network.

This is particularly useful if it is known that the receiving node does not have the ability or resources to handle reassembly, and is achieved by setting the second bit of the Flags field in the IP header that first bit is reserved and should be set to zero, and the third bit is the MF bit already described. A transit node that receives a datagram with the DF bit set to 1 must not fragment the datagram, and may choose a route that does not require fragmentation of the packet or must otherwise discard any datagram that cannot be forwarded because of its size.

Alternatively, fragmentation can be avoided by discovering the Maximum Transmission Unit MTU between the source and destination. This is the lowest maximum PDU on all the links between the source and destination. Some higher-level protocols attempt to discover this value through information exchanges between the nodes along the route.

They then use this information to choose specific routes or to present the data to IP in small enough chunks that will never need to be fragmented. Electrical systems, in particular, are subject to bursts of static that may alter the data before it reaches its destination. If the distortion is large, the receiver will not be able to understand the message and will discard it, but the risk is that the corruption is only small so that the message is misunderstood but treated as legal.

IP needs a way to protect itself against corrupt messages so that they may be discarded or responded to with an error message. For example, male rodents have higher exposure to ticks due to larger home range sizes than female rodents Staying on wide paths in the forest can reduce human exposure For sheep, exposure is likely limited in many areas where sheep are grazing in the mountains during summer, and hence outside the main distribution of ticks along the west coast of Norway 63 , However, sheep are often exposed to ticks during spring when they are released on the infields close to the farm before being sent to the main summer pastures at higher elevations Contracting an infection requires encountering an infected tick in the habitat, but also the subsequent successful transfer of the pathogen Fig.

Variation in tick encounter rates between different vertebrate hosts may be caused by differences in host behavior or by ticks having preferences for certain hosts 60 , Differences in host grooming behavior, ability to kill ticks, and immune defences among vertebrate hosts may further hinder successful transfer of tick-borne pathogens The early removal of ticks is certainly important for humans to avoid pathogen transfer Another important difference between livestock and humans is the number of tick bites per individual, which is probably much higher in livestock.

Higher number of tick bites on livestock may explain why the incidence of anaplasmosis in sheep and cattle is much higher than the incidence of Lyme borreliosis in humans, even though the prevalence of A.

The finding that exposure plays a large role in livestock disease raises concerns given the development of new practices for the more ethical stocking of livestock. Over the last 5 years, the number of cattle grazing on outfields has increased by 8.

A more environmentally friendly way of producing livestock may come at a cost of an increased incidence of tick-borne diseases. In contrast, more intense production will lead to more dairy cattle grazing on cultivating pasture that does not have forest vegetation, which will reduce contact with ticks.

Since , when the milk quota was put up for sale in Norway, there have been increases in herd size, in dairy production and in milk yield. Furthermore, since , there has been a large increase in the use of automatic milking systems AMS. The decreasing trend in babesiosis and anaplasmosis in cattle from onwards suggests reduced tick exposure due to more intensive production Fig. The same main pattern of emergence across the tick-borne diseases suggests some shared underlying limiting factor and that uncertainty in the data did not cause severe bias.

Nevertheless, caution regarding observation processes is necessary when comparing different disease records.

Supplementary Discussion. It is more difficult to diagnose anaplasmosis in live animals, due to weaker clinical symptoms, than it is to diagnose Lyme disease and babesiosis. The very similar patterns of emergence and drivers of anaplasmosis and babesiosis in cattle nevertheless suggest that these data are of parallel reliability over the duration of the study. In addition, the number of cases of babesiosis and anaplasmosis declined over time, despite improvements to the recording system over the duration of the study.

These potential sources of uncertainty should not affect the spatial patterns. The main patterns reported in this study are therefore unlikely to have been biased by observation error. Our study reveals relationships among livestock and human diseases and is consistent with a One Health perspective 4.

As shown in our study, a consistent way to quantify and determine the drivers of emerging infectious diseases has implications for the development of disease mitigation and prevention strategies It describes some of the important concepts in optimal placement of traffic within a network and outlines the extensions to routing protocols to provide some of the information that a traffic engineering application needs to do its job.

If fragmentation of the data into blocks of less than 8 bytes were required, performance would be so bad that we might as well give up anyway. This has nothing to do with the data-link or physical layer technologies but much to do with the economics and the applications that can be built.

IP needs a way to protect itself against corrupt messages so that they may be discarded or responded to with an error message. The estimated prevalence of A. Data Networks, by D. The IEEE series of standards can be obtained from http: However, since the s a number of structures identified as administrative and palatial buildings, along with residences and service areas, all of which are centrally located on the upper two terraces, have been excavated and reconstructed.