View All Items

Title: Design and performance analysis of FDDI and DQDB network architectures.
Creator: Khera, Harbinder Singh., 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 study the behavioral characteristics of Fiber Distributed Data Interface (FDDI) and Distributed Queue Dual Bus (DQDB) High Speed Local Area Networks (HSLANs). An FDDI architecture with passive interfaces is proposed to provide a reliable and efficient network topology. This network architecture outperforms the existing FDDI architecture with active interfaces in terms of small asynchronous packet delays and high asynchronous packet throughput. The...
Show moreThe primary emphasis of this thesis is to study the behavioral characteristics of Fiber Distributed Data Interface (FDDI) and Distributed Queue Dual Bus (DQDB) High Speed Local Area Networks (HSLANs). An FDDI architecture with passive interfaces is proposed to provide a reliable and efficient network topology. This network architecture outperforms the existing FDDI architecture with active interfaces in terms of small asynchronous packet delays and high asynchronous packet throughput. The design and implementation issues involved in the design of the hierarchical (multi-level) DQDB and FDDI networks are also presented. The hierarchical network architecture provides modularity and scalability with respect to speed and the number of users. Simulation models are developed for each of these network architectures to study their performance. Simulation results are presented in terms of medium access delay, throughput, and packet delays.
Show less
Date Issued: 1993
PURL: http://purl.flvc.org/fcla/dt/14976
Subject Headings: Fiber Distributed Data Interface (Computer network standard), Computer architecture, Local area networks (Computer networks)
Format: Document (PDF)

Title: Designing non-proprietary and practical ISDN terminal equipment for basic access.
Creator: Mitchell, Todd., Florida Atlantic University, Ilyas, Mohammad, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: This thesis illustrates the design of non-proprietary and practical ISDN terminal equipment for basic access. Terminal compatibility with the AT&T 5ESS, Northern Telecom DMS100, and Siemens EWSD Class 5 switches is considered. General compliance is dictated by all applicable CCITT recommendations and BELLCORE technical references. A consolidation of the useful information in the CCITT and BELLCORE technical documents is provided from a design engineer's perspective. A practical, cost...
Show moreThis thesis illustrates the design of non-proprietary and practical ISDN terminal equipment for basic access. Terminal compatibility with the AT&T 5ESS, Northern Telecom DMS100, and Siemens EWSD Class 5 switches is considered. General compliance is dictated by all applicable CCITT recommendations and BELLCORE technical references. A consolidation of the useful information in the CCITT and BELLCORE technical documents is provided from a design engineer's perspective. A practical, cost effective implementation is outlined and considerations for flexibility due to the changing requirements are explored. The objective is to specify simplified guidelines which can be followed to create generic ISDN terminal equipment which is non-proprietary and practical for ISDN subscribers today.
Show less
Date Issued: 1990
PURL: http://purl.flvc.org/fcla/dt/14662
Subject Headings: Integrated services digital networks, Data transmission systems--Equipment and supplies
Format: Document (PDF)

Title: Flow control in interconnected token ring local area networks.
Creator: Varughese, Sicely Babu., Florida Atlantic University, Ilyas, Mohammad, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: This thesis investigates some of the flow control issues in a system of Local Area Networks consisting of multiple token rings interconnected through bridges via a backbone ring. Flow control is realized by a window mechanism, i.e., a sender is permitted to transmit not more than a fixed number, W (the window size), of frames without having to wait for an acknowledgment. The solution is based on an existing approximation of the mean end-to-end delay in a stand-alone token ring LAN, which is...
Show moreThis thesis investigates some of the flow control issues in a system of Local Area Networks consisting of multiple token rings interconnected through bridges via a backbone ring. Flow control is realized by a window mechanism, i.e., a sender is permitted to transmit not more than a fixed number, W (the window size), of frames without having to wait for an acknowledgment. The solution is based on an existing approximation of the mean end-to-end delay in a stand-alone token ring LAN, which is extended by approximating the arrival rates at the bridges as a function of the throughput of each subnetwork and the probability that, the throughput is directed to the other subnetworks. The packet-lengths are assumed to be exponentially distributed. The performance of the system is evaluated by varying the window size.
Show less
Date Issued: 1988
PURL: http://purl.flvc.org/fcla/dt/14447
Subject Headings: IBM Token-Ring Network (Local area network system)
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 Bluetooth networks.
Creator: Subramani, Murugesan K., Florida Atlantic University, Ilyas, Mohammad, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: This research work deals with analyzing the performance issues of Bluetooth networks such as Piconet and Scatternet. Bluetooth systems with the basic protocol layers such as Bluetooth radio, Baseband, L2CAP, and LMP were simulated to study the performance issues. The primary focus of this simulation study is to observe the effects of packet transmission delay and the number Bluetooth of packets transmitted. The performance characteristics were obtained with varying number of links in a...
Show moreThis research work deals with analyzing the performance issues of Bluetooth networks such as Piconet and Scatternet. Bluetooth systems with the basic protocol layers such as Bluetooth radio, Baseband, L2CAP, and LMP were simulated to study the performance issues. The primary focus of this simulation study is to observe the effects of packet transmission delay and the number Bluetooth of packets transmitted. The performance characteristics were obtained with varying number of links in a Bluetooth Piconet/Sctternet setup and with variation in information traffic pattern such as Exponential Traffic and FTP traffic patterns. The performance characteristics were obtained with variation in packet types also. The simulation results of the study, are presented in terms of packet transmission delay, number of packets transmitted, comparative study of packets with and without error codes in graphical representations.
Show less
Date Issued: 2002
PURL: http://purl.flvc.org/fcla/dt/12928
Subject Headings: Bluetooth technology, Radio--Packet transmission
Format: Document (PDF)

Title: PERFORMANCE ANALYSIS OF INTEGRATED SERVICES DIGITAL NETWORK D-CHANNEL BASIC RATE ACCESS.
Creator: MUTH, THERESA ANN., Florida Atlantic University, Ilyas, Mohammad, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: This thesis evaluates the performance of the D-channel which is part of the Basic Rate interface in an Integrated Services Digital Network (ISDN). A channel is a specified portion of the information-carrying capacity of the interface. The Basic Rate interface supports three channels; two B-channels and one D-channel. As ISDN user, physically connected on a passive bus, contends and resolves access for the D-channel, or signalling channel. In this thesis the D-channel and the contention...
Show moreThis thesis evaluates the performance of the D-channel which is part of the Basic Rate interface in an Integrated Services Digital Network (ISDN). A channel is a specified portion of the information-carrying capacity of the interface. The Basic Rate interface supports three channels; two B-channels and one D-channel. As ISDN user, physically connected on a passive bus, contends and resolves access for the D-channel, or signalling channel. In this thesis the D-channel and the contention resolution are modeled and simulated as a queueing system. Simulation results using the non-preemptive priority queueing discipline with deterministic and truncated exponential service times are presented. Performance is measured in terms of delay and queue length characteristics.
Show less
Date Issued: 1987
PURL: http://purl.flvc.org/fcla/dt/14406
Subject Headings: Integrated services digital networks, Computer interfaces
Format: Document (PDF)

Title: Specialized communications processor for layered protocols.
Creator: Mandalia, Baiju Dhirajlal., Florida Atlantic University, Ilyas, Mohammad, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: This dissertation describes an architecture for a special purpose communications protocol processor (CPP) that has been developed for open systems interconnection (OSI) type layered protocol processing. There exists a performance problem with the implementation and processing of communication protocols and the problem can have an impact on the throughput of future network interfaces. This problem revolves around two issues, (i) communication processing bottlenecks to fully utilize high speed...
Show moreThis dissertation describes an architecture for a special purpose communications protocol processor (CPP) that has been developed for open systems interconnection (OSI) type layered protocol processing. There exists a performance problem with the implementation and processing of communication protocols and the problem can have an impact on the throughput of future network interfaces. This problem revolves around two issues, (i) communication processing bottlenecks to fully utilize high speed transmission mediums; (ii) mechanism used in the implementation of communications functions. It is the objective of this work to address this problem and develop a first of its kind processor that is dedicated to protocol processing. At first trends in computer communications technology are discussed along with issues that influence throughput in front end controllers for network interfaces that support OSI. Network interface requirements and a survey of existing technology are presented and the state of the art of layered communication is evaluated and specific parameters that contribute to the performance of communications processors are identified. Based on this evaluation a new set of instructions is developed to support the necessary functions. Each component of the new architecture is explained with respect to the mechanism for implementation. The CPP contains special-purpose circuits dedicated to quick performance (e.g. single machine cycle execution) of functions needed to process header and frame information, functions which are repeatedly encountered in all protocol layers, and instructions designed to take advantage of these circuits. The header processing functions include priority branch determination functions, register bit reshaping (rearranging) functions, and instruction address processing functions. Frame processing functions include CRC (cyclic redundancy check) computations, bit insertion/deletion operations and special character detection operations. Justifications for new techniques are provided and their advantages over existing technology are discussed. A hardware register transfer level model is developed to simulate the new architecture for path length computations. A performance queueing model is also developed to analyze the processor characteristics with various load parameters. Finally, a brief discussion indicates how such a processor would apply to future network interfaces along with possible trends.
Show less
Date Issued: 1989
PURL: http://purl.flvc.org/fcla/dt/11933
Subject Headings: Computer network protocols, Computer networks, Data transmission systems
Format: Document (PDF)

Title: YACAD: Yet Another Congestion Avoidance Design for ATM-based networks.
Creator: Hsu, Sam, Florida Atlantic University, Ilyas, Mohammad, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: This dissertation proposes YACAD (Yet Another Congestion Avoidance Design for ATM-based Networks), a congestion prevention model that includes admission control, traffic shaping, and link-by-link flow control for ATM-based networks. Network traffic in this model is composed of real-time traffic and data traffic. As real-time traffic is delay-sensitive and connection-oriented, its call acceptance is based upon the effective bandwidth at all nodes. Effective bandwidth is defined as a vector of...
Show moreThis dissertation proposes YACAD (Yet Another Congestion Avoidance Design for ATM-based Networks), a congestion prevention model that includes admission control, traffic shaping, and link-by-link flow control for ATM-based networks. Network traffic in this model is composed of real-time traffic and data traffic. As real-time traffic is delay-sensitive and connection-oriented, its call acceptance is based upon the effective bandwidth at all nodes. Effective bandwidth is defined as a vector of bandwidth and maximum node delay. As data traffic can be either connection-oriented or connectionless, it is subject to link-by-link flow control based on a criterion known as effective buffer which is defined as a scalar of buffer size. Data traffic is not delay-sensitive but is loss-sensitive. Traffic shaping is imposed on real-time traffic to ensure a smooth inflow of real-time cells. YACAD also allocates a large buffer (fat bucket) to data traffic to accommodate sudden long bursts of data cells. Absence of data cell loss is a major feature of YACAD. Two simulation studies on the performance of the model are conducted. Analyses of the simulation results show that the proposed congestion avoidance model can achieve congestion-free networking and bounded network delays for real-time traffic at high levels of channel utilization. The maximum buffer requirements for loss-free cell delivery for data traffic, and the cell loss probabilities for real-time traffic are also obtained. In addition, results of performance comparisons to other similar models have shown that YACAD outperforms several other leaky-bucket based congestion control methods in terms of cell loss probability for real-time traffic. The simulation source program has also been verified using existing queueing theories, and the Paired-t Confidence Interval method with satisfactory results at 99% confidence level.
Show less
Date Issued: 1993
PURL: http://purl.flvc.org/fcla/dt/12336
Subject Headings: Integrated services digital networks, Broadband communications systems, Packet switching (Data transmission), Computer networks--Management
Format: Document (PDF)

Title: An advanced intelligent network: Description and performance evaluation.
Creator: Kadioglu, Ceri., Florida Atlantic University, Ilyas, Mohammad, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: An Advanced Intelligent Network (AIN) is described and its performance is evaluated in this thesis. First, the AIN architecture is presented. This is followed by the description of the operation and the creation of the telephone services in the AIN architecture. Finally, the AIN architecture is evaluated on the performance of the user-network interface and the network elements, and the expandability and cost effectiveness of the architecture. The result of the evaluation shows that the...
Show moreAn Advanced Intelligent Network (AIN) is described and its performance is evaluated in this thesis. First, the AIN architecture is presented. This is followed by the description of the operation and the creation of the telephone services in the AIN architecture. Finally, the AIN architecture is evaluated on the performance of the user-network interface and the network elements, and the expandability and cost effectiveness of the architecture. The result of the evaluation shows that the operation of the telephone services in the AIN architecture are acceptable according to the standards set by Bellcore. Therefore, the AIN architecture meets the objectives set by the telephone operating companies and provides a basis for faster development and deployment of new telephone services in a cost effective manner.
Show less
Date Issued: 1991
PURL: http://purl.flvc.org/fcla/dt/14688
Subject Headings: Telecommunication systems, Telephone systems, Data transmission systems
Format: Document (PDF)

Title: A high-speed switching node architecture for ATM networks.
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: This research is aimed towards the concept of a new switching node architecture for cell-switched Asynchronous Transfer Mode (ATM) networks. The proposed architecture has several distinguishing features when compared with existing Banyan based switching node. It has a cylindrical structure as opposed to a flat structure as found in Banyans. The wrap around property results in better link utilization as compared with existing Banyans beside resulting in reduced average route length. Simplified...
Show moreThis research is aimed towards the concept of a new switching node architecture for cell-switched Asynchronous Transfer Mode (ATM) networks. The proposed architecture has several distinguishing features when compared with existing Banyan based switching node. It has a cylindrical structure as opposed to a flat structure as found in Banyans. The wrap around property results in better link utilization as compared with existing Banyans beside resulting in reduced average route length. Simplified digit controlled routing is maintained as found in Banyans. The cylindrical nature of the architecture, results in pipeline activity. Such architecture tends to sort the traffic to a higher address, eliminating the need of a preprocessing node as a front end processing node. Approximate Markov chain analyses for the performance of the switching node with single input buffers is presented. The analyses are used to compute the time delay distribution of a cell leaving the node. A simulation tool is used to validate the analytical model. The simulation model is free from the critical assumptions which are necessary to develop the analytical model. It is shown that the analytical results closely match with the simulation results. This confirms the authenticity of the simulation model. We then study the performance of the switching node for various input buffer sizes. Low throughput with single input buffered switching node is observed; however, as the buffer size is increased from two to three the increase in throughput is more than 100%. No appreciable increase in node delay is noted when the buffer size is increased from two to three. We conclude that the optimum buffer size for large throughput is three and the maximum throughput with offered load of 0.9 and buffer size three is 0.75. This is because of head of line blocking phenomenon. A technique to overcome such inherent problem is presented. Several delays which a cell faces are analyzed and summarized below. The wait delay with buffer sizes one and two is high. However, the wait delay is negligible when the buffer size is increased beyond two. This is because increasing the buffer size reduces the head of line blocking. Thus more cells can move forward. Node delay and switched delay are comparable when the buffer size is greater than two. The delay offered is within a threshold range as noted for real time traffic. The delay is clock rate dependent and can be minimized by running the switching node at a higher clock speed. The worst delay noted for a switched cell for a node operating at a clock rate of 200 Mhz is 0.5 usec.
Show less
Date Issued: 1992
PURL: http://purl.flvc.org/fcla/dt/12309
Subject Headings: Computer networks, Computer architecture, Packet switching (Data transmission)
Format: Document (PDF)

Title: MULTI-LEVEL FLOW CONTROL IN COMPUTER NETWORKS (SIMULATION).
Creator: ROY, KAUSHIK., Florida Atlantic University, Ilyas, Mohammad, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: Several different flow control methods for computer communications networks have been analyzed in this thesis. Isarithmic, end-to-end, and link level flow control have been dealt with in detail. A simulation program has been written to compare the performance of these flow control techniques. It has been found that the system performance of computer networks degrades at high values of data traffic when no flow control is implemented. This is due to congestion and buffer overflow problem. One...
Show moreSeveral different flow control methods for computer communications networks have been analyzed in this thesis. Isarithmic, end-to-end, and link level flow control have been dealt with in detail. A simulation program has been written to compare the performance of these flow control techniques. It has been found that the system performance of computer networks degrades at high values of data traffic when no flow control is implemented. This is due to congestion and buffer overflow problem. One flow control technique when implemented alone does not generally produce optimal results. A judicious mixture of several flow control techniques should be implemented together so as to get the desired throughput and delay performance in a computer communication network. The simulation program is quite versatile. It uses the eventscheduling method for faster computation. Several simulation results have been presented to illustrate the effects of multi-level flow on delay and throughput performance of a network under different traffic load conditions.
Show less
Date Issued: 1985
PURL: http://purl.flvc.org/fcla/dt/14286
Subject Headings: Computer networks--Testing, Computer networks--Evaluation
Format: Document (PDF)

Title: Mobility management in voice over IP networks.
Creator: Sugunan, Shiby., Florida Atlantic University, Ilyas, Mohammad, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: Wireless Internet access has recently gained significant attention as wireless/mobile communications and networking become widespread. Voice over IP service is likely to play a key role in the convergence of IP based Internet and mobile cellular networks. The mobility management performance for Mobile IP and Session Initiation Protocol is the focus of this thesis. After illustrating the operation of the protocols, the discrete event simulator, Network Simulator 2 (ns2), is used to compare the...
Show moreWireless Internet access has recently gained significant attention as wireless/mobile communications and networking become widespread. Voice over IP service is likely to play a key role in the convergence of IP based Internet and mobile cellular networks. The mobility management performance for Mobile IP and Session Initiation Protocol is the focus of this thesis. After illustrating the operation of the protocols, the discrete event simulator, Network Simulator 2 (ns2), is used to compare the performance of the two protocols. The comparison of the protocols is done by comparing average end-to-end delay and the ratio of the number of packets received to the number of packets originally sent (Packet Delivery Fraction). The impact of mobility is analyzed by studying the performance of the protocols, for various mobility scenarios. The effect of an increase in the number of nodes and increase in velocity of the mobile node on the performance of the Mobile IP and SIP is compared. The performance of the Mobile IP and SIP is compared by measuring the performance metrics of the two protocols for similar simulations. The results obtained as a result of the simulations leads us to some interesting conclusions.
Show less
Date Issued: 2004
PURL: http://purl.flvc.org/fcla/dt/13113
Subject Headings: Internet telephony, Wireless Internet, Mobile computing, TCP/IP (Computer network protocol)
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 study on ATM multiplexing and threshold-based connection admission control in connection-oriented packet networks.
Creator: Yuan, Xiaohong., Florida Atlantic University, Ilyas, Mohammad, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: The research reported in this dissertation studies ATM multiplexing and connection admission control schemes for traffic management in connection-oriented packet networks. A new threshold-based connection admission control scheme is proposed and analyzed. The scheme uses effective bandwidth to make decision whether to accept or reject the connection request. This threshold specified effective-bandwidth method is first simulated on a simple 4-node connection-oriented packet network model, and...
Show moreThe research reported in this dissertation studies ATM multiplexing and connection admission control schemes for traffic management in connection-oriented packet networks. A new threshold-based connection admission control scheme is proposed and analyzed. The scheme uses effective bandwidth to make decision whether to accept or reject the connection request. This threshold specified effective-bandwidth method is first simulated on a simple 4-node connection-oriented packet network model, and then extended to a more complex 8-node network model under a variety of environments. To reduce the cell-loss ratio when the arrival rates of the connection requests are large, the dynamic effective bandwidth mechanism is proposed and relevant simulations are addressed on the two network models. The traffic used in the simulation is a multiplexed stream of cells from video, voice and data sources, which is typical in ATM environments. The multiplexed traffic is generated using a discrete event scheduling method. The simulation programs for the 4-node network model and for the 8-node network model are verified by the theoretical values of the blocking probabilities of the connection requests, and Little's Theorem. Simulations on the two network models show similar results. Pertinent to a network that supplying several service categories, the threshold-based connection admission control is shown to affect the blocking probabilities of each type of traffic. In some environments, having a threshold is advantageous over the case without a threshold in terms of cell-loss ratio, cell transfer delay and power (throughput divided by cell transfer delay). The simulation results also show that the dynamic effective bandwidth based method helps to reduce the cell-loss ratio significantly when the arrival rates of the connection requests are large.
Show less
Date Issued: 2000
PURL: http://purl.flvc.org/fcla/dt/12647
Subject Headings: Asynchronous transfer mode, Packet switching (Data transmission), Telecommunication--Traffic
Format: Document (PDF)

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: A unified end-to-end priority strategy for traffic control in an ATM-based broadband ISDN.
Creator: Bemmel, Vincent Egbert., Florida Atlantic University, Ilyas, Mohammad, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: In order to guarantee a committed Quality of Service (QoS) to the users of a Broadband Integrated Services Digital Network (B-ISDN), preventive congestion control becomes critical, and is implemented through Call Acceptance Control (CAC) and Usage Parameter Control (UPC) functions. Currently, Asynchronous Transfer Mode (ATM) cells are equipped with a 1-bit Cell Loss Priority (CLP) field, which can be used for service-oriented and/or UPC marking. This creates a conflict, since these two...
Show moreIn order to guarantee a committed Quality of Service (QoS) to the users of a Broadband Integrated Services Digital Network (B-ISDN), preventive congestion control becomes critical, and is implemented through Call Acceptance Control (CAC) and Usage Parameter Control (UPC) functions. Currently, Asynchronous Transfer Mode (ATM) cells are equipped with a 1-bit Cell Loss Priority (CLP) field, which can be used for service-oriented and/or UPC marking. This creates a conflict, since these two marking approaches may have contradicting objectives, and are designed to operate independently. Moreover, by admitting excessive cells as marked traffic, this group is allowed to grow uncontrollably, thereby jeopardizing the QoS committed to other marked cells. This dissertation presents a solution to these problems by proposing a new 4-class priority strategy that unifies the two marking approaches, and is based on a 2-bit CLP field. The impacts of the new priority scheme are triple-fold: (I) For the UPC, a new scheme, the Forgiving Leaky Bucket (FLB), not only carries priorities through subnetwork boundaries, but also has the power of unmarking, i.e. forgiving, previously marked cells, depending on the bandwidth availability in the entering subnetwork. Forgiving will correct access-point bias, a phenomenon observed in internetworked ATM subnetworks of different congestion conditions. (II) At ATM switching nodes, a new space priority scheme is based on a hybrid of the Nested Threshold, and Push-Out cell discarding methods. This scheme is designed for the 4-class priority strategy, and improves the quality of the low priority traffic. (III) In interfacing High Speed Local Area Networks and Metropolitan Area Networks, idle bandwidth due to STM multiplexing is utilized to carry marked excessive cells of connection-oriented variable bit rate traffic, in addition to the service-oriented marking performed at transmitting stations. The resulting stream is then carried through internetworking points, subject to FLB adjustments. As a result, the STM and ATM subnetworks will support a uniform end-to-end priority strategy, essential for a B-ISDN. The proposed impacts are analyzed and compared with conventional implementations, and future directions are indicated.
Show less
Date Issued: 1993
PURL: http://purl.flvc.org/fcla/dt/12334
Subject Headings: Integrated services digital networks, Broadband communication systems, Computer networks--Management, Packet switching (Data transmission)
Format: Document (PDF)

Title: A quality of service analysis of CDMA-based AODV routing protocol for ad-hoc wireless networks.
Creator: Qureshi, Basit Iqbal., Florida Atlantic University, Ilyas, Mohammad, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: Ad-hoc wireless networks are the networks without an infrastructure. Infrastructure-less mobile networks have no fixed routers or base stations. All nodes in these networks are capable of movement and can be connected dynamically at any time. The issue of routing packets effectively between any nodes in an ad-hoc network is a challenging task. A path that was considered optimal at a given time point may not be working after a few moments. Moreover the bandwidth available between a link may...
Show moreAd-hoc wireless networks are the networks without an infrastructure. Infrastructure-less mobile networks have no fixed routers or base stations. All nodes in these networks are capable of movement and can be connected dynamically at any time. The issue of routing packets effectively between any nodes in an ad-hoc network is a challenging task. A path that was considered optimal at a given time point may not be working after a few moments. Moreover the bandwidth available between a link may not remain the same since every node in this kind of network is behaving as a router and may experience drastical increase in throughput and traffic load. For the purpose of quality of communication, bandwidth reservation within ad-hoc wireless network nodes may prove promising as a solution to this problem. This thesis presents an approach to reserve bandwidth available utilizing CDMA of bandwidth to the Ad-hoc Distance Vector Protocol for the ad-hoc wireless networks. Various quality of service issues are discussed and are tested for optimal performance for AODV routing protocol. A QoS performance comparison based on mobility, congestion and throughput is made between AODV and CDMA based AODV mobile routing protocols.
Show less
Date Issued: 2002
PURL: http://purl.flvc.org/fcla/dt/12895
Subject Headings: Code division multiple access, Wireless communication systems, Packet switching (Data transmission)
Format: Document (PDF)

Title: Simulation-based performance evaluation of AODV routing protocol for ad hoc mobile wireless networks.
Creator: Suryaprasad, Deepa., Florida Atlantic University, Ilyas, Mohammad, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: An ad hoc wireless network is a network composed of mobile communication devices, which is designed to provide communication capability to satisfy the need of a temporary nature in an infrastructure-less environment. A routing protocol is necessary in ad hoc networks to ensure effective communication among nodes. This thesis presents a simulation-based study on the performance evaluation of Ad hoc on-demand distance vector (AODV) routing protocol, which is one of the core routing protocols...
Show moreAn ad hoc wireless network is a network composed of mobile communication devices, which is designed to provide communication capability to satisfy the need of a temporary nature in an infrastructure-less environment. A routing protocol is necessary in ad hoc networks to ensure effective communication among nodes. This thesis presents a simulation-based study on the performance evaluation of Ad hoc on-demand distance vector (AODV) routing protocol, which is one of the core routing protocols being promoted by the Mobile Ad Hoc Networking (MANET) group of the Internet Engineering Task Force. An event-advanced simulation program was developed in C++ to simulate the ad hoc wireless network implementing the AODV protocol. The performance metrics evaluated were throughput, average delay, route acquisition time and routing overhead. The network traffic was monitored in terms of the data packets created and successfully delivered within the simulation time. A discussion on the effect of different network parameters such as the mobility of the nodes, the number of nodes in the network, the size of the network and the data packet size on the performance characteristics of AODV protocol is also presented.
Show less
Date Issued: 2003
PURL: http://purl.flvc.org/fcla/dt/12989
Subject Headings: Computer network protocols, Wireless communication systems
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: ENHANCING IOT DEVICES SECURITY: ENSEMBLE LEARNING WITH CLASSICAL APPROACHES FOR INTRUSION DETECTION SYSTEM.
Creator: Alotaibi, Yazeed, Ilyas, Mohammad, Florida Atlantic University, Department of Computer and Electrical Engineering and Computer Science, College of Engineering and Computer Science
Abstract/Description: The Internet of Things (IoT) refers to a network of interconnected nodes constantly engaged in communication, data exchange, and the utilization of various network protocols. Previous research has demonstrated that IoT devices are highly susceptible to cyber-attacks, posing a significant threat to data security. This vulnerability is primarily attributed to their susceptibility to exploitation and their resource constraints. To counter these threats, Intrusion Detection Systems (IDS) are...
Show moreThe Internet of Things (IoT) refers to a network of interconnected nodes constantly engaged in communication, data exchange, and the utilization of various network protocols. Previous research has demonstrated that IoT devices are highly susceptible to cyber-attacks, posing a significant threat to data security. This vulnerability is primarily attributed to their susceptibility to exploitation and their resource constraints. To counter these threats, Intrusion Detection Systems (IDS) are employed. This study aims to contribute to the field by enhancing IDS detection efficiency through the integration of Ensemble Learning (EL) methods with traditional Machine Learning (ML) and deep learning (DL) models. To bolster IDS performance, we initially utilize a binary ML classification approach to classify IoT network traffic as either normal or abnormal, employing EL methods such as Stacking and Voting. Once this binary ML model exhibits high detection rates, we extend our approach by incorporating a ML multi-class framework to classify attack types. This further enhances IDS performance by implementing the same Ensemble Learning methods. Additionally, for further enhancement and evaluation of the intrusion detection system, we employ DL methods, leveraging deep learning techniques, ensemble feature selections, and ensemble methods. Our DL approach is designed to classify IoT network traffic. This comprehensive approach encompasses various supervised ML, and DL algorithms with ensemble methods. The proposed models are trained on TON-IoT network traffic datasets. The ensemble approaches are evaluated using a comprehensive metrics and compared for their effectiveness in addressing this classification tasks. The ensemble classifiers achieved higher accuracy rates compared to individual models, a result attributed to the diversity of learning mechanisms and strengths harnessed through ensemble learning. By combining these strategies, we successfully improved prediction accuracy while minimizing classification errors. The outcomes of these methodologies underscore their potential to significantly enhance the effectiveness of the Intrusion Detection System.
Show less
Date Issued: 2023
PURL: http://purl.flvc.org/fau/fd/FA00014304
Subject Headings: Internet of things, Intrusion detection systems (Computer security), Machine learning
Format: Document (PDF)

Computer network protocols (9)	+ -
Integrated services digital networks (9)	+ -
Computer networks (8)	+ -
Local area networks (Computer networks) (7)	+ -
Packet switching (Data transmission) (6)	+ -

Asynchronous transfer mode (5)	+ -
Data transmission systems (5)	+ -
Wireless communication systems (5)	+ -
Computer network architectures (4)	+ -
Mobile computing (4)	+ -
Broadband communication systems (3)	+ -
Computer networks--Management (3)	+ -
Telecommunication--Traffic (3)	+ -
Bluetooth technology (2)	+ -
Broadband communications systems (2)	+ -
Computer architecture (2)	+ -
Deep learning (Machine learning) (2)	+ -
IBM Token-Ring Network (Local area network system) (2)	+ -
Internet of things (2)	+ -
Internetworking (Telecommunication) (2)	+ -
Intrusion detection systems (Computer security) (2)	+ -
Metropolitan area networks (Computer networks) (2)	+ -
Acknowledgements (1)	+ -
Artificial intelligence (1)	+ -
Artificial satellites in telecommunication (1)	+ -
Cellular telephone systems (1)	+ -
Code division multiple access (1)	+ -
Computer algorithms (1)	+ -
Computer interfaces (1)	+ -
Computer networks -- Technological innovations (1)	+ -

Florida Atlantic University (51)	+ -
Ilyas, Mohammad (51)	+ -
College of Engineering and Computer Science (36)	+ -
Department of Computer and Electrical Engineering and Computer Science (36)	+ -
Hsu, Sam (3)	+ -

Mahgoub, Imad (2)	+ -
Syed, Majid Ali (2)	+ -
AL-Ghanem, Waleed Khalid (1)	+ -
Ahson, Syed Alamdar. (1)	+ -
AlFadhel, Fahad A. (1)	+ -
Alanazi, Munid (1)	+ -
Alotaibi, Yazeed (1)	+ -
Alrefaei, Ahmed (1)	+ -
Anderson, James M. (1)	+ -
BALACHANDRAN, CHITRA. (1)	+ -
Bansal, Atul. (1)	+ -
Bemmel, Vincent Egbert. (1)	+ -
Bogotch, Ira (1)	+ -
Bothra, Piyush. (1)	+ -
Chauhan, Sanjeev Birbal. (1)	+ -
Choi, Kwok K. (1)	+ -
Chokshi, Patheek G. (1)	+ -
College of Education (1)	+ -
DA RE, MARIA. (1)	+ -
Department of Educational Leadership and Research Methodology (1)	+ -
Ehley, Lynnae Anne. (1)	+ -
Eskamaei, Mehdi. (1)	+ -
Frost, Sandra Lynn. (1)	+ -
Furht, Borko (1)	+ -
HUYNH, LAP THIET. (1)	+ -

Search In

Pages

Pages

Sort Results By:

Narrow results by:

Collection

Topical Subject

Genre

Type of Resource

Language

Creator

Format

Owner