View All Items

Title: A next generation computer network communications architecture.
Creator: Thor, Bernice Lynn., Florida Atlantic University, Ilyas, Mohammad, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: A Next Generation Computer Network Communications Architecture, CNCA, is developed in this thesis. Existing communication techniques and available networking technologies are explored. This provides the background information for the development of the architecture. Hardware, protocol, and interface requirements are addressed to provide a practical architecture for supporting high speed communications beyond current implementations. A reduction process is then performed to extract the optimal...
Show moreA Next Generation Computer Network Communications Architecture, CNCA, is developed in this thesis. Existing communication techniques and available networking technologies are explored. This provides the background information for the development of the architecture. Hardware, protocol, and interface requirements are addressed to provide a practical architecture for supporting high speed communications beyond current implementations. A reduction process is then performed to extract the optimal components for the CNCA platform. The resulting architecture describes a next generation communications device that is capable of very fast switching and fast processing of information. The architecture interfaces with existing products, and provides extensive flexibility. This protects existing equipment investments, and supports future enhancements.
Show less
Date Issued: 1991
PURL: http://purl.flvc.org/fcla/dt/14726
Subject Headings: Computer network architectures, Computer networks
Format: Document (PDF)

Title: Dual Bus R-Net: A new local/metropolitan area network.
Creator: Chauhan, Sanjeev Birbal., Florida Atlantic University, Ilyas, Mohammad
Abstract/Description: In this thesis we have proposed and analyzed a new architecture for high speed fiber optic LANs/MANs, called the Dual Bus R-Net. The scheme is based on a slotted unidirectional dual bus structure. It uses a reservation mechanism to generate slotted frames on each bus. Frames consist of a reservation slot and one or many information slots. Stations reserve slots by transmitting reservation requests on the bus carrying information in the opposite direction. The scheme has the advantage of...
Show moreIn this thesis we have proposed and analyzed a new architecture for high speed fiber optic LANs/MANs, called the Dual Bus R-Net. The scheme is based on a slotted unidirectional dual bus structure. It uses a reservation mechanism to generate slotted frames on each bus. Frames consist of a reservation slot and one or many information slots. Stations reserve slots by transmitting reservation requests on the bus carrying information in the opposite direction. The scheme has the advantage of superior channel utilization, bounded delay, fair access to all stations, dynamic bandwidth allocation to network users, and implementation simplicity. Extensive simulations have been carried out to verify the characteristics of the network. Simulation results reinforce the initial claims of the advantages offered by Dual Bus R-Net. Performance analysis is presented in terms of network delay and channel utilization. Simulation results are compared with similar results of X-Net, R-Net, DQDB, and Expressnet.
Show less
Date Issued: 1994
PURL: http://purl.flvc.org/fcla/dt/15006
Subject Headings: Local area networks (Computer networks), Metropolitan area networks (Computer networks), Computer network architectures, Computer network protocols
Format: Document (PDF)

Title: A COMPARATIVE EVALUATION OF SERVICE DISCIPLINES IN A TOKEN RING LOCAL AREA NETWORK: A SIMULATION STUDY.
Creator: Syed, Majid Ali, Florida Atlantic University, Ilyas, Mohammad, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: The primary emphasis of this thesis is to evaluate in comparative terms the performance of three types of service disciplines in a Token Ring Local Area Network. The service disciplines studied are exhaustive, gated and limited service. These service disciplines play an important role in the network performance, especially when some users are relatively less active than others in contributing traffic load to the network. Network performance for these service disciplines are compared to...
Show moreThe primary emphasis of this thesis is to evaluate in comparative terms the performance of three types of service disciplines in a Token Ring Local Area Network. The service disciplines studied are exhaustive, gated and limited service. These service disciplines play an important role in the network performance, especially when some users are relatively less active than others in contributing traffic load to the network. Network performance for these service disciplines are compared to determine which one of them gives better performance. Simulation is used for this study and results are presented in terms of average delay, queue lengths and delay histograms versus traffic intensity.
Show less
Date Issued: 1987
PURL: http://purl.flvc.org/fcla/dt/14388
Subject Headings: Local area networks (Computer networks)
Format: Document (PDF)

Title: Performance analysis of token-passing local area networks.
Creator: Sadiku, Matthew, Florida Atlantic University, Ilyas, Mohammad, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: A unified performance analysis of token-passing local area networks is reported in this thesis. The primary performance criterion is the mean transfer delay of a message, which is defined as the time from the instant a message becomes available for transmission at a station until the end of its successful reception at the destination. Other performance criteria are power and effective transmission ratio. Analytical expressions for the criteria are derived for exhaustive, gated, and limited...
Show moreA unified performance analysis of token-passing local area networks is reported in this thesis. The primary performance criterion is the mean transfer delay of a message, which is defined as the time from the instant a message becomes available for transmission at a station until the end of its successful reception at the destination. Other performance criteria are power and effective transmission ratio. Analytical expressions for the criteria are derived for exhaustive, gated, and limited service disciplines. Simulation models are also used to support the investigations. The effects of service time distribution (constant, exponential, and hyperexponential) are examined. It is found that under any traffic intensity, service discipline or packet length distribution, token bus gives higher delay and has lower power and lower effective transmission ratio than token ring. Also, the token bus is found to be less sensitive to message length distribution, performing about the same for constant, exponential, and hyperexponential distribution.
Show less
Date Issued: 1988
PURL: http://purl.flvc.org/fcla/dt/14471
Subject Headings: Local area networks (Computer networks)
Format: Document (PDF)

Title: PERFORMANCE EVALUATION OF INTERCONNECTED TOKEN-RING LOCAL AREA NETWORKS.
Creator: DA RE, MARIA., Florida Atlantic University, Ilyas, Mohammad
Abstract/Description: This thesis gives an approximate analytical solution in terms of mean end-to-end delay of a system of token-ring local area networks interconnected via a backbone ring. The solution is based on an existing approximation (see chapter 2) of the mean end-to-end delay in a stand-alone token ring LAN, and it is extended by approximating the arrival rates at the bridges (that are function of the throughput of each subnetwork and the percentage of it that is directed to the other subnetworks). A new...
Show moreThis thesis gives an approximate analytical solution in terms of mean end-to-end delay of a system of token-ring local area networks interconnected via a backbone ring. The solution is based on an existing approximation (see chapter 2) of the mean end-to-end delay in a stand-alone token ring LAN, and it is extended by approximating the arrival rates at the bridges (that are function of the throughput of each subnetwork and the percentage of it that is directed to the other subnetworks). A new packet-length distribution is defined and its detailed derivation is described in Appendix B.
Show less
Date Issued: 1986
PURL: http://purl.flvc.org/fcla/dt/14309
Subject Headings: Local area networks (Computer networks)
Format: Document (PDF)

Title: SIMULATION STUDY OF TOKEN-PASSING BUS LOCAL AREA NETWORK.
Creator: RAO, SUHAS PALAKURTI., Florida Atlantic University, Ilyas, Mohammad, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: This thesis deals with simulation of a conflict-free token-passing protocol for local area bus networks. The primary emphasis of this simulation study is to observe the effects of token holding time on the performance of the network. Token holding time is adjusted to account for three types of service disciplines: purely non-exhaustive, non-exhaustive and exhaustive. Network performance for these three service disciplines is compared to determine, which one of the three gives a relatively...
Show moreThis thesis deals with simulation of a conflict-free token-passing protocol for local area bus networks. The primary emphasis of this simulation study is to observe the effects of token holding time on the performance of the network. Token holding time is adjusted to account for three types of service disciplines: purely non-exhaustive, non-exhaustive and exhaustive. Network performance for these three service disciplines is compared to determine, which one of the three gives a relatively better performance. Besides throughput and delay, a more compact form of performance measure called "power", has also been used in this study. Power is simply a ratio of throughput and delay. This study has shown that the token holding time has significant effect on the performance of a local area network. Simulation results of this study, are presented in terms of throughput, delay, power, logical ring size, token circulation time, efficiency/overhead versus offered load and token holding time. Some results are also presented in terms of histograms.
Show less
Date Issued: 1985
PURL: http://purl.flvc.org/fcla/dt/14275
Subject Headings: Local area networks (Computer networks)
Format: Document (PDF)

Title: Integration of dissimilar network management systems.
Creator: Frost, Sandra Lynn., Florida Atlantic University, Ilyas, Mohammad
Abstract/Description: The purpose of this thesis is to examine the issues involved in centralizing network control of two dissimilar network management systems, through the use of a protocol translator. In particular, we consider communication between a Programmable Communications Processor (PCP) and an Access Communications Processor (ACP) for the purposes of control, configuration, software updating and backup. The integration should maintain backwards compatibility to both systems, as well as providing value...
Show moreThe purpose of this thesis is to examine the issues involved in centralizing network control of two dissimilar network management systems, through the use of a protocol translator. In particular, we consider communication between a Programmable Communications Processor (PCP) and an Access Communications Processor (ACP) for the purposes of control, configuration, software updating and backup. The integration should maintain backwards compatibility to both systems, as well as providing value-added functionality. Issues to be examined include protocol translator design criteria, an implementation strategy for a state/event driven handler and performance testing.
Show less
Date Issued: 1990
PURL: http://purl.flvc.org/fcla/dt/14619
Subject Headings: Computer network protocols, Computer networks--Management
Format: Document (PDF)

Title: A REFERENCE ARCHITECTURE FOR NETWORK FUNCTION VIRTUALIZATION.
Creator: Alwakeel, Ahmed M., Fernandez, Eduardo B., Florida Atlantic University, Department of Computer and Electrical Engineering and Computer Science, College of Engineering and Computer Science
Abstract/Description: Cloud computing has provided many services to potential consumers, one of these services being the provision of network functions using virtualization. Network Function Virtualization is a new technology that aims to improve the way we consume network services. Legacy networking solutions are different because consumers must buy and install various hardware equipment. In NFV, networks are provided to users as a software as a service (SaaS). Implementing NFV comes with many benefits, including...
Show moreCloud computing has provided many services to potential consumers, one of these services being the provision of network functions using virtualization. Network Function Virtualization is a new technology that aims to improve the way we consume network services. Legacy networking solutions are different because consumers must buy and install various hardware equipment. In NFV, networks are provided to users as a software as a service (SaaS). Implementing NFV comes with many benefits, including faster module development for network functions, more rapid deployment, enhancement of the network on cloud infrastructures, and lowering the overall cost of having a network system. All these benefits can be achieved in NFV by turning physical network functions into Virtual Network Functions (VNFs). However, since this technology is still a new network paradigm, integrating this virtual environment into a legacy environment or even moving all together into NFV reflects on the complexity of adopting the NFV system. Also, a network service could be composed of several components that are provided by different service providers; this also increases the complexity and heterogeneity of the system. We apply abstract architectural modeling to describe and analyze the NFV architecture. We use architectural patterns to build a flexible NFV architecture to build a Reference Architecture (RA) for NFV that describe the system and how it works. RAs are proven to be a powerful solution to abstract complex systems that lacks semantics. Having an RA for NFV helps us understand the system and how it functions. It also helps us to expose the possible vulnerabilities that may lead to threats toward the system. In the future, this RA could be enhanced into SRA by adding misuse and security patterns for it to cover potential threats and vulnerabilities in the system. Our audiences are system designers, system architects, and security professionals who are interested in building a secure NFV system.
Show less
Date Issued: 2020
PURL: http://purl.flvc.org/fau/fd/FA00013434
Subject Headings: Virtual computer systems, Cloud computing, Computer network architectures, Computer networks
Format: Document (PDF)

Title: OPTIMAL SCHEDULING OF PROCESSES FOR A NETWORK OF TRANSPUTERS (MULTIPROCESSOR, OCCAM, CONCURRENT PROCESSING).
Creator: NGO, TON ANH., Florida Atlantic University, Fernandez, Eduardo B., College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: Concurrency at both the hardware and software level has recently been considered as the solution to the classic Von Neuman bottleneck in system design. Introduced by Inmos, the Occam language and the Transputer microprocessor provide simple and elegant building blocks for a concurrent system. This thesis proposes a set of algorithms to find an optimal deterministic schedule for an Occam program executed on a network of Transputers. Also discussed are features of the network relevant to the...
Show moreConcurrency at both the hardware and software level has recently been considered as the solution to the classic Von Neuman bottleneck in system design. Introduced by Inmos, the Occam language and the Transputer microprocessor provide simple and elegant building blocks for a concurrent system. This thesis proposes a set of algorithms to find an optimal deterministic schedule for an Occam program executed on a network of Transputers. Also discussed are features of the network relevant to the problem of scheduling, and a complete example is provided to illustrate the scheduler. The approaches described can be used as a basis for implementing a flexible general purpose multiprocessor system.
Show less
Date Issued: 1986
PURL: http://purl.flvc.org/fcla/dt/14351
Subject Headings: Multiprocessors, Computer networks
Format: Document (PDF)

Title: An artificial neural network architecture for interpolation, function approximation, time series modeling and control applications.
Creator: Luebbers, Paul Glenn., Florida Atlantic University, Pandya, Abhijit S., Sudhakar, Raghavan, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: A new artificial neural network architecture called Power Net (PWRNET) and Orthogonal Power Net (OPWRNET) has been developed. Based on the Taylor series expansion of the hyperbolic tangent function, this novel architecture can approximate multi-input multi-layer artificial networks, while requiring only a single layer of hidden nodes. This allows a compact network representation with only one layer of hidden layer weights. The resulting trained network can be expressed as a polynomial...
Show moreA new artificial neural network architecture called Power Net (PWRNET) and Orthogonal Power Net (OPWRNET) has been developed. Based on the Taylor series expansion of the hyperbolic tangent function, this novel architecture can approximate multi-input multi-layer artificial networks, while requiring only a single layer of hidden nodes. This allows a compact network representation with only one layer of hidden layer weights. The resulting trained network can be expressed as a polynomial function of the input nodes. Applications which cannot be implemented with conventional artificial neural networks, due to their intractable nature, can be developed with these network architectures. The degree of nonlinearity of the network can be directly controlled by adjusting the number of hidden layer nodes, thus avoiding problems of over-fitting which restrict generalization. The learning algorithm used for adapting the network is the familiar error back propagation training algorithm. Other learning algorithms may be applied and since only one hidden layer is to be trained, the training performance of the network is expected to be comparable to or better than conventional multi-layer feed forward networks. The new architecture is explored by applying OPWRNET to classification, function approximation and interpolation problems. These applications show that the OPWRNET has comparable performance to multi-layer perceptrons. The OPWRNET was also applied to the prediction of noisy time series and the identification of nonlinear systems. The resulting trained networks, for system identification tasks, can be expressed directly as discrete nonlinear recursive polynomials. This characteristic was exploited in the development of two new neural network based nonlinear control algorithms, the Linearized Self-Tuning Controller (LSTC) and a variation of a Neural Adaptive Controller (NAC). These control algorithms are compared to a linear self-tuning controller and an artificial neural network based Inverse Model Controller. The advantages of these new controllers are discussed.
Show less
Date Issued: 1994
PURL: http://purl.flvc.org/fcla/dt/12357
Subject Headings: Neural networks (Computer science)
Format: Document (PDF)

Title: Memory latency evaluation in cluster-based cache-coherent multiprocessor systems with different interconnection topologies.
Creator: Asaduzzaman, Abu Sadath Mohammad, Florida Atlantic University, Mahgoub, Imad
Abstract/Description: This research investigates memory latency of cluster-based cache-coherent multiprocessor systems with different interconnection topologies. We focus on a cluster-based architecture which is a variation of Stanford DASH architecture. The architecture, also, has some similarities with the STiNG architecture from Sequent Computer System Inc. In this architecture, a small number of processors and a portion of shared-memory are connected through a bus inside each cluster. As the number of...
Show moreThis research investigates memory latency of cluster-based cache-coherent multiprocessor systems with different interconnection topologies. We focus on a cluster-based architecture which is a variation of Stanford DASH architecture. The architecture, also, has some similarities with the STiNG architecture from Sequent Computer System Inc. In this architecture, a small number of processors and a portion of shared-memory are connected through a bus inside each cluster. As the number of processors per cluster is small, snoopy protocol is used inside each cluster. Each processor has two levels of caches and for each cluster a separate directory is maintained. Clusters are connected using directory-based scheme through an interconnection network to make the system scaleable. Trace-driven simulation has been developed to evaluate the overall memory latency of this architecture using three different network topologies, namely ring, mesh, and hypercube. For each network topology, the overall memory latency has been evaluated running a representative set of SPLASH-2 applications. Simulation results show that, the cluster-based multiprocessor system with hypercube topology outperforms those with mesh and ring topologies.
Show less
Date Issued: 1997
PURL: http://purl.flvc.org/fcla/dt/15447
Subject Headings: Computer network architectures, Multiprocessors
Format: Document (PDF)

Title: Counter-rotating slotted ring: A new metropolitan area network architecture.
Creator: Choi, Kwok K., Florida Atlantic University, Ilyas, Mohammad, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: In this dissertation a new architecture, Counter Rotating Slotted Ring (CRSR), is proposed for Metropolitan Area Networks (MANs). MANs are newly developed optical fiber based networks that have high data transmission rates and wide area coverage. They provide voice, video and data services. A CRSR has a dual-ring architecture that consists of two uni-directional transmission media, which are shared among the network nodes. The transmission time in a CRSR is divided into fixed length slots....
Show moreIn this dissertation a new architecture, Counter Rotating Slotted Ring (CRSR), is proposed for Metropolitan Area Networks (MANs). MANs are newly developed optical fiber based networks that have high data transmission rates and wide area coverage. They provide voice, video and data services. A CRSR has a dual-ring architecture that consists of two uni-directional transmission media, which are shared among the network nodes. The transmission time in a CRSR is divided into fixed length slots. These slots are generated by a head station during the system initialization phase. They flow inside the dual-ring in opposite directions: clockwise and counter clockwise. In each slot, there is an Access Control Field, a Segment Header Field and a Segment Payload Field. These fields contain slot control bits, segment identification and data respectively. One of the control bits is used to indicate if a slot has data or not. Once a busy slot, i.e. a slot with data, reaches its destination, it is marked as 'read'. An eraser node is used to identify 'read' slots and erase the data in the slots. In CRSR, there are two possible routes to send data from one node to another. The route with fewer nodes in between is always selected. This Minimum Node Count Routing reduces traffic on the transmission medium. IEEE has issued a Distributed Queue Dual Bus (DQDB) 802.6 standard for the subnetwork of a MAN. Under most circumstances, DQDB performs better than Fiber Distributed Data Interface (FDDI), an ANSI MAN standard. However, DQDB has two drawbacks: positional unfairness and poor channel efficiency. A number of solutions have been proposed to solve the unfairness problem, but these approaches do not improve the situation without negative effects on network performance. A CRSR with eraser in all its nodes has two times as much maximum throughput as an equivalent DQDB and at the same time, it is a positionally fair network. Although CRSRs with fewer eraser nodes are unfair, they always outperform equivalent DQDBs both in throughput and fairness.
Show less
Date Issued: 1993
PURL: http://purl.flvc.org/fcla/dt/12340
Subject Headings: Metropolitan area networks (Computer networks), Computer network architectures
Format: Document (PDF)

Title: A connected dominating-set-based routing in ad hoc wireless networks.
Creator: Gao, Ming., Florida Atlantic University, Wu, Jie
Abstract/Description: In ad hoc wireless networks, routing protocols are challenged with establishing and maintaining multihop routes in the face of mobility, bandwidth limitation and power constraints. Routing based on a connected dominating set is a promising approach, where the searching space for a router reduced to nodes in the set. A set is dominating if all the nodes in the system are either in the dominating set or adjacent to some nodes in the dominating set. In this thesis, we propose a method of...
Show moreIn ad hoc wireless networks, routing protocols are challenged with establishing and maintaining multihop routes in the face of mobility, bandwidth limitation and power constraints. Routing based on a connected dominating set is a promising approach, where the searching space for a router reduced to nodes in the set. A set is dominating if all the nodes in the system are either in the dominating set or adjacent to some nodes in the dominating set. In this thesis, we propose a method of calculating power-aware connected dominating set. Our simulation results show that the proposed approach outperforms several existing approaches in terms of life span of the network. We also discuss mobility management in dominating-set-based networks. Three operations are considered which are mobile host switch on, mobile host switch off and mobile host movement. We also discuss the use of dynamic source routing as an application of the connected dominating set.
Show less
Date Issued: 2001
PURL: http://purl.flvc.org/fcla/dt/12780
Subject Headings: Mobile computing, Computer networks, Computer algorithms
Format: Document (PDF)

Title: Routing in mobile ad-hoc wireless networks.
Creator: Li, Hailan., Florida Atlantic University, Wu, Jie, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: This thesis describes routing in mobile ad hoc wireless networks. Ad hoc networks are lack of wired backbone to maintain routes as mobile hosts move and power is on or off. Therefore, the hosts in ad hoc networks must cooperate with each other to determine routes in a distributed manner. Routing based on a connected dominating set is a frequently used approach, where the searching space for a route is reduced to nodes in small connected dominating set subnetwork. We propose a simple and...
Show moreThis thesis describes routing in mobile ad hoc wireless networks. Ad hoc networks are lack of wired backbone to maintain routes as mobile hosts move and power is on or off. Therefore, the hosts in ad hoc networks must cooperate with each other to determine routes in a distributed manner. Routing based on a connected dominating set is a frequently used approach, where the searching space for a route is reduced to nodes in small connected dominating set subnetwork. We propose a simple and efficient distributed algorithm for calculating connected dominating set in a given un-directed ad hoc network, then evaluate the proposed algorithm through simulation. We also discuss connected dominating set update/recalculation algorithms when the topology of the ad hoc network changes. We also explore the possible extension of using hierarchical connected dominating set. The shortest path routing and the dynamic source routing, which are based on the connected dominating set subnetwork, are discussed.
Show less
Date Issued: 1999
PURL: http://purl.flvc.org/fcla/dt/15695
Subject Headings: Mobile computing, Computer algorithms, Computer networks
Format: Document (PDF)

Title: Achieving Higher Receiver Satisfaction using Multicast-Favored Bandwidth Allocation Protocols.
Creator: Yousefizadeh, Hooman, Zilouchian, Ali, Ilyas, Mohammad, Florida Atlantic University, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: In recent years, many protocols for efficient Multicasting have been proposed. However, many of the Internet Service Providers (ISPs) are reluctant to use multicastenabled routers in their networks. To provide such incentives, new protocols are needed to improve the quality of their services. The challenge is to find a compromise between allocating Bandwidth (BW) among different flows in a fair manner, and favoring multicast sessions over unicast sessions. In addition, the overall higher...
Show moreIn recent years, many protocols for efficient Multicasting have been proposed. However, many of the Internet Service Providers (ISPs) are reluctant to use multicastenabled routers in their networks. To provide such incentives, new protocols are needed to improve the quality of their services. The challenge is to find a compromise between allocating Bandwidth (BW) among different flows in a fair manner, and favoring multicast sessions over unicast sessions. In addition, the overall higher level of receiver satisfaction should be achieved. In this dissertation, we propose three new innovative protocols to favor multicast sessions over unicast sessions. Multicast Favored BW Allocation- Logarithmic (MFBA-Log) and Multicast Favored BW Allocation-Linear (MFBALin) protocols allocate BW proportional to the number of down stream receivers. The proposed Multicast Reserved BW Allocation (MRBA) protocol allocates part of the BW in the links only to multicast sessions. Simulation results show the increase in the overall level of Receiver Satisfaction in the network.
Show less
Date Issued: 2006
PURL: http://purl.flvc.org/fau/fd/FA00012581
Subject Headings: Multicasting (Computer networks), Computer network protocols, Computer algorithms
Format: Document (PDF)

Title: Fault-tolerant multicasting in hypercube multicomputers.
Creator: Yao, Kejun., Florida Atlantic University, Wu, Jie, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: Interprocessor communication plays an important role in the performance of multicomputer systems, such as hypercube multicomputers. In this thesis, we consider the multicast problem for a hypercube system in the presence of faulty components. Two types of algorithms are proposed. Type 1 algorithms, which are developed based on local network information, can tolerate both node failures and link failures. Type 2 algorithms, which are developed based on limited global network information, ensure...
Show moreInterprocessor communication plays an important role in the performance of multicomputer systems, such as hypercube multicomputers. In this thesis, we consider the multicast problem for a hypercube system in the presence of faulty components. Two types of algorithms are proposed. Type 1 algorithms, which are developed based on local network information, can tolerate both node failures and link failures. Type 2 algorithms, which are developed based on limited global network information, ensure that each destination receives message through the shortest path. Simulation results show that type 2 algorithms achieve very good results on both time and traffic steps, two main criteria in measuring the performance of interprocessor communication.
Show less
Date Issued: 1993
PURL: http://purl.flvc.org/fcla/dt/14896
Subject Headings: Hypercube networks (Computer networks), Computer architecture, Fault-tolerant computing
Format: Document (PDF)

Title: Learning in connectionist networks using the Alopex algorithm.
Creator: Venugopal, Kootala Pattath., Florida Atlantic University, Pandya, Abhijit S., Sudhakar, Raghavan, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: The Alopex algorithm is presented as a universal learning algorithm for connectionist models. It is shown that the Alopex procedure could be used efficiently as a supervised learning algorithm for such models. The algorithm is demonstrated successfully on a variety of network architectures. Such architectures include multilayer perceptrons, time-delay models, asymmetric, fully recurrent networks and memory neuron networks. The learning performance as well as the generation capability of the...
Show moreThe Alopex algorithm is presented as a universal learning algorithm for connectionist models. It is shown that the Alopex procedure could be used efficiently as a supervised learning algorithm for such models. The algorithm is demonstrated successfully on a variety of network architectures. Such architectures include multilayer perceptrons, time-delay models, asymmetric, fully recurrent networks and memory neuron networks. The learning performance as well as the generation capability of the Alopex algorithm are compared with those of the backpropagation procedure, concerning a number of benchmark problems, and it is shown that the Alopex has specific advantages over the backpropagation. Two new architectures (gain layer schemes) are proposed for the on-line, direct adaptive control of dynamical systems using neural networks. The proposed schemes are shown to provide better dynamic response and tracking characteristics, than the other existing direct control schemes. A velocity reference scheme is introduced to improve the dynamic response of on-line learning controllers. The proposed learning algorithm and architectures are studied on three practical problems; (i) Classification of handwritten digits using Fourier Descriptors; (ii) Recognition of underwater targets from sonar returns, considering temporal dependencies of consecutive returns and (iii) On-line learning control of autonomous underwater vehicles, starting with random initial conditions. Detailed studies are conducted on the learning control applications. Effect of the network learning rate on the tracking performance and dynamic response of the system are investigated. Also, the ability of the neural network controllers to adapt to slow and sudden varying parameter disturbances and measurement noise is studied in detail.
Show less
Date Issued: 1993
PURL: http://purl.flvc.org/fcla/dt/12325
Subject Headings: Computer algorithms, Computer networks, Neural networks (Computer science), Machine learning
Format: Document (PDF)

Title: Unifying the conceptual levels of network security through the use of patterns.
Creator: Kumar, Ajoy, Fernandez, Eduardo B., Florida Atlantic University, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: Network architectures are described by the International Standard for Organization (ISO), which contains seven layers. The internet uses four of these layers, of which three are of interest to us. These layers are Internet Protocol (IP) or Network Layer, Transport Layer and Application Layer. We need to protect against attacks that may come through any of these layers. In the world of network security, systems are plagued by various attacks, internal and external, and could result in Denial...
Show moreNetwork architectures are described by the International Standard for Organization (ISO), which contains seven layers. The internet uses four of these layers, of which three are of interest to us. These layers are Internet Protocol (IP) or Network Layer, Transport Layer and Application Layer. We need to protect against attacks that may come through any of these layers. In the world of network security, systems are plagued by various attacks, internal and external, and could result in Denial of Service (DoS) and/or other damaging effects. Such attacks and loss of service can be devastating for the users of the system. The implementation of security devices such as Firewalls and Intrusion Detection Systems (IDS), the protection of network traffic with Virtual Private Networks (VPNs), and the use of secure protocols for the layers are important to enhance the security at each of these layers.We have done a survey of the existing network security patterns and we have written the missing patterns. We have developed security patterns for abstract IDS, Behavior–based IDS and Rule-based IDS and as well as for Internet Protocol Security (IPSec) and Transport Layer Security (TLS) protocols. We have also identified the need for a VPN pattern and have developed security patterns for abstract VPN, an IPSec VPN and a TLS VPN. We also evaluated these patterns with respect to some aspects to simplify their application by system designers. We have tried to unify the security of the network layers using security patterns by tying in security patterns for network transmission, network protocols and network boundary devices.
Show less
Date Issued: 2014
PURL: http://purl.flvc.org/fau/fd/FA00004132, http://purl.flvc.org/fau/fd/FA00004132
Subject Headings: Computer architecture, Computer network architectures, Computer network protocols, Computer network protocols, Computer networks -- Security measures, Expert systems (Computer science)
Format: Document (PDF)

Title: PERFORMANCE ANALYSIS OF TOKEN-RING LOCAL AREA NETWORK WITH GATED SERVICE DISCIPLINE (LAN).
Creator: HUYNH, LAP THIET., Florida Atlantic University, Ilyas, Mohammad
Abstract/Description: This thesis investigates the waiting-time in a token-ring local area network (LAN) with gated service discipline. It gives an analytical approximati.on for a network with an arbitrary number of stations, non-identical Poisson arrival streams and general service time distributions at each station, and non-zero switch-over time (also referred to as walking time) between adjacent stations. This approximation method is an alternative to the complicated O(N^2) numerical evaluation of the waiting...
Show moreThis thesis investigates the waiting-time in a token-ring local area network (LAN) with gated service discipline. It gives an analytical approximati.on for a network with an arbitrary number of stations, non-identical Poisson arrival streams and general service time distributions at each station, and non-zero switch-over time (also referred to as walking time) between adjacent stations. This approximation method is an alternative to the complicated O(N^2) numerical evaluation of the waiting-time currently available in the literature. Extensive simulation results with different parameters are presented to show the degree of accuracy of the approximation, which is generally good for a practical range of parameters.
Show less
Date Issued: 1987
PURL: http://purl.flvc.org/fcla/dt/14364
Subject Headings: Local area networks (Computer networks), Queuing theory
Format: Document (PDF)

Title: A feasibility study on using LonWorks Power Line Transceivers for underwater communications.
Creator: Powell, Jennifer Cairns., Florida Atlantic University, Smith, Samuel M., College of Engineering and Computer Science, Department of Ocean and Mechanical Engineering
Abstract/Description: This project consisted of a feasibility study to ascertain whether or not an inexpensive acoustic modem for an Autonomous Underwater Vehicle (AUV) could be developed using low cost commercially available products. Our AUV's at Florida Atlantic University currently use LonWorks for their internal control networks, so we have plenty of experience with their parts. The LonWorks Power Line Transceivers are capable of generating a signal that can be sent to a transducer for communication through...
Show moreThis project consisted of a feasibility study to ascertain whether or not an inexpensive acoustic modem for an Autonomous Underwater Vehicle (AUV) could be developed using low cost commercially available products. Our AUV's at Florida Atlantic University currently use LonWorks for their internal control networks, so we have plenty of experience with their parts. The LonWorks Power Line Transceivers are capable of generating a signal that can be sent to a transducer for communication through the water. The PLT-30 Power Line Transceiver generates a direct sequence spread spectrum signal (DSSS) that offers many useful operating features; such as anti-jam, interference rejection and covert communications, low intercept probability, and most importantly, multipath protection. After numerous tests, however, the system was incapable of establishing reliable acoustic communications. We conclude that the PLT-30 Power Line Transceiver use as an underwater acoustic modem is not a viable approach. As an alternative method, communication through an electric current field was tested in a salt-water pool. The initial test produced a 100% success rate.
Show less
Date Issued: 2000
PURL: http://purl.flvc.org/fcla/dt/12695
Subject Headings: Local area networks (Computer network), Underwater acoustics
Format: Document (PDF)

FAU Theses and Dissertations (279)	+ -
FAU Graduate Student Research (2)	+ -
FAU College Collections (1)	+ -
HBOI Faculty Contributions (1)	+ -
Honors Student Theses (1)	+ -

Neural networks (Computer science) (79)	+ -
Computer network protocols (47)	+ -
Wireless communication systems (40)	+ -
Computer networks (35)	+ -
Computer network architectures (23)	+ -

Computer algorithms (17)	+ -
Mobile computing (15)	+ -
Technological innovations (15)	+ -
Local area networks (Computer networks) (14)	+ -
Computer security (12)	+ -
Ad hoc networks (Computer networks) (11)	+ -
Artificial intelligence (11)	+ -
Computer networks--Security measures (11)	+ -
Expert systems (Computer science) (11)	+ -
Sensor networks (11)	+ -
Hypercube networks (Computer networks) (10)	+ -
Pattern recognition systems (10)	+ -
Security measures (10)	+ -
Data encryption (Computer science) (9)	+ -
Design and construction (9)	+ -
Fault-tolerant computing (9)	+ -
Packet switching (Data transmission) (9)	+ -
Routers (Computer networks) (9)	+ -
Software engineering (9)	+ -
TCP/IP (Computer network protocol) (9)	+ -
Computer architecture (8)	+ -
Data transmission systems (8)	+ -
Fuzzy logic (8)	+ -
Mobile communication systems (8)	+ -
Asynchronous transfer mode (7)	+ -

United States (2)	+ -
Latin America (1)	+ -

Electronic Thesis or Dissertation (279)	+ -
abstract (2)	+ -
article (2)	+ -
poster (1)	+ -
thesis (1)	+ -

Search In

Pages

Pages

Sort Results By:

Narrow results by:

Collection

Topical Subject

Geographic Subject

Title as Subject

Genre

Type of Resource

Language

Creator

Format

Owner