An Adventure Into Technology

Posts

Static VS. Dynamic IP Addresses

I would not recommend a dynamic IP address for a business or organization. Businesses and organizations would benefit the most from a static IP address. A static IP address provides many benefits to businesses including: Reliability for dedicated servers. (Mail, FTP, Web Servers) Perfect for creating and hosting servers. More accurate geolocation services. Even though a static IP address may be less secure than a dynamic one, there are still ways to prevent the IP address from being found by an unauthorized person. The use of a virtual private network (VPN) with a static IP address helps the user conceal what the actual IP address is. VPNs can also be used with dynamic IP addresses as an added security measure. A static IP address allows the address of the device to remain the same without change as long as the location of the connection does not change. A dynamic IP address is constantly changing although the length of time at which it changes can vary. According to Vaughan-Nicho

Peering Points and the Network Application Interface

According to Gibb (2019), “Peering is a method that allows two networks to connect and exchange traffic directly without having to pay a third party to carry traffic across the Internet.” Utilizing a peering point allows users to send a receive data directly to one another without the need to route through other computer networks. Doing so allows for a quicker, more efficient, and safer form of communication. Researching the total number of active Internet Exchange Points (IXP) proved difficult as it was hard to pinpoint an accurate number. However, according to Rosas (2021), “as of January 2021, of the 630 registered IXPs, 229 are in Europe, 126 in North America, 140 in Asia-Pacific, 96 in Latin America and the Caribbean (LAC), and 39 in Africa.” These numbers are constantly changing as new IXPs are added, and some are removed. Finding a definitive number of Internet Service Providers (ISP) globally was also difficult to accomplish. Most sources seem to point to the Nations Encyclop

CAT6 Wiring and Installation Instructions

The internal wiring on the CAT5e and CAT6 cables are specifically arranged so that each wire can perform its intended function when connected to certain devices. The table below shows an example of the T568A wiring scheme. Currently there are two different wiring schemes for ethernet cables. These schemes include the straight through pin out for T568A and the straight through pin out for T568B. The T568A is recommended for use in residential applications because it is backwards compatible with older electronic devices. However, aside from specific contracts requiring that the cables be terminated in a specific way, it is up to the installer to decide to use either T568A or T568B as there are no major differences. If I were to write my own instructions on how to build the RJ45 connector on a CAT6 cable, it would be as follows. Gather all the necessary tools including: Wire cutters. RJ45 connectors. This should include the liner, sled, and plug body. Plug crimper. Optional: wiremap te

Algorithmic Design

An algorithm is defined as a process or set of rules to be followed in calculations and other problem-solving operations, especially by a computer. This means algorithms aid in the development and execution of processing data from the initial input to the final output. Regarding algorithms, there are numerous types of techniques that can be used to help develop structured programs in reference to data structures such as: Delete - Removes an item. Insert - Introduces an item. Update - Edits an existing item. Search - Searches for an item. Sort - Sorts all items. The use of algorithms in programming languages is situationally dependent upon the needs of the user. Users may find that some algorithms work more efficiently in some situations than others. It is important for the user to determine what they are trying to achieve and select the best algorithm to fit the situation. This is also why one design may be more beneficial than another.

Java: A Beginner's Guide

Java is often described as an Object-Oriented Programming (OOP) language similar to Python, C#, PHP, and many more. OOP languages consist of four major principles which are listed below. Inheritance - When one object acquires all the properties and behaviors of a parent object. Polymorphism - A single task is performed is various ways. Abstraction - Hiding internal details and showing functionality. Encapsulation - Binding (or wrapping) code and data together into a single unit. Additional concepts to know in regard to OOP languages are object and class. Object can be described as "any entity that has state and behavior" while class refers to "a collection of objects" (Javatpoint, n.d) OOP languages provide the user with easier maintenance and development, data hiding, and an ability to mimic real-world events as opposed to a procedure-oriented programming language. The links posted below break down how to successfully install Java and the NetBeans IDE. They also se

Access Lists and Capabilities

To implement an access matrix, we must first understand what it is. An access matrix is a protection model within an operating system consisting of objects and domains. The access matrix determines which processes interact with objects within the domain. Objects within the domain can consist of both hardware and software. The lists below show the advantages and disadvantages of access lists associated with objects, and capabilities with domains. Access lists associated with objects Advantages Corresponds directly to the user’s needs. Easy revocation and review of access. Disadvantages Difficult to determine access rights for a domain. Takes time to search the domain for access rights. Capabilities with domains Advantages Useful for localizing information for a process. Secured against unauthorized access. Disadvantages Inefficient at the revocation of capabilities. Does not correspond directly to the user’s needs. Even though each implementation has its own strengths and w

Hard Drive Disk-Scheduling Algorithms

First-Come-First-Served (FCFS) The first-come-first-served (FCFS) algorithm is designed to handle requests in the order they are received, regardless of where the head is located within the disk drive. Even though this is most fair algorithm out of the three, it is also the least efficient. The graph below shows how inconsistently the head had to travel in order to serve the requests that were being sent. Shortest-Seek-Time-First (SSTF) The shortest-seek-time-first algorithm aims to handle requests with the shortest seek time from the current head location. This algorithm surprised me as I thought it was going to be more efficient than the FCFS algorithm. As shown in the graph, this algorithm was performing very well until a request was sent at cylinder 17. In this case the head waited to serve the request at cylinder 17 until very last which forced the head to travel a long distance. SCAN The SCAN algorithm handles requests by moving the arm from one end of the cylinder to

File System Management Functions

The main purpose of file system management is to be able to store information, organize it, share it, and access it later. The file system is comprised of two parts: a collection of files, and a directory structure. It also provides the user with access to online storage, data, and operating system programs. When it comes to the operation of files there are several distinct types that they can perform to include: Creating Writing Reading Repositioning Deleting Truncating In terms of reliability, a new organizational technique was introduced called redundant arrays of independent disks (RAID). According to Silberschatz, Galvin, & Gagne (2014), the new RAID techniques "are commonly used to address the performance and reliability issues." (p. 458). The RAID technique uses multiple disks rather than a single disk to improve overall performance and allow for data redundancy. In total there are five distinct directory structures seen below. Each directory structure has

Memory Allocation Algorithms

First-Fit The process for entering a process using the first-fit algorithm was to find the first available partition that the memory could fit into. Although this may have been the quickest way to allocate a process to an open partition, it was not the most ideal. The process is written in an open partition regardless of the total amount of memory that was available. This is not the most efficient way to store processes because the algorithm may write into a partition that could have later been occupied by a larger process. However, this algorithm, overall, is better than the worst fit algorithm in the fact that it was able to store more of the assigned processes. Best-Fit The best fit method was the most efficient algorithm. This is because the algorithm is trying to find the smallest partition that the process can be stored in. Doing so provides the most leftover memory that an additional process can be stored in. However, this may not be the quickest solution as each partition w