An investigation into some critical computer networking parameters : Internet addressing and routing
- Authors: Isted, Edwin David
- Date: 1996
- Subjects: Computer networks , Internet , Electronic mail systems
- Language: English
- Type: Thesis , Masters , MSc
- Identifier: vital:4608 , http://hdl.handle.net/10962/d1004874 , Computer networks , Internet , Electronic mail systems
- Description: This thesis describes the evaluation of several proposals suggested as replacements for the currenT Internet's TCPJIP protocol suite. The emphasis of this thesis is on how the proposals solve the current routing and addressing problems associated with the Internet. The addressing problem is found to be related to address space depletion, and the routing problem related to excessive routing costs. The evaluation is performed based on criteria selected for their applicability as future Internet design criteria. AIl the protocols are evaluated using the above-mentioned criteria. It is concluded that the most suitable addressing mechanism is an expandable multi-level format, with a logical separation of location and host identification information. Similarly, the most suitable network representation technique is found to be an unrestricted hierarchical structure which uses a suitable abstraction mechanism. It is further found that these two solutions could adequately solve the existing addressing and routing problems and allow substantial growth of the Internet.
- Full Text:
- Date Issued: 1996
An investigation into some critical computer networking parameters : Internet addressing and routing
- Authors: Isted, Edwin David
- Date: 1996
- Subjects: Computer networks , Internet , Electronic mail systems
- Language: English
- Type: Thesis , Masters , MSc
- Identifier: vital:4608 , http://hdl.handle.net/10962/d1004874 , Computer networks , Internet , Electronic mail systems
- Description: This thesis describes the evaluation of several proposals suggested as replacements for the currenT Internet's TCPJIP protocol suite. The emphasis of this thesis is on how the proposals solve the current routing and addressing problems associated with the Internet. The addressing problem is found to be related to address space depletion, and the routing problem related to excessive routing costs. The evaluation is performed based on criteria selected for their applicability as future Internet design criteria. AIl the protocols are evaluated using the above-mentioned criteria. It is concluded that the most suitable addressing mechanism is an expandable multi-level format, with a logical separation of location and host identification information. Similarly, the most suitable network representation technique is found to be an unrestricted hierarchical structure which uses a suitable abstraction mechanism. It is further found that these two solutions could adequately solve the existing addressing and routing problems and allow substantial growth of the Internet.
- Full Text:
- Date Issued: 1996
Remora : implementing adaptive parallelism on a heterogeneous cluster of networked workstations
- Authors: Rehmet, Geoffrey Michael
- Date: 1995
- Subjects: LINDA (Computer system) , Local area networks (Computer networks) , Computer networks , Remora (Computer system)
- Language: English
- Type: Thesis , Masters , MSc
- Identifier: vital:4673 , http://hdl.handle.net/10962/d1006696 , LINDA (Computer system) , Local area networks (Computer networks) , Computer networks , Remora (Computer system)
- Description: Computers connected to a local area network are often only fully utilized for short periods of time. In fact, most workstations are not used at all for a significant portion of the day. The combined "idle time" of the workstations on a network constitutes a significant computing resource, which is generally wasted. If harnessed properly, such a resource could constitute a cheap alternative to expensive high-performance computers. Adaptive parallelism refers to the parallel execution of a computation on a dynamically changing set of processors. This thesis investigates the viability of this approach as a vehicle to harness the "idle cycles" available on a heterogeneous cluster of networked computers. A system, called Remora, which implements adaptive parallelism via the Linda programming paradigm, is presented. Experiments, performed using Remora, show that adaptive parallelism provides an efficient vehicle for using idle processor cycles, without having an adverse effect on the tasks which constitute the normal workload of the computers being used.
- Full Text:
- Date Issued: 1995
- Authors: Rehmet, Geoffrey Michael
- Date: 1995
- Subjects: LINDA (Computer system) , Local area networks (Computer networks) , Computer networks , Remora (Computer system)
- Language: English
- Type: Thesis , Masters , MSc
- Identifier: vital:4673 , http://hdl.handle.net/10962/d1006696 , LINDA (Computer system) , Local area networks (Computer networks) , Computer networks , Remora (Computer system)
- Description: Computers connected to a local area network are often only fully utilized for short periods of time. In fact, most workstations are not used at all for a significant portion of the day. The combined "idle time" of the workstations on a network constitutes a significant computing resource, which is generally wasted. If harnessed properly, such a resource could constitute a cheap alternative to expensive high-performance computers. Adaptive parallelism refers to the parallel execution of a computation on a dynamically changing set of processors. This thesis investigates the viability of this approach as a vehicle to harness the "idle cycles" available on a heterogeneous cluster of networked computers. A system, called Remora, which implements adaptive parallelism via the Linda programming paradigm, is presented. Experiments, performed using Remora, show that adaptive parallelism provides an efficient vehicle for using idle processor cycles, without having an adverse effect on the tasks which constitute the normal workload of the computers being used.
- Full Text:
- Date Issued: 1995
Routing MIDI messages in a shared music studio environment
- Authors: Mosala, Thabo Jerry
- Date: 1995
- Subjects: MIDI (Standard) , Computer networks
- Language: English
- Type: Thesis , Masters , MSc
- Identifier: vital:4672 , http://hdl.handle.net/10962/d1006695 , MIDI (Standard) , Computer networks
- Description: The Rhodes Computer Music Network (RHOCMN) is a network which allows main studio resources to be shared. RHOCMN is growing into a multi-workstation environment and additional devices are being incorporated into the system. A star configuration is used for transmitting MIDI from a MIDI patch bay to the workstations and MIDI devices. This imposes several disadvantages on the use of the studio, such as wiring problems. In a quest to avoid problems related to MIDI in RHOCMN, the MIDINet system was developed. The idea was to acquire a viable solution to MIDI's main problems which does not involve a redefinition of the MIDI specification.
- Full Text:
- Date Issued: 1995
- Authors: Mosala, Thabo Jerry
- Date: 1995
- Subjects: MIDI (Standard) , Computer networks
- Language: English
- Type: Thesis , Masters , MSc
- Identifier: vital:4672 , http://hdl.handle.net/10962/d1006695 , MIDI (Standard) , Computer networks
- Description: The Rhodes Computer Music Network (RHOCMN) is a network which allows main studio resources to be shared. RHOCMN is growing into a multi-workstation environment and additional devices are being incorporated into the system. A star configuration is used for transmitting MIDI from a MIDI patch bay to the workstations and MIDI devices. This imposes several disadvantages on the use of the studio, such as wiring problems. In a quest to avoid problems related to MIDI in RHOCMN, the MIDINet system was developed. The idea was to acquire a viable solution to MIDI's main problems which does not involve a redefinition of the MIDI specification.
- Full Text:
- Date Issued: 1995
The analysis of a computer music network and the implementation of essential subsystems
- Authors: Wilks, Antony John
- Date: 1995
- Subjects: Computer networks , Computer music , MIDI (Standard)
- Language: English
- Type: Thesis , Masters , MSc
- Identifier: vital:4666 , http://hdl.handle.net/10962/d1006682 , Computer networks , Computer music , MIDI (Standard)
- Description: The inability to share resources in commercial and institutional computer music studios results in non-optimal resource utilisation. The use of computers to process, store and communicate data can be extended within these studios, to provide the capability of sharing resources amongst their users. This thesis describes a computer music network which was designed for this purpose. Certain devices had to be custom built for the implementation of the network. The thesis discusses the design and construction of these devices.
- Full Text:
- Date Issued: 1995
- Authors: Wilks, Antony John
- Date: 1995
- Subjects: Computer networks , Computer music , MIDI (Standard)
- Language: English
- Type: Thesis , Masters , MSc
- Identifier: vital:4666 , http://hdl.handle.net/10962/d1006682 , Computer networks , Computer music , MIDI (Standard)
- Description: The inability to share resources in commercial and institutional computer music studios results in non-optimal resource utilisation. The use of computers to process, store and communicate data can be extended within these studios, to provide the capability of sharing resources amongst their users. This thesis describes a computer music network which was designed for this purpose. Certain devices had to be custom built for the implementation of the network. The thesis discusses the design and construction of these devices.
- Full Text:
- Date Issued: 1995