Budget:	$ 20-100
Status:	Closed for Bidding
Project Creator:	naiive2000
	2 reviews
Required Skills:	Engineering, Network Design, Network Implementation, Networking
Attached Files:	(None)

NEW	SEND	DISCUSS	CONTACT	OPTIONS

Description
I have some assignments and would like someone to help me out. But it must be an honest job, meaning no plagiarism. The work will be checked against some website. I don't need a real professional job on this work, since it is more like a school tutorial work. Please let me know what is your opinion. I need the work done by 25th June and I have a tight budget.

1) Draw a hybrid topology with a star backbone connecting three bus backbones. Each bus backbone connects three ring networks.
2) Explain the five major duties of the transport layer of the TCP/IP protocol suite.
3) In Figure 1.1, exactly one protocol data unit (PDU) in layer N is encapsulated in a PDU at layer (N-1). It is also possible to break one N-level PDU into multiple (N-1)-level PDUs (i.e., segmentation) or to group multiple N-level PDUs into one (N-1)-level PDU (i.e., blocking). ( Protocol Data Units in the TCP/IP Architecture
- will send once I have voted the assignee)

a. Is it necessary that each (N-1)-level segment contain a copy of the N-level header in the case of segmentation? Provide reasoning to justify your answer.
b. In the case of blocking, is it necessary that each N-level PDU retain its own header, or can the data be consolidated into a single N-level PDU with a single N-level header? Support your answer with justification.

4) What are the two methods of serial transmission? Compare these two methods discussing the advantages and disadvantages of each
5) It is desired to send a sequence of computer screen images over an optical fiber. The screen is 480 x 500 pixels being 6 bits. There are 40 screen images per second.

a. Calculate the source rate R (bits per second).

b. If the spectrum of a channel is between 4 MHz and 5 MHz and SNRdB = 24 dB, what is the maximum achievable data rate? Provide explanation for your answer.

6) For the bit stream 01001110, sketch the waveforms using NRZ-L, NRZ-I and Manchester encoding formats.

7)Explain in terms of data link control and physical layer concepts how error and flow control are accomplished in synchronous time-division multiplexing?
8) Why is a statistical time division multiplexer more efficient than a synchronous time division multiplexer?
9) 10 channels, each with 6 MHz bandwidth, are to be multiplexed together. What is the minimum bandwidth of the link if there is a need for a guard band of 2 MHz between the channels to prevent interference? Show all workings clearly.

10) Suppose that AAL 3 / 4 (ATM Adaptation Layer 3 / 4) is being used and that the receiver is in an idle state (no incoming cells)? Then a block of user data is being transmitted as a sequence of SAR (Segmentation and Reassembly) PDUs (Protocol Data Units).
a. Suppose that the BOM (Begin of Message) SAR PDU is lost. What happens at the receiving end?
b. Suppose that one of the COM (Continuation of Message) SAR PDUs is lost. What happens at the receiving end?
11) The code 1101101 was received. Using the even Hamming encoding algorithm, of a binary code,
a. find out whether an error has occurred in the code. If yes,
i) identify the bit in error,
ii) correct the error bit and write the correct code.
b. Write the original binary code (without parity bits) which was meant to send. Show all working correctly.
12) Two neighboring nodes (A and B) use a sliding window protocol. Go-back-N ARQ (Automatic Repeat reQuest) mechanism is used with a window size of 7. Assuming A is transmitting and B is receiving, draw the sender and receiver window positions for the following succession of events:
(a) Frame 0 is sent; frame 0 is acknowledged.
(b) Frames 1 and 2 are sent; frames 1 and 2 are acknowledged.
(c) Frames 3, 4 and 5 are sent; frame 4 is acknowledged; timer for frame 5 expires.
(d) Frames 5, 6 and 7 are sent; frames 4 through 7 are acknowledged.
13) Using
(a) Dijkstra Minimum Cost Path and
(b) Bellman-Ford Algorithm,
calculate the shortest path from the source node A to the other nodes of network as shown in the Figure 3.1 below. (diagram will be sent over once assignee voted)

Figure 3.1 Packet-Switching Network with Link Costs

Your answer should indicate step-by-step determination of the shortest path as described by Dijkstra's Minimum Cost Path and Bellman-Ford Algorithm.

Reminder
You may not start working in this and any project before your bid is accepted. Any user who violates this policy may have their account permanently suspended.

Bids Received (1)   Shortlist (1)   Declined Bids (0)    Average bid amount:   $20.00   Average delivery time:   2 Day(s)

Place Bid | Post Similar Project | Send Project | Message Board(0) | Contact naiive2000 Order by: Rating Bid sum Bid date

Remember that contacting the other party outside the site (by email, phone, etc.) on all business projects (before the project is awarded) is a violation of our terms of use. We supervise all site activity for such infringements and can immediately expel transgressors on the spot, so we thank you in advance for your cooperation. If you notice a violation please help out the site and report it. Thank you for your help.

nbsp;

Shortlisted Decline Bid SoftExpert   Calcutta, IN location US$20 bid amount (2 reviews) feedback 2 day(s) delivery time     Hello Please check PMB...... Bid Time: 06-19-2007 12:27