Current Search:  Computer networks--Management (x)

View All Items

  • CSV Spreadsheet
(1 - 6 of 6)
Integration of dissimilar network management systems
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)
Active networking and innovation: An evaluation of active networking as a driver of accelerated Internet innovation
Title
Active networking and innovation: An evaluation of active networking as a driver of accelerated Internet innovation.
Creator
Wood, James L., Florida Atlantic University, Wu, Jie, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description
Innovation has flourished at the edge of the Internet; however, the core has experienced a slower pace of innovation. This lag is impacting the pace of innovation at the edge and threatening quality as ad hoc solutions are implemented to overcome core network barriers to innovation. Active networking technology, which opens up the architecture of routers, is proposed as a standard solution. Researchers draw an analogy to the computer industry where innovation is claimed to be accelerated by...
Show moreInnovation has flourished at the edge of the Internet; however, the core has experienced a slower pace of innovation. This lag is impacting the pace of innovation at the edge and threatening quality as ad hoc solutions are implemented to overcome core network barriers to innovation. Active networking technology, which opens up the architecture of routers, is proposed as a standard solution. Researchers draw an analogy to the computer industry where innovation is claimed to be accelerated by modularization. This argument is valid to the extent that the router market is similar to the computer market; however, contemporary innovation theories cast doubt on this likelihood. These theories indicate that for active networking technology to accelerate Internet innovation, extraordinary measures will be required to break the status quo. This paper analyzes this situation and makes recommendations, based on innovation theory, on how active networking can be successful in accelerating Internet innovation.
Show less
Date Issued
2004
PURL
http://purl.flvc.org/fcla/dt/13161
Subject Headings
Computer industry--Technological innovations, Computer networks--Management, Computer networks--Software, Routers (Computer networks), Internetworking (Telecommunication)
Format
Document (PDF)
YACAD: Yet Another Congestion Avoidance Design for ATM-based networks
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)
unified end-to-end priority strategy for traffic control in an ATM-based broadband ISDN
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)
Context-aware hybrid data dissemination in vehicular networks
Title
Context-aware hybrid data dissemination in vehicular networks.
Creator
Rathod, Monika M., Mahgoub, Imad, Florida Atlantic University, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description
This work presents the development of the Context-Aware Hybrid Data Dissemination protocol for vehicular networks. The importance of developing vehicular networking data dissemination protocols is exemplified by the recent announcement by the U.S. Department of Transportation (DOT) National Highway Traffic Safety Administration (NHTSA) to enable vehicle-to-vehicle (V2V) communication technology. With emphasis on safety, other useful applications of V2V communication include but are not...
Show moreThis work presents the development of the Context-Aware Hybrid Data Dissemination protocol for vehicular networks. The importance of developing vehicular networking data dissemination protocols is exemplified by the recent announcement by the U.S. Department of Transportation (DOT) National Highway Traffic Safety Administration (NHTSA) to enable vehicle-to-vehicle (V2V) communication technology. With emphasis on safety, other useful applications of V2V communication include but are not limited to traffic and routing, weather, construction and road hazard alerts, as well as advertisement and entertainment. The core of V2V communication relies on the efficient dispersion of relevant data through wireless broadcast protocols for these varied applications. The challenges of vehicular networks demand an adaptive broadcast protocol capable of handling diverse applications. This research work illustrates the design of a wireless broadcast protocol that is context-aware and adaptive to vehicular environments taking into consideration vehicle density, road topology, and type of data to be disseminated. The context-aware hybrid data dissemination scheme combines store-and-forward and multi-hop broadcasts, capitalizing on the strengths of both these categories and mitigates the weaknesses to deliver data with maximum efficiency to a widest possible reach. This protocol is designed to work in both urban and highway mobility models. The behavior and performance of the hybrid data dissemination scheme is studied by varying the broadcast zone radius, aggregation ratio, data message size and frequency of the broadcast messages. Optimal parameters are determined and the protocol is then formulated to become adaptive to node density by keeping the field size constant and increasing the number of nodes. Adding message priority levels to propagate safety messages faster and farther than non-safety related messages is the next context we add to our adaptive protocol. We dynamically set the broadcast region to use multi-hop which has lower latency to propagate safety-related messages. Extensive simulation results have been obtained using realistic vehicular network scenarios. Results show that Context-Aware Hybrid Data Dissemination Protocol benefits from the low latency characteristics of multi-hop broadcast and low bandwidth consumption of store-and-forward. The protocol is adaptive to both urban and highway mobility models.
Show less
Date Issued
2014
PURL
http://purl.flvc.org/fau/fd/FA00004152, http://purl.flvc.org/fau/fd/FA00004152
Subject Headings
Context aware computing, Convergence (Telecommunication), Intelligent transportation systems, Internetworking (Telecommunication), Routing (Computer network management), Routing protocols (Computer network protocols), Vehicular ad hoc networks (Computer networks)
Format
Document (PDF)
Reliable Vehicle-to-Vehicle Weighted Localization in Vehicular Networks
Title
Reliable Vehicle-to-Vehicle Weighted Localization in Vehicular Networks.
Creator
Altoaimy, Lina, Mahgoub, Imad, Florida Atlantic University, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description
Vehicular Ad Hoc Network (VANET) supports wireless communication among vehicles using vehicle-to-vehicle (V2V) communication and between vehicles and infrastructure using vehicle-to-infrastructure (V2I) communication. This communication can be utilized to allow the distribution of safety and non-safety messages in the network. VANET supports a wide range of applications which rely on the messages exchanged within the network. Such applications will enhance the drivers' consciousness and...
Show moreVehicular Ad Hoc Network (VANET) supports wireless communication among vehicles using vehicle-to-vehicle (V2V) communication and between vehicles and infrastructure using vehicle-to-infrastructure (V2I) communication. This communication can be utilized to allow the distribution of safety and non-safety messages in the network. VANET supports a wide range of applications which rely on the messages exchanged within the network. Such applications will enhance the drivers' consciousness and improve their driving experience. However, the efficiency of these applications depends on the availability of vehicles real-time location information. A number of methods have been proposed to fulfill this requirement. However, designing a V2V-based localization method is challenged by the high mobility and dynamic topology of VANET and the interference noise due to objects and buildings. Currently, vehicle localization is based on GPS technology, which is not always reliable. Therefore, utilizing V2V communication in VANET can enhance the GPS positioning. With V2V-based localization, vehicles can determine their locations by exchanging mobility data among neighboring vehicles. In this research work, we address the above challenges and design a realistic V2V-based localization method that extends the centroid localization (CL) by assigning a weight value to each neighboring vehicle. This weight value is obtained using a weighting function that utilizes the following factors: 1) link quality distance between the neighboring vehicles 2) heading information and 3) map information. We also use fuzzy logic to model neighboring vehicles' weight values. Due to the sensitivity and importance of the exchanged information, it is very critical to ensure its integrity and reliability. Therefore, in this work, we present the design and the integration of a mobility data verification component into the proposed localization method, so that only verified data from trusted neighboring vehicles are considered. We also use subjective logic to design a trust management system to evaluate the trustworthiness of neighboring vehicles based on the formulated subjective opinions. Extensive experimental work is conducted using simulation programs to evaluate the performance of the proposed methods. The results show improvement on the location accuracy for varying vehicle densities and transmission ranges as well as in the presence of malicious/untrusted neighboring vehicles.
Show less
Date Issued
2016
PURL
http://purl.flvc.org/fau/fd/FA00004564, http://purl.flvc.org/fau/fd/FA00004564
Subject Headings
Vehicular ad hoc networks (Computer networks)--Mathematical models., Computer communication systems., Wireless communication systems., Routing (Computer network management), Intelligent transportation systems., Intelligent control systems.
Format
Document (PDF)