Process management, Computer Networking

Assignment Help:

Bootstrapping all the processes and establishing correct lines of communication is, by itself, the toughest aspect of this assignment. Before writing any code you should think carefully about how to start all the process and get them connected to each other. You will have accomplished a signi?cant ?rst step once you can reliably start all 20 processes and have them establish connections among themselves properly. Inter-process communication shoulbe via sockets whose type you choose.

I recommend that you make two executables, named host and router. host should accept a command line argument of one letter: either A, B, C, or D. router should accept a command line of R1 or R2. Because there are lots of parameters (e.g., IP addresses, link addresses), have each executable read its parameters from a common ?le once the executable has determined its identity. You may ?nd the combination of socketpair(2) and forking to be useful for starting and organizing the many processes. Here is a working example of the use of the socketpair system call to get three processes (app, IP, and link) connected to each other in a stack con?guration. The code below is available with the assignment in WebCT as ?le example.c. You are welcome to use all, part, or none of this code in your assignment.

#include

#include

#include

#include

#include

#include
int sock_fd[4];

#define APP_SOCK 0

#define IP_APP_SOCK 1

#define IP_LINK_SOCK 2

#define LINK_IP_SOCK 3

#define BUF_SIZE 1024

char buf[BUF_SIZE];

Once all connections are made, I suggest writing code that will format an option less IP datagram and forward from application to application, without ICMP error cases, fragmentation, or any other unusual cases such as TTL expiration, etc. Once you have the basic data ?ow working then you can start to add code one feature at a time for TTL, checksums, fragmentation, and routing errors. You will need to have lots of print statements to trace execution, but with 20 processes, writing to the console may prove problematic. If it does, consider writing debug statements into a log ?le. Be sure to use unbuffered output statements so that there is no possibility of output statements appearing in the log in a different order than they were executed in your programs.


Related Discussions:- Process management

Show the use of flow control, Q. Show the Use of flow control? Flow co...

Q. Show the Use of flow control? Flow control denotes to a set of procedures used to restrict the amount of data that the sender can send before waiting for Error Control

Describe about cryptography, Q. Describe about Cryptography? - Some med...

Q. Describe about Cryptography? - Some media cannot be protected from unauthorized reception (or interception) - Encryption involves transforming the original information in

Time out - transport layer, Time  out Timers  are used to protect  aga...

Time  out Timers  are used to protect  against  lost packet. Each  packet  must have its own logical  timers since  only  a single  packet  will be retransmitted  after timeou

What are the characteristics of client, What are the characteristics of Cli...

What are the characteristics of Client/Server? Service Encapsulation of services Shared resources Asymmetrical protocols Mix-and-match Transparency of location

Define csma/cd, CSMA/CD - A Simple Definition A netwo...

CSMA/CD - A Simple Definition A network station wishing to broadcast will first check the cable plant to make sure that no other station is currently transmit

Projecr assingment, I have a project that need to be submit as soon as poss...

I have a project that need to be submit as soon as possible

What is domains in active directory, In Windows 2000, a domain describes bo...

In Windows 2000, a domain describes both an administrative boundary and a security boundary for a collection of objects that are relevant to a particular group of users on a networ

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