Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Recent questions tagged tanenbaum
0
votes
1
answer
331
Andrew S. Tanenbaum Edition 5th Exercise 7 Question 1 (Page No. 759)
Many business Computers have three distinct world wide unique identifiers. what are they?
ajaysoni1924
asked
in
Computer Networks
Mar 19, 2019
by
ajaysoni1924
359
views
computer-networks
tanenbaum
application-layer-protocols
descriptive
0
votes
0
answers
332
Andrew S. Tanenbaum Edition 5th Exercise 6 Question 46 (Page No. 610)
Design and implement a chat system that allows multiple groups of users to chat. A chat coordinator resides at a well-known network address, uses UDP for communication with chat clients, sets up chat servers for each chat ... to start, join, and leave a chat session. Design and implement the coordinator, server, and client code.
ajaysoni1924
asked
in
Computer Networks
Mar 18, 2019
by
ajaysoni1924
618
views
computer-networks
tanenbaum
transport-layer
program
0
votes
2
answers
333
Andrew S. Tanenbaum Edition 5th Exercise 6 Question 43 (Page No. 610)
What is the bandwidth-delay product for a 50-Mbps channel on a geostationary satellite? If the packets are all 1500 bytes (including overhead), how big should the window be in packets?
ajaysoni1924
asked
in
Computer Networks
Mar 18, 2019
by
ajaysoni1924
1.4k
views
computer-networks
tanenbaum
transport-layer
1
vote
1
answer
334
Andrew S. Tanenbaum Edition 5th Exercise 6 Question 39 (Page No. 609)
To get around the problem of sequence numbers wrapping around while old packets still exist, one could use 64-bit sequence numbers. However, theoretically, an optical fiber can run at 75 Tbps. What maximum packet lifetime is ... even with 64-bit sequence numbers? Assume that each byte has its own sequence number, as TCP does.
ajaysoni1924
asked
in
Computer Networks
Mar 18, 2019
by
ajaysoni1924
1.3k
views
computer-networks
transport-layer
tanenbaum
0
votes
0
answers
335
Andrew S. Tanenbaum Edition 5th Exercise 6 Question 37 (Page No. 609)
A CPU executes instructions at the rate of 1000 MIPS. Data can be copied 64 bits at a time, with each word copied costing 10 instructions. If an coming packet has to be copied four times, can this system handle a ... , assume that all instructions, even those instructions that read or write memory, run at the full 1000-MIPS rate.
ajaysoni1924
asked
in
Computer Networks
Mar 18, 2019
by
ajaysoni1924
703
views
computer-networks
tanenbaum
transport-layer
2
votes
1
answer
336
Andrew S. Tanenbaum Edition 5th Exercise 6 Question 37 (Page No. 609)
Suppose that you are measuring the time to receive a segment. When an interrupt occurs, you read out the system clock in milliseconds. When the segment is fully processed, you read out the clock again. You measure 0 msec 270,000 times and 1 msec 730,000 times. How long does it take to receive a segment?
ajaysoni1924
asked
in
Computer Networks
Mar 18, 2019
by
ajaysoni1924
742
views
computer-networks
tanenbaum
transport-layer
segmentation
1
vote
1
answer
337
Andrew S. Tanenbaum Edition 5th Exercise 6 Question 36 (Page No. 609)
In a network whose max segment is 128 bytes, max segment lifetime is 30 sec, and has 8-bit sequence numbers, what is the maximum data rate per connection?
ajaysoni1924
asked
in
Computer Networks
Mar 18, 2019
by
ajaysoni1924
1.3k
views
computer-networks
tanenbaum
transport-layer
0
votes
0
answers
338
Andrew S. Tanenbaum Edition 5th Exercise 6 Question 35 (Page No. 609)
To address the limitations of IP version 4, a major effort had to be undertaken via IETF that resulted in the design of IP version 6 and there are still is significant reluctance in the adoption of this new version. However, no such major effort is needed to address the limitations of TCP. Explain why this is the case.
ajaysoni1924
asked
in
Computer Networks
Mar 18, 2019
by
ajaysoni1924
529
views
computer-networks
tanenbaum
transport-layer
tcp
ipv6
1
vote
1
answer
339
Andrew S. Tanenbaum Edition 5th Exercise 6 Question 34 (Page No. 609)
What is the fastest line speed at which a host can blast out 1500-byte TCP payloads with a 120-sec maximum packet lifetime without having the sequence numbers wrap around? Take TCP, IP, and Ethernet overhead into consideration. Assume that Ethernet frames may be sent continuously.
ajaysoni1924
asked
in
Computer Networks
Mar 18, 2019
by
ajaysoni1924
3.9k
views
computer-networks
tanenbaum
transport-layer
tcp
0
votes
1
answer
340
Andrew S. Tanenbaum Edition 5th Exercise 6 Question 33 (Page No. 609)
A TCP machine is sending full windows of 65,535 bytes over a 1-Gbps channel that has a 10-msec one-way delay. What is the maximum throughput achievable? What is the line efficiency?
ajaysoni1924
asked
in
Computer Networks
Mar 18, 2019
by
ajaysoni1924
1.0k
views
computer-networks
tanenbaum
transport-layer
tcp
3
votes
2
answers
341
Andrew S. Tanenbaum Edition 5th Exercise 6 Question 32 (Page No. 609)
If the TCP round-trip time, RTT, is currently 30 msec and the following acknowledgements come in after 26, 32, and 24 msec, respectively, what is the new RTT estimate using the Jacobson algorithm? Use α = 0.9.
ajaysoni1924
asked
in
Computer Networks
Mar 18, 2019
by
ajaysoni1924
6.1k
views
computer-networks
tanenbaum
transport-layer
tcp
2
votes
2
answers
342
Andrew S. Tanenbaum Edition 5th Exercise 6 Question 31 (Page No. 609)
Suppose that the TCP congestion window is set to 18 KB and a timeout occurs. How big will the window be if the next four transmission bursts are all successful? Assume that the maximum segment size is 1 KB.
ajaysoni1924
asked
in
Computer Networks
Mar 18, 2019
by
ajaysoni1924
996
views
computer-networks
transport-layer
tanenbaum
congestion-control
1
vote
2
answers
343
Andrew S. Tanenbaum Edition 5th Exercise 6 Question 30 (Page No. 609)
Consider the effect of using slow start on a line with a 10-msec round-trip time and no congestion. The receive window is 24 KB and the maximum segment size is 2 KB. How long does it take before the first full window can be sent?
ajaysoni1924
asked
in
Computer Networks
Mar 18, 2019
by
ajaysoni1924
770
views
computer-networks
tanenbaum
transport-layer
tcp
congestion-control
0
votes
0
answers
344
Andrew S. Tanenbaum Edition 5th Exercise 6 Question 29 (Page No. 609)
Describe two ways to get into the SYN RCVD state of Figure.
ajaysoni1924
asked
in
Computer Networks
Mar 18, 2019
by
ajaysoni1924
212
views
computer-networks
tanenbaum
transport-layer
tcp
descriptive
1
vote
2
answers
345
Andrew S. Tanenbaum Edition 5th Exercise 6 Question 28 (Page No. 608)
The maximum payload of a TCP segment is 65,495 bytes. Why was such a strange number chosen?
ajaysoni1924
asked
in
Computer Networks
Mar 18, 2019
by
ajaysoni1924
1.0k
views
computer-networks
transport-layer
descriptive
tcp
tanenbaum
1
vote
1
answer
346
Andrew S. Tanenbaum Edition 5th Exercise 6 Question 27 (Page No. 608)
In Fig. 6-36 we saw that in addition to the 32-bit acknowledgement field, there is an ACK bit in the fourth word. Does this really add anything? Why or why not?
ajaysoni1924
asked
in
Computer Networks
Mar 18, 2019
by
ajaysoni1924
820
views
computer-networks
transport-layer
descriptive
tcp
tanenbaum
1
vote
1
answer
347
Andrew S. Tanenbaum Edition 5th Exercise 6 Question 26 (Page No. 608)
A process on host 1 has been assigned port p, and a process on host 2 has been assigned port q. Is it possible for there to be two or more TCP connections between these two ports at the same time?
ajaysoni1924
asked
in
Computer Networks
Mar 18, 2019
by
ajaysoni1924
1.3k
views
computer-networks
tanenbaum
transport-layer
descriptive
tcp
1
vote
1
answer
348
Andrew S. Tanenbaum Edition 5th Exercise 6 Question 23 (Page No. 608)
Datagram fragmentation and reassembly are handled by IP and are invisible to TCP. Does this mean that TCP does not have to worry about data arriving in the wrong order?
ajaysoni1924
asked
in
Computer Networks
Mar 18, 2019
by
ajaysoni1924
753
views
computer-networks
tanenbaum
transport-layer
descriptive
tcp
0
votes
1
answer
349
Andrew S. Tanenbaum Edition 5th Exercise 6 Question 22 (Page No. 608)
What is the total size of the minimum TCP MTU, including TCP and IP overhead but not including data link layer overhead?
ajaysoni1924
asked
in
Computer Networks
Mar 18, 2019
by
ajaysoni1924
876
views
computer-networks
tanenbaum
transport-layer
tcp
descriptive
0
votes
1
answer
350
Andrew S. Tanenbaum Edition 5th Exercise 6 Question 19 (Page No. 608)
Both UDP and TCP use port numbers to identify the destination entity when delivering a message. Give two reasons why these protocols invented a new abstract ID (port numbers), instead of using process IDs, which already existed when these protocols were designed.
ajaysoni1924
asked
in
Computer Networks
Mar 18, 2019
by
ajaysoni1924
1.9k
views
computer-networks
tanenbaum
transport-layer
udp
tcp
descriptive
0
votes
0
answers
351
Andrew S. Tanenbaum Edition 5th Exercise 6 Question 16 (Page No. 608)
Consider a simple application-level protocol built on top of UDP that allows a client to retrieve a file from a remote server residing at a well-known address. The client first sends a request with a file ... performance issue, do you see a problem with this protocol? Think carefully about the possibility of processes crashing.
ajaysoni1924
asked
in
Computer Networks
Mar 18, 2019
by
ajaysoni1924
978
views
computer-networks
tanenbaum
transport-layer
descriptive
udp
2
votes
1
answer
352
Andrew S. Tanenbaum Edition 5th Exercise 6 Question 15 (Page No. 607)
Why does UDP exist? Would it not have been enough to just let user processes send raw IP packets
ajaysoni1924
asked
in
Computer Networks
Mar 18, 2019
by
ajaysoni1924
658
views
computer-networks
tanenbaum
transport-layer
udp
descriptive
0
votes
0
answers
353
Andrew S. Tanenbaum Edition 5th Exercise 6 Question 14 (Page No. 607)
Some other policies for fairness in congestion control are Additive Increase Additive Decrease (AIAD), Multiplicative Increase Additive Decrease (MIAD), and Multiplicative Increase Multiplicative Decrease (MIMD). Discuss these three policies in terms of convergence and stability.
ajaysoni1924
asked
in
Computer Networks
Mar 18, 2019
by
ajaysoni1924
769
views
computer-networks
tanenbaum
transport-layer
descriptive
congestion-control
0
votes
0
answers
354
Andrew S. Tanenbaum Edition 5th Exercise 6 Question 12 (Page No. 607)
In Figure 6-20, suppose a new flow E is added that takes a path from R1 to R2 to R6. How does the max-min bandwidth allocation change for the five flows?
ajaysoni1924
asked
in
Computer Networks
Mar 18, 2019
by
ajaysoni1924
906
views
computer-networks
tanenbaum
transport-layer
congestion-control
1
vote
1
answer
355
Andrew S. Tanenbaum Edition 5th Exercise 6 Question 10 (Page No. 607)
Imagine that a two-way handshake rather than a three-way handshake were used to set up connections. In other words, the third message was not required. Are deadlocks now possible? Give an example or show that none exist.
ajaysoni1924
asked
in
Computer Networks
Mar 18, 2019
by
ajaysoni1924
1.0k
views
computer-networks
tanenbaum
transport-layer
descriptive
1
vote
1
answer
356
Andrew S. Tanenbaum Edition 5th Exercise 6 Question 9 (Page No. 607)
Why does the maximum packet lifetime, T, have to be large enough to ensure that not only the packet but also its acknowledgements have vanished?
ajaysoni1924
asked
in
Computer Networks
Mar 18, 2019
by
ajaysoni1924
445
views
computer-networks
tanenbaum
transport-layer
descriptive
1
vote
1
answer
357
Andrew S. Tanenbaum Edition 5th Exercise 6 Question 8 (Page No. 607)
Why does the maximum packet lifetime, T, have to be large enough to ensure that not only the packet but also its acknowledgements have vanished?
ajaysoni1924
asked
in
Computer Networks
Mar 18, 2019
by
ajaysoni1924
537
views
computer-networks
tanenbaum
transport-layer
descriptive
0
votes
0
answers
358
Andrew S. Tanenbaum Edition 5th Exercise 6 Question 7 (Page No. 607)
Suppose that the clock-driven scheme for generating initial sequence numbers is used with a 15-bit wide clock counter. The clock ticks once every 100 msec, and the maximum packet lifetime is 60 sec. How often need resynchronization take place (a) in the worst case? (b) when the data consumes 240 sequence numbers/min?
ajaysoni1924
asked
in
Computer Networks
Mar 18, 2019
by
ajaysoni1924
257
views
computer-networks
tanenbaum
transport-layer
descriptive
0
votes
0
answers
359
Andrew S. Tanenbaum Edition 5th Exercise 6 Question 6 (Page No. 607)
One criteria for deciding whether to have a server active all the time or have it start on demand using a process server is how frequently the service provided is used. Can you think of any other criteria for making this decision?
ajaysoni1924
asked
in
Computer Networks
Mar 18, 2019
by
ajaysoni1924
205
views
computer-networks
tanenbaum
transport-layer
descriptive
0
votes
0
answers
360
Andrew S. Tanenbaum Edition 5th Exercise 6 Question 3 (Page No. 607)
In the underlying model of Fig. it is assumed that packets may be lost by the network layer and thus must be individually acknowledged. Suppose that the network layer is 100 percent reliable and never loses packets. What changes, if any, are needed to Fig.?
ajaysoni1924
asked
in
Computer Networks
Mar 18, 2019
by
ajaysoni1924
346
views
computer-networks
tanenbaum
transport-layer
Page:
« prev
1
...
7
8
9
10
11
12
13
14
15
16
next »
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent questions tagged tanenbaum
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...