What are advantages and limitations of Wi-Fi?

The Wi-Fi has its own set of advantages and limitations. 

Advantages of WiFi

- WiFi makes the deployment of local Area Networks or LANs quite cheap.  

- There are some areas where the cables cannot be installed such as in historical buildings and outdoor areas. 

- But these spaces do not have any problem in hosting a wireless LAN.  

- Wireless Network adapters are being built into almost all the laptops by the manufacturers.

- A basic level of service is provided at which different brands concerning and client network interfaces access points that are competing with each other can inter-operate. 

- The products that have been certified by Wi-Fi alliance show back word compatibility. 

- A standard device for WiFi will work at any place in the whole world unlike our phones. 

- The WPA2 or the WiFi protected access encryption is secure provided a condition that the pass phrase used is quite strong.  

- The new protocols use for WMM i.e., Quality of service increase the suitability of the Wi-Fi regarding its use in latency - sensitive applications. 

- WMM is a power saving mechanism that is used for extending the life of the battery. 

Limitations of WiFi

- Inconsistency of the operation and spectrum assignments poses a problem worldwide.  

- The range all the WiFi networks is limited. 

- A wireless access point typically uses a stock antenna having a range of 100 m outdoors and 25m indoors.

- The frequency band is a major factor for producing variations in the range.  

- The range of Wi-Fi with a 2.4 ghz frequency block is better when compared with the 5.0 ghz frequency block Wi-Fi. 

- Some wireless routers come with detachable antennas. 

- These antennas can be removed for improving the range. 

- In their place upgraded antennas can be fitted. 

- The benefit of these antennas is that they have high directional gain at the remote devices. 

- The local regulations limit the maximum amount of power that can be transmitted by a Wi-Fi. 

- The power consumption of Wi-Fi is quite higher than the other standards.  

- This is so because of the reach requirements of the wireless LAN applications.

- There are technologies available that provide a propagation range that is much shorter. 

- One such technology is Bluetooth and has very low power consumption.  

- Other technologies such as zigbee have low power consumption, a long range but provides low data rate. 

- The most commonly used wireless encryption standard is WEP or wired equivalent privacy. 

- Even this standard has been proven to be breakable even if correct configuration is used. 

- This problem was addressed by WPA or Wi-Fi protected access standard to some extent. 

- By default the wireless access points use the encryption free mode. 

- The wireless security is disabled because of which the LAN can be openly accessed. 

What are uses of Wifi?

- Routers sometimes act as a Wi-Fi access point incorporating a cable modem or a DSL modem.

- These routers are installed in buildings and homes for providing Internet access and other inter networking services to the devices that in turn are connected to a either through a cable or wireless. 

- Similarly, there are routers that are powered by battery and they consist of a Wi-Fi access point and a mobile Internet radio modem. 

- Today smartphones come with this as a built-in capability.  

- However, this feature is disabled by the carriers. 

- The carriers might charge extra money for this. 

- The standalone facilities are provided by Internet packs. 

- The places where there is no network access, wifi is used. 

- Using Wi-Fi, a direct communication link between two computers can be established.  

- There is no intermediate point.  

- This type of transmission is termed as ad hoc wifi transmission. 

- This network mode is now very popular with the multi-player game consoles. Examples are:

       > Nintendo DS

       > PlayStation portable

       > Digital cameras

       > Other consumer electronic devices.

- A citywide Wi-Fi plan has been implemented by a number of the cities around the world.  

- In India, the first city to do so was Mysore.  

- The first city in the world was Jerusalem.

- The first city in United States was Sunnyvale in California to offer city-wide wifi. 

- Another type of wifi implementation is campus-wide wifi.  

- A number of colleges in United States have set up this kind of wifi network.  

- The first university to have it was Carnegie Mellon University. 

- Using wifi, the local area Network can be deployed in very less cost.  

- There are places where it is not possible for the physical transmission medium such as cables to reach. 

- In such places wifi network is of crucial importance.  

- Also, wifi can be easily deployed in historical buildings and outdoor areas.  

- Now, because of the increasing popularity of the Wi-Fi, the manufacturers are developing Wireless Network adapters for most of the notebooks and laptops.  

- This eventually led to a fall in the price of the Wi-Fi chip set. 

- Today, the Wi-Fi chip set is economically feasible and is included in most of the devices.  

- There are many brands of client network interfaces and access-points that are competing with each other.  

- These interfaces are able to inter-operate at a basic level. 

- The Wi-Fi certification for the products is issued by wifi alliance. 

- This makes them backwards compatible with each other. 

- A standard Wi-Fi Device is supposed to work anywhere in the world. 

- The encryption standard that is considered secure is the WPA2 or wifi protected access.  

- But, this would work only if the pass phrase that is being used is strong enough. 

- The Wi-Fi has been made more suitable with the use of new protocols such as quality of service.  

- This has made wifi compatible with latency sensitive applications.  

- Nowadays, for extending battery life power saving mechanisms such as WMM are being used.  

- These are the major uses of wifi technology.

- The usage wifi has been limited because of its limited range. 

- Therefore, in order to cover up a large area several intermediate Wi-Fi access-points have to be set up. 

- The variations in the range can be produced by varying the frequency band.  

- Wifi with a small frequency block works better than wifi with a larger frequency block.

- Wifi with the larger frequency blocks are optionally used. 

- The power of wifi network can be harnessed by using high gain direction antennas instead of using detachable antennas.  

- Another factor limiting the performance of wifi transmission is the local regulations. 

- Wifi also requires high power to operate upon. 

- This is a cause of concern for the devices' batteries.

What is meant by multiplexing?

- Multiplexing or muxing is a very important process in computer networks and the telecommunications. 

Using this process, a number of digital data streams or analog message signals are combined as one signal and then transported over the common medium. 

- Multiplexing is used wherever it is required to share a resource that is very expensive. 

- The most common example of multiplexing is of using one wire for several telephone calls. 

- The origin of the multiplexing dates back to 1870s when telegraphy was started.

- Now it is used to a great extent in the field of communications. 

- The telephone carrier multiplexing was developed by George Owen Squire in the field of telephony. 

- The communication channel over which the multiplexed signal might be transmitted might be a physical transmission medium. 

- The high level communication channel’s capacity is divided by multiplexing process in to a number of low level logical channels where for each message or data stream one channel is used. 

- Demultiplexing is the reverse process of multiplexing. 

- This is used for the extraction of the original signals on the reception side.

- A multiplexer or MUX is a device that is used for carrying out the multiplexing process and the demultiplexer or DEMUX is the device that performs demultiplexing. 

- IMUX or inverse multiplexing is another process whose aim is just the opposite of the multiplexing.

- It breaks down a single data stream in to various streams while transferring them at the same time over various communication channels.

- Later, the original stream is recreated.

Types of Multiplexing

Many different types of multiplexing technologies are available today. Each has its own significance:

Ø SDM or space-division multiplexing: 

This technique implies on using different point – to – point wires for individual communication channels. For example, an audio cable of analogue stereo, multi – pair telephone cable, switched star network, mesh network. However typically the wired SDM is not usually considered as multiplexing. In SDM a phased array antenna is formed by multiple antennas. For example MIMO (multiple – input and multiple – output), SIMO (simple – input and multiple – output), MISO (multiple – input and single – output) etc.

Ø  FDM or frequency-division multiplexing: 

This is considered to be an analog process, here the signals are sent in to different frequency ranges over a shared medium. For example, TV and radio broadcasting from satellite stations through the earth’s atmosphere. One cable is given in each house but over this cable many signals can be sent to other subscribers also. For accessing the desired signal, the users require to tune to that particular frequency. WDM or wavelength division multiplexing is a variant of FDM.

Ø TDM or time-division multiplexing: 

Unlike FDM, TDM is a digital technology but very rarely it might be used as an analog technology also. The process involves putting bytes in a sequence for each input stream one by one. this sequencing is done in such a way that the receiver can appropriately  receive them. If this is done quickly, the fact that another logical communication path was served in that circuit time won’t be detected by the receiver.

Ø  CDM or code-division multiplexing: 

In this multiplexing technique, the same frequency spectrum is shared by the several channels at the same time. Also the bandwidth of the spectrum is quite high when compared to the symbol rate or the bit rate. It is implemented in either of the two forms namely direct sequence spread spectrum and frequency hopping.

Some other types of multiplexing techniques which are less prominent are:

Polarization-division multiplexing: Used in optical and radio communications.

Orbital angular momentum multiplexing

What are the differences between bridges and repeaters?

Bridges and repeaters are both important devices in the field of telecommunications and computer networking. In this article we discuss about these two and differences between them. 

- The repeaters are deployed at the physical layer whereas one can find bridges at the MAC layer. 

- Thus, we called repeaters as the physical layer device. 

- Similarly, bridge is known as the MAC layer device. 

- Bridge is responsible for storing as well forwarding the data packets in an Ethernet.

- Firstly, it examines the header of the data frame, selects few of them and then forwards them to the destination address mentioned in the frame. 

- Bridge uses the CSMA/CD for accessing a segment whenever the data frame has to be forwarded to it.

- Another characteristic of a bridge is that its operation is transparent. 

- This means that the hosts in the network do not know that the bridge is also present in the network. 

- Bridges learn themselves; they do not have to be configured again and again. 

- They can be simply plugged in to the network. 

- Installing a bridge causes formation of LAN segments by breaking a LAN. 

- Packets are filtered with the help of bridges. 

- The frames that belong to one LAN segment are not sent to the other segments. 

- This implies separate collision domains are formed. 

The bridge maintains a bridge table consisting of the following entries:

1. LAN address of the node
2. Bridge interface
3. Time stamp
4. Stale table entries

- Bridges themselves learn that which interface can be used for reaching which host. 

- After receiving a frame, it looks for the location of the sending node and records it.

- It keeps the collision domains isolated from one another thus, giving the maximum throughput. 

- It is capable of connecting a number of nodes and offer limitless geographical coverage. 

- Even different types of Ethernet can be connected through it. 

- Even the repeaters are plug and play devices but they do not provide any traffic isolation. 

- Repeaters are used for the purpose of regenerating the incoming signals as they get attenuated with time and distance. 

- If physical media such as the wifi, Ethernet etc. is being used, the signals can travel only for a limited distance and after that their quality starts degrading. 

- The work of the repeaters is to increase the extent of the distance over which the signals can travel till they reach their destination. 

- Repeaters also provide strength to the signals so that their integrity can be maintained. 

- Active hubs are an example of the repeaters and they are often known as the multi-port repeaters. 

- Passive hubs do not serve as repeaters. 

- Another example of the repeaters are the access points in a wifi network. 

- But it is only in repeater mode that they function as repeaters. 

- Regenerating signals using repeaters is a way of overcoming the attenuation which occurs because of the cable loss or the electromagnetic field divergence. 

- For long distances, a series of repeaters is often used. 

- Also, the unwanted noise that gets added up with the signal is removed by the repeaters. 

- The repeaters can only perceive and restore the digital signals.

- This is not possible with the analog signals. 

- Signal can be amplified with the help of amplifiers but they have a disadvantage which is that on using the amplifiers, the noise is amplified as well. 

- Digital signals are more prone to dissipation when compared to analog signals since they are completely dependent up on the presence of the voltages. 

- This is why they have to be repeated again and again using repeaters. 

Explain the single and two level directory structures

About Directory Structure

- Directory structure is referred to the way that the operating system follows for displaying the files and file system to the user in the field of computing. 

- A hierarchical tree structure is used for displaying the files in a typical way. 

- The special kind of string the file name uses or the unique identification of a particular file that is stored in the computer’s file system. 

- Before the 32 bit operating systems actually came in to the scenario; short names of about 6 to 14 characters in size were used for the file names. 

- However, the modern operating systems give permission for file names of longer length i.e., of 250 character and that too per path name element. 

- The drive:\ is the root directory in the operating systems such as the OS/2, windows and DOS for example, “C:\”. 

- The “\” is the directory separator but the forward slash “/” is also internally recognized by the operating system.

- A drive letter is use for naming the drives either physically or virtually. 

- This also implies there does not exist a root directory that is formal. 

- Rather, we have root directories in each drive that are independent of each other. 

- However, one virtual drive letter can be formed by combining in to one. 

- This is done by keeping a RAID setting of 0 for the hard drive. 

- The file system hierarchy standard is used by the operating systems such as the UNIX and other UNIX like systems. 

- This is the most common form for the directory structures used by the UNIX operating systems. 

- It is under the root directory “/” that all the files and the directories are stored even if they are actually present on a number of different physical devices.

About Single – level Directory

- This is the simplest of the directory structures. 

- All files are stored in the same directory itself because it is quite easy to understand as well as support. 

- The first computer of the world i.e., the CDC 6600 also operated on just one directory and it could be used by a number of users at the same time. 

- There are significant limitations of the single-level directory. 

- These limitations come in to play when there are more than one users using the system or when the system has to deal with a large number of files. 

- All the files have to be assigned unique names since they are all stored under the same directory. 

- No two files can have the same file name. 

- It may become difficult to keep the names of the files in mind if they are large in number.

About Two–level Directory

- The limitations of the single level directory structure can be overcome by creating an individual directory for every user. 

- This is the most standard solution for the problems of the single level directories. 

- In this two-level directory structure, a UFD or user file directory is made for every user. 

- The structure of all the user file directories is almost the same, but the difference is that only the files of the individual user are stored in one.

- When a user tries to log in or when he starts a task, the system searches for the MFD or master file directory. 

- The name of the user or his/ her account number is used for indexing the MFDs in the operating system. 

- Each of those entries points to the UFD belonging to that user. 

- When a reference is made to some file, the system only searches for the user file directory for example, when a file has to be deleted or created. 

Explain about demand paging and page replacements

These are two very important concepts of memory management strategies in the computer operating systems namely demand paging and paging replacements. 

About Demand Paging

- Demand paging is just the opposite concept of the anticipatory paging. 

- Demand paging is actually a memory management strategy developed for managing the virtual memory.

- The operating system that makes use of demand paging technique, a copy of the disk page is made and kept in the physical memory whenever a request is made for it i.e., whenever a page fault occurs. 

- It is obvious that the execution of a process starts with none of its page loaded in to the main memory and follows by a number of page faults occurring one after the other until all of its required pages have been loaded in to the main memory. 

- Demand paging comes under the category of the lazy loading techniques. 

- This strategy follows that only if the process in execution demands a page, then only it should be brought in to the main memory. 

- That’s why the strategy has been named as demand paging. Sometimes it is even called as the lazy evaluation. 

- Page table implementation is required for using the demand paging technique.

- The purpose of this table is to map the physical memory to the logical memory. 

- This table uses a bit wise operator for marking a page as valid or invalid. 

The following steps are carried out whenever a process demands for a page:

1. An attempt is made for accessing the page.
2. If page is present in the memory the usual instructions are followed.
3. If page is not there i.e., is invalid then a page fault is generated.
4. Memory reference to a location in the virtual memory is checked if it is valid or not. If it’s an illegal memory access then the process is terminated. If not the requested page has to be paged in.
5. The disk operations are scheduled for reading the requested page in to the physical memory.
6. Restarting the instruction that raised the page fault trap.

- The nature of this strategy is itself of great advantage. 

- Upon availability of more space in the physical memory, it allows execution of many processes leading to a decrease in the context switching time.

- At the time of program start up, less latency occurs during loading. 

- This is because the inflow and outflow of the data between main memory and secondary memory is very less.

About Page Replacement

- When less number of real memory frames is available, it leads to invoking a page stealer. 

- This stealer searches through the PFT (page frame table) for pages to steal. 

- This table stores references to the pages which are required and modified. 

- If the requested page is found by the page stealer, it does not steal it but the reference flag is reset for that page. 

- So in the pass when the page stealer comes across this page, it steals this page. 

- Note that in this pass the page was flagged as un-referenced. 

- Any change made to the page is indicated by means of the modify flag.

- If the modify flag of the page to be stolen is set, then a page out call has to be made before the page stealer does its work. 

- Thus, the pages that form a part of the currently executing segments are written to so called paging space and the persisting segments are in turn written to the disk. 

- The page replacement is carried by the algorithms called the page replacement algorithms. 

- Besides this, these also keep a track of the faults. 

Explain the methods for free space management? – Part 2

- Managing the free space is easy only when the space that has to be managed is divided in to units of fixed size. 

- If this is the case, the list of these fixed size units can be kept. 

- The first entry can be returned if it is requested by the client. 

- Managing free space gets difficult when the space to be managed consists of units of variable sizes. 

- This is the case with the memory allocation library at the user level. 

- This is also the case in the physical memory where the segmentation is used for the implementation of the virtual memory. 

- In such cases, external fragmentation is the main problem. 

- This leads to the splitting up of the disk space in to pieces of variable size. 

- The next coming requests might fail because of unavailability of contiguous free space. 

- For example, the request might fail even if 20 bytes are available and the request requires only 15 bytes because this 20 bytes space is non-contiguous. 

- Thus, the main problem is how the free space should be managed while satisfying the variable sized variables. 

How these strategies can manage free space while at the same time keeping the fragmentation in control.

Low level Mechanisms: 

- Most of the allocator use some common mechanisms as these: coalescing and splitting.

- Here, the free list consists of a set of elements describing about all the free spaces available in the heap. 

- Once a pointer to a space is handed over to the program, the determination of the pointers to this space becomes somewhat difficult. 

- These pointers are stored either in the registers or in the variables at some point of execution. 

- However, this is not the case of garbage collected and strongly typed languages as a measure for enabling compaction for combating fragmentation. - Suppose the program makes a request for a single byte of memory.

- In such a case the action performed by the allocator is called splitting. 

- Here a free memory chunk is searched for and split in to two. 

- The first one is returned to the calling request and the second one stays in the list itself. 

- This approach is used in the allocators where small requests are made requesting space that is of size smaller than the chunk. 

- Most of the allocators use a corollary mechanism called the coalescing of the free space. 

- Suppose a small heap is given and an application calls a function to obtain some memory. 

- This function returns the space available in the middle of the heap. 

- All these strategies are based up on simple policies. 

- An ideal allocator is the one that both minimizes fragmentation and is fast. 

- But since it is possible for the stream of free requests and allocation to be arbitrary, any strategy would go wrong if wrong inputs are given. 

- Thus, the best approach cannot be described. 

There are 4 major approaches in this regard:

1. Best fit: 

- Simplest and first searches the list for free chunks of memory that might be bigger than the size requested. 

- The smallest one in the searched ones is returned and this is known as the best fitting chunk or smallest fitting too. 

- One pass is enough for finding the appropriate block to be returned.

2. Worst fit: 

- This one is just the opposite of the best fit. 

- It looks for the largest chunk and returns the amount requested while keeping the remaining memory space.

3. First fit: 

- This one also looks for the first bigger block and out of it allocates the amount requested by the thread.

4. Next fit: 

- Here, one extra pointer is kept at the location where the last search was done. 

Explain the methods for free space management? – Part 1

- For efficient working of the programs and the entire operating system, it is important that the memory of the system should be managed. 

- When the files and programs are allocated memory space, some free space is left in the storage area. 

- It is required that these free spaces must be managed properly. 

- Since there is a limitation to the disk space, this same space has to be used again and again after deleting and creating new files. 

- A free space list is maintained by the operating system for keeping the track of the available free space. 

- All the free disk spaces are listed in free space list. 

- For the creation of a new file this free space list is searched in order to get the amount of space needed and then if the space is available, it is allocated to the file to be created. 

- In the case of deletion, after deleting the file, its space is added to the list of free spaces.

Methods for Free Space Management

There are 4 methods for the management of free space namely:

- Bit vector

- Linked list

- Grouping

- Counting

What is Bit Vector?

- Quite a many times, the free space list about which we mentioned above, is implemented as the bit vector (also known as the bitmap). 

- Here, 1 bit is used for representing each block. 

- If a particular block has been allocated to some file or program, its representative bit is set to 0 and when the block is available, the bit is set to one.

- Consider an example, suppose the following disk blocks are free and rest are allocated: 1, 2, 4, 5, 6, 7, 9, 10, 12, 13, 14, 18, 19, 21, 26, 27, 28. 

- Then for this allocation we have the following free – space bit map:

01101111011011100011010000111…

- This method of free space management is relatively simple and has good efficiency. 

- This method is known for its efficiency to locate the n consecutive free blocks or the first free block available in the storage area. 

- But this method can be inefficient if it is not kept in the main memory of the system. 

- Also, when required occasionally for the recovery needs, this map can also be written to the disk. 

- Keeping such maps in the physical memory is an easy thing if the system has a small memory but this is not always possible in the case of the systems with larger memories.

What is a Linked list?

- In this method, all the free spaces are linked together and the first block in this linked list is assigned a pointer which is stored in the cache memory. 

- Similarly, the pointer to the second block is stored in the first block.

What is Grouping?

- This method is a modified version of the free list approach and it stores the addresses of the all the free blocks in the first block that is free. 

- Here, actually the first n- 1 blocks only are free and the address of another n free blocks is stored in the last block. 

- This lets the system to find the addresses of a number of free blocks which is not possible in the case where the approach being used is the linked list approach.

What is Counting?

- This approach takes advantage of the simultaneous allocation or freeing of the contiguous blocks through clustering or by using contiguous allocation algorithm. 

- Thus, it requires only to keep the address of the first free block and the rest of the blocks follow it.