Networking concepts, Computer Networking

Assignment Help:

Networking Concepts

Q1 What are the main features of TCP connections? Why is it said that TCP provides full-duplex service?

Q2 What are the differences between TCP connections and UDP connections? Why is DNS run over UDP?

Q3 TCP creates a reliable data transfer service, in addition to IP's unreliable best-effort service. Study the related sections of the text, and in your own words, summarize how TCP provides a reliable data transfer service.

Q4 What is three-way handshake? Draw a diagram showing how a TCP connection is established through three-way handshake.

Q5 What does Address Resolution protocol do?

Q6 Network adaptors are manufactured by many companies in many countries. How can these companies ensure no two adaptors will have the same MAC address? Identify at least five network interface card makers, and find out how you can tell whether a card was made by either of these companies.

Q7 What is CSMA/CD? How does it work? Explain why RTT on a LAN is an important parameter for CSMA/CD to work.

Q8 What techniques can be used for error-detection in the data link layer?

Q9 What techniques can be used for error-correction in the data link layer?

Q10 What are base stations in wireless networking? What IEEE standards are used for wireless networking?

Q11 What are the differences and similarities between an IEEE 802.11 frame and an Ethernet frame?

Q12 To network a Windows desktop and a computer running RedHat Linux, what will you need and what steps will you take?

Q13 What does ISO stand for? What are the five areas of network management defined by the ISO?

Q14 What are the seven message types in SNMP?


Related Discussions:- Networking concepts

Show v.32 standard, Q. Show V.32 standard? - ITU-T's V.32 standard was ...

Q. Show V.32 standard? - ITU-T's V.32 standard was issued in 1991 for asynchronous and full-duplex operation at 14.4 Kbps. V.32bis - Is an extension of the V.32 technology?

Thread libraries, The most difficult representatives of shared memory progr...

The most difficult representatives of shared memory programming models are thread libraries present in mainly of the modern operating systems. Some examples for thread libraries ar

Wireless access - computer network, Wireless Access Wireless access co...

Wireless Access Wireless access connecting end  systems ( that are often  mobile) into the network. Today there are two broad types  of wireless internet access(1) wireless an

Components of the vpn - point to point , Components of the VPN When  us...

Components of the VPN When  using  VPN we incorporate many pieces of a jigsaw puzzle each piece services its own  function to private  the interoperation and the  security  nec

Illustrate stop-and-wait automatic repeat request, Q. Illustrate Stop-and-W...

Q. Illustrate Stop-and-Wait Automatic Repeat request? - Simplest flow as well as error control mechanism - The sending device keeps a duplicate copy of the last frame transm

Illustrate 802.11 csma, 802.11 CSMA/CA a) Wait a DIFS time to avoid col...

802.11 CSMA/CA a) Wait a DIFS time to avoid collision b) Send RTS and wait for CTS reply to obtain the use of the Medium (air) c)  Use of SIFS time for control informatio

Describe essential security services, Problem: (a) Application Layer pr...

Problem: (a) Application Layer protocols can be classified as connection-oriented or connectionless-oriented. i. What do you understand by the term protocol? ii. Give an e

Define the term - store-and-forward and cut-through switch, Store-and-forwa...

Store-and-forward switch  The layer 2 switch accepts a frame on an input line, buffers it briefly, and then routes it to the appropriate output line. Cut-through switch

What is client and server, What is Client/Server? Clients and Servers a...

What is Client/Server? Clients and Servers are part logical entities that work together over a network to accomplish a task. Lots of systems with very dissimilar architectures

Computing shortest path in a graph, While calculating shortest path, first ...

While calculating shortest path, first we assume graph presentation of network at every node then we use Djikstra's algorithm to calculate shortest path from every node to other on

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd