Three network topologies, four different network types, along withthe uses and limitations of each.
Explanation of Solution
Network topologies defines the shape, structure and arrangement in which components of a network can be linked. Though, among networks transmission rate, distance between nodes, signal types and physical media uses for connection may differ, but they may have the same topology.
The three main popular network topologies used are star, bus and mesh topologies.
Star topology: In this topology, all nodes in a network are connected to a central node which is known as hub node. Start topology is very easy to implement and is used when lesser number of devices are required to be connected. The main drawback of star topology is that in case, there is failure of central node, the entire network will go down. The figure below shows devices connected in star topology:
Bus topology: In this topology, every node on the network is connected through a common commnication channel known as Bus. For communication purposes, whenever any device needs to communicate with any other device, it sends braodcast messages through a communication link which goes to all devices but can only be accepted and processed by the intended receiving device. But topology is the easiest way to establishing a network and also,the cost of implementation is less. The main issue with bus topology is that for a large network, there is more amount of time needed for communication between devices at extreme ends than devices which are in close proximity. Also, in case of failure of bus, the whole network has to be restructured which is a very time consuming process. The following figure shows bus topology:
Mesh topology: In mesh topology, nodes can be connected on network using multiple access points. Each device on the network is directly linked with another device. In mesh topology, a connection is established between the sending device and receiving device by routing through node to node and make a continous connection which does not have any blocked nodes. Mesh topology is the most reliable type of
Based on physical distances between the connected nodes of a network, the networkscan be classified as personal area network, local area network, metropolitan area network and wide area network.
Personal area network (PAN): PAN is a wireless network which is setup near a person. A person can connect laptops, digital cameras, mobile phones, printers etc by using personal area. all together. PAN is also used in IoT connections for allowing sensors to receive data from your body and transmit it to your smartphone which can be used for health tracking, glucose monitoring, and pedometers.
Local area network (LAN): LAN network connects computing devices within an office, home or building. Typically, a LAN network, has hundreds of computing devices connected to the network. LAN network is used to create a private and secure network.
Metropolitan area network (MAN): MAN is used to connect multiple LAN networks spread across various small geographical locations together. Two or more LAN networks can be connected into a WAN network. MAN, networks can be used to connect multiple offices of an organization locatedin different locations.
Wide area network (WAN): WAN is used to connect large geographical regions. They are mainly used to provide communication over national borders. A WAN network can be either be privately owned or can be rented. WAN comes to picture when you try to make a phone call to somebody who is in any other international location. For establishing WAN, national and international laws need to be taken care while handling and monitoring data flow through these networks.
Want to see more full solutions like this?
Chapter 4 Solutions
Fundamentals of Information Systems (Looseleaf)
- what type of internet connection should be avoided on mobile devices?arrow_forwardI need help creating the network diagram and then revising it for the modified activity times.arrow_forwardActivity No. Activity Time (weeks) Immediate Predecessors 1 Requirements collection 3 2 Requirements structuring 4 1 3 Process analysis 3 2 4 Data analysis 3 2 5 Logical design 50 3,4 6 Physical design 5 5 7 Implementation 6 6 c. Using the information from part b, prepare a network diagram. Identify the critical path.arrow_forward
- Given the following Extended-BNF grammar of the basic mathematical expressions: Show the derivation steps for the expression: ( 2 + 3 ) * 6 – 20 / ( 3 + 1 ) Draw the parsing tree of this expression. SEE IMAGEarrow_forwardWhentheuserenters!!,themostrecentcommandinthehistoryisexecuted.In the example above, if the user entered the command: Osh> !! The ‘ls -l’ command should be executed and echoed on user’s screen. The command should also be placed in the history buffer as the next command. Whentheuserentersasingle!followedbyanintegerN,theNthcommandin the history is executed. In the example above, if the user entered the command: Osh> ! 3 The ‘ps’ command should be executed and echoed on the user’s screen. The command should also be placed in the history buffer as the next command. Error handling: The program should also manage basic error handling. For example, if there are no commands in the history, entering !! should result in a message “No commands in history.” Also, if there is no command corresponding to the number entered with the single !, the program should output "No such command in history."arrow_forwardActivity No. Activity Time (weeks) Immediate Predecessors 1 Requirements collection 3 2 Requirements structuring 4 1 3 Process analysis 3 2 4 Data analysis 3 2 5 Logical design 50 3,4 6 Physical design 5 5 7 Implementation 6 6 c. Using the information from part b, prepare a network diagram. Identify the critical path.arrow_forward
- 2. UNIX Shell and History Feature [20 points] This question consists of designing a C program to serve as a shell interface that accepts user commands and then executes each command in a separate process. A shell interface gives the user a prompt, after which the next command is entered. The example below illustrates the prompt osh> and the user's next command: cat prog.c. The UNIX/Linux cat command displays the contents of the file prog.c on the terminal using the UNIX/Linux cat command and your program needs to do the same. osh> cat prog.c The above can be achieved by running your shell interface as a parent process. Every time a command is entered, you create a child process by using fork(), which then executes the user's command using one of the system calls in the exec() family (as described in Chapter 3). A C program that provides the general operations of a command-line shell can be seen below. #include #include #define MAX LINE 80 /* The maximum length command */ { int…arrow_forwardQuestion#2: Design and implement a Java program using Abstract Factory and Singleton design patterns. The program displays date and time in one of the following two formats: Format 1: Date: MM/DD/YYYY Time: HH:MM:SS Format 2: Date: DD-MM-YYYY Time: SS,MM,HH The following is how the program works. In the beginning, the program asks the user what display format that she wants. Then the program continuously asks the user to give one of the following commands, and performs the corresponding task. Note that the program gets the current date and time from the system clock (use the appropriate Java date and time operations for this). 'd' display current date 't': display current time 'q': quit the program. • In the program, there should be 2 product hierarchies: "DateObject” and “TimeObject”. Each hierarchy should have format and format2 described above. • Implement the factories as singletons. • Run your code and attach screenshots of the results. • Draw a UML class diagram for the program.arrow_forward#include <linux/module.h> #include <linux/kernel.h> // part 2 #include <linux/sched.h> // part 2 extra #include <linux/hash.h> #include <linux/gcd.h> #include <asm/param.h> #include <linux/jiffies.h> void print_init_PCB(void) { printk(KERN_INFO "init_task pid:%d\n", init_task.pid); printk(KERN_INFO "init_task state:%lu\n", init_task.state); printk(KERN_INFO "init_task flags:%d\n", init_task.flags); printk(KERN_INFO "init_task runtime priority:%d\n", init_task.rt_priority); printk(KERN_INFO "init_task process policy:%d\n", init_task.policy); printk(KERN_INFO "init_task task group id:%d\n", init_task.tgid); } /* This function is called when the module is loaded. */ int simple_init(void) { printk(KERN_INFO "Loading Module\n"); print_init_PCB(); printk(KERN_INFO "Golden Ration Prime = %lu\n", GOLDEN_RATIO_PRIME); printk(KERN_INFO "HZ = %d\n", HZ); printk(KERN_INFO "enter jiffies = %lu\n", jiffies); return 0; } /* This function is called when the…arrow_forward
- Fundamentals of Information SystemsComputer ScienceISBN:9781337097536Author:Ralph Stair, George ReynoldsPublisher:Cengage LearningFundamentals of Information SystemsComputer ScienceISBN:9781305082168Author:Ralph Stair, George ReynoldsPublisher:Cengage Learning
- Management Of Information SecurityComputer ScienceISBN:9781337405713Author:WHITMAN, Michael.Publisher:Cengage Learning,Principles of Information Systems (MindTap Course...Computer ScienceISBN:9781285867168Author:Ralph Stair, George ReynoldsPublisher:Cengage LearningPrinciples of Information Systems (MindTap Course...Computer ScienceISBN:9781305971776Author:Ralph Stair, George ReynoldsPublisher:Cengage Learning