Q2/A 14336 bytes datagram with an identification "X" is needed to be transmitted from destination B. It must be fragmented by the source before sending to its destination suc fragmented datagram size is not exceeding MTU 1500 bytes. 1.) II.) How many fragmented datagrams should the original datagram be fragment Specify the header length, total length, identification, flag and fragmentation each fragmented datagram.

Q2/A 14336 bytes datagram with an identification "X" is needed to be transmitted from destination B. It must be fragmented by the source before sending to its destination suc fragmented datagram size is not exceeding MTU 1500 bytes. 1.) II.) How many fragmented datagrams should the original datagram be fragment Specify the header length, total length, identification, flag and fragmentation each fragmented datagram.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Consider sending a 2000-byte datagram into a link with a MTU of 980 bytes. Suppose the original datagram has the identification number 227. How many fragments are generated? For each fragment, what is its size, what is the value of its identification number, fragment offset, and fragment flag?
Explain clearly the structural, functional, and logical characteristics of the fragmentation and reassembly modules. Your explanation must include a pseudocode and an example. Use the following example to explain: a datagram with a data size of 4000 bytes is fragmented into 3 fragments (assume the maximum available MTU size for this purpose is 1400 bytes) and transmitted using the Ethernet as the protocol at the data link layer.
A 4000 octet user data is to be transmitted over a network which supports a maximum user data size of 536 octets. Assuming the header in each IP data gram requires 20 octets, derive the number of datagrams (fragments) required and the contents of the following fields: Identification Total length Fragment offset More Fragments flag
Problem 1- IP Fragmentation Consider sending a 3500-byte datagram into a link that has an MTU of 1000 bytes. How many fragments are generated? What are their characteristics (i.e. what are the flags and offset values for each and start and ending of data bytes of each fragment (Assume that the DF flag was not set : )Solution: Assume that no optional fields of the IP header are in use (i.e. IP header is 20 bytes)
Explain the structural, functional, and logical properties of the fragmentation and reassembly modules in detail.A pseudocode and an example must be included in your explanation.To demonstrate, consider the following example:A datagram with a data size of 4000 bytes is fragmented into three pieces (assuming the highest allowable MTU size for this purpose is 1400 bytes) and transferred at the data link layer using Ethernet as the protocol.
For an index on the SSN field, assume the field size VSSN=20 bytes, record pointer size PR=10, block size B=512 bytes and r=5000. Then find out the below: Index entry size RI Index blocking factor BfrI Number of index blocks b
Problem 1-IP Fragmentation Consider sending 2000-byte datagram into a link that has an MTU of 500 bytes. a) How many fragments are generated? b) What are their characteristics (i.e. what are the flags and offset values for each and start and ending of data bytes of each fragment (Assume that the DF flag was not set :) Solution: Assume that no optional fields of the IP header are in use (i.e. IP header is 20 bytes) c) When a large datagram is fragmented into multiple smaller datagrams, where are these smaller datagrams reassembled? d) Explain how traceroute works. Include a traceroute to a host at least 8 hops away.
Assume one file has r = 10^6 records. Each record takes R = 100 bytes, of which 10 bytes are for the key of record. Suppose the key balues range from 1 to 1,000,000, inclusive. Assume the block size B is 1000 bytes for all files, and that an address (block pointer, tree node poiinter, or data record pointer) takes 10 bytes. How many data block accesses on the average are needed to fetch a record by using linear search?
DB Lab Sheet 8 Normalization Using INF, 2NF and 3NF rules in order to achieve the final independent schema required: Name Grade Grade Grade Addressl Address2 Address3 Averag Email Email 2 3 Adam 60 91 85 101 JM London UK 78.6 X@X A@A Alex 45 53 90 221 High Rd NY USA 62.6 Y@Y BaB Mark 70 69 70 46 Circus Rd Manchester UK 69.6 R@R F@F Frank 80 45 I Kings St. Holland 80 Rotterdam 68.3 M@M G@G Steve 52 88 40 St. Martin Ave Sheffield UK 60 H@H PaP Noma 16 331 Quinton Manhattan 37.6 30 67 USA L@L O@o Ave Liza 74 62 82 3 Edward Rd Bimingham UK 72.6 K@K тат
Suppose the chunk size is 64MB. How many mappers and reducers are used? Why? Answer:
DB Lab Sheet 8 Normalization Using INF, 2NF and 3NF rules in order to achieve the final independent schema required: Name Grade Grade Grade Address2 Address3 Averag Email Email Addressl 2 3 Adam 60 91 85 101 JM London UK 78.6 X@X A@A Alex 45 53 221 High Rd NY 62.6 90 USA Y@Y вав Mark 70 69 70 46 Circus Rd Manchester UK 69.6 R@R F@F Frank 80 45 1 Kings St. Rotterdam Holland 80 68.3 M@M G@G Steve 52 88 40 St. Martin Ave Sheffield UK 60 H@H PaP Norma 16 331 Quinton Manhattan 37.6 L@L O@o 30 67 USA Ave Liza 74 62 82 3 Edward Rd Birmingham UK 72.6 K@K T@T
2. Simple FEC is a forward error correction scheme for recovering from packet loss in a VolP application. This model creates a redundant chunk by exclusive OR-ing n original chunks and sends it along with the original ones so that the receiver can reconstruct the original n chunks if at-most one chunk is lost throughout the transferring process. Assuming that n = 4 and receiver receives four out of the five chunks sent by the sender in the following way, reconstruct the missing (lost) chunk. • First Chunk: 11101101 • Second Chunk: 01000101 • Third Chunk: lost • Fourth Chunk: 11100010 • Redundant Chunk: 11010000