View All Items

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)

Title: Using classification and regression tree to detect hematology abnormalities.
Creator: Qian, Cheng., Florida Atlantic University, Wu, Jie, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: The detection of the abnormal blood cells and particles in a blood test is essential in medical diagnosis. The detection rules, which are usually implemented in the widely used automated hematology analyzer, are therefore critical for the health and even lives of millions of people. The research endeavor of this thesis is on generating such detection rules using a supervised machine learning algorithm. The first part of this thesis studies the hematology data and surveys the popular...
Show moreThe detection of the abnormal blood cells and particles in a blood test is essential in medical diagnosis. The detection rules, which are usually implemented in the widely used automated hematology analyzer, are therefore critical for the health and even lives of millions of people. The research endeavor of this thesis is on generating such detection rules using a supervised machine learning algorithm. The first part of this thesis studies the hematology data and surveys the popular classification algorithms. In the second part, the selected algorithm, CART, is implemented with deliberately selected parameters. In the third part, a modification of the algorithm, logical pruning with Enclose the Normal principle, is exercised. To extend the algorithm and to achieve better performance, I developed and implemented the idea of decision tree combinations. The research has proven to be successful by the achievement of good performance and reasonable detection rules.
Show less
Date Issued: 2004
PURL: http://purl.flvc.org/fcla/dt/13189
Subject Headings: Regression analysis, Health survey--Statistical methods, Medical statistics, Blood--Diseases--Diagnosis, Hematology, Blood--Examination
Format: Document (PDF)

Title: XYZ: A scalable, partially centralized lookup service for large-scale peer-to-peer systems.
Creator: Zhang, Jianying., Florida Atlantic University, Wu, Jie, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: Peer-to-Peer (P2P) systems are characterized by direct access between peer computers, rather than through a centralized server. File sharing is the dominant P2P application on the Internet, allowing users to easily contribute, search and obtain content. The objective of this thesis was to design XYZ, a partially centralized, scalable and self-organizing lookup service for wide area P2P systems. The XYZ system is based on distributed hash table (DHT). A unique ID and a color assigned to each...
Show morePeer-to-Peer (P2P) systems are characterized by direct access between peer computers, rather than through a centralized server. File sharing is the dominant P2P application on the Internet, allowing users to easily contribute, search and obtain content. The objective of this thesis was to design XYZ, a partially centralized, scalable and self-organizing lookup service for wide area P2P systems. The XYZ system is based on distributed hash table (DHT). A unique ID and a color assigned to each node and each file. The author uses clustering method to create the system backbone by connecting the cluster heads together and uses color clustering method to create color overlays. Any lookup for a file with a color will only be forwarded in the color overlay with the same color so that the searching space is minimized. Simulations and analysis are also provided in this thesis.
Show less
Date Issued: 2005
PURL: http://purl.flvc.org/fcla/dt/13263
Subject Headings: Wireless communication systems, Peer-to-peer architecture (Computer networks), Computational grids (Computer systems)
Format: Document (PDF)

Title: Label routing protocol: A new cross-layer protocol for multi-hop ad hoc wireless network.
Creator: Wang, Yu., Florida Atlantic University, Wu, Jie, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: Compared to the traditional wireless network, the multi-hop ad hoc wireless network (simply called ad hoc networks) is self-configurable, dynamic, and distributed. During the past few years, many routing protocols have been proposed for this particular network environment. While in wired and optical networks, multi-protocol label switching (MPLS) has clearly shown its advantages in routing and switching such as flexibility, high efficiency, scalability, and low cost, however MPLS is complex...
Show moreCompared to the traditional wireless network, the multi-hop ad hoc wireless network (simply called ad hoc networks) is self-configurable, dynamic, and distributed. During the past few years, many routing protocols have been proposed for this particular network environment. While in wired and optical networks, multi-protocol label switching (MPLS) has clearly shown its advantages in routing and switching such as flexibility, high efficiency, scalability, and low cost, however MPLS is complex and does not consider the mobility issue for wireless networks, especially for ad hoc networks. This thesis migrates the label concept into the ad hoc network and provides a framework for the efficient Label Routing Protocol (LRP) in such a network. The MAC layer is also optimized with LRP for shorter delay, power saving, and higher efficiency. The simulation results show that the delay is improved significantly with this cross-layer routing protocol.
Show less
Date Issued: 2006
PURL: http://purl.flvc.org/fcla/dt/13321
Subject Headings: Computer network protocols, Wireless communication systems, Mobile computing, Computer algorithms, MPLS standard, Operating systems (Computers)
Format: Document (PDF)

Title: Quorum based IP autoconfiguration in mobile ad hoc networks.
Creator: Xu, Tinghui., Florida Atlantic University, Wu, Jie, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: IP address autoconfiguration poses a challenge for mobile ad-hoc networks (MANETs) because it has to be done to ensure correct routing. An IP autoconfiguration protocol that is based on quorum voting is proposed. Nodes are distributed configured when a write quorum can be collected. Making the compromise between message overhead and data consistency, quorum voting enforces data consistency by ensuring fresh read on every access so that each node is configured with a unique IP address. The...
Show moreIP address autoconfiguration poses a challenge for mobile ad-hoc networks (MANETs) because it has to be done to ensure correct routing. An IP autoconfiguration protocol that is based on quorum voting is proposed. Nodes are distributed configured when a write quorum can be collected. Making the compromise between message overhead and data consistency, quorum voting enforces data consistency by ensuring fresh read on every access so that each node is configured with a unique IP address. The protocol is scalable since the configuration information is maintained locally and no central server is involved. Extensive experiments are carried out comparing the configuration latency, message overhead and address reclamation cost between our protocol and existing stateful protocols. The simulation results show that nodes are configured in lower latency and the message overhead for maintaining the network is fairly low. Moreover, the proposed protocol greatly enhances the address availability by keeping proper redundancy.
Show less
Date Issued: 2006
PURL: http://purl.flvc.org/fcla/dt/13362
Subject Headings: TCP/IP (Computer network protocol), Computer network architectures, Mobile communication systems, Wireless communication systems
Format: Document (PDF)

Title: A class-based search system in unstructured peer-to-peer networks.
Creator: Huang, Juncheng., Florida Atlantic University, Wu, Jie
Abstract/Description: Efficient searching is one of the important design issues in peer-to-peer (P2P) networks. Among various searching techniques, semantic-based searching has drawn significant attention recently. Gnutella-like efficient searching system (GES) [29] is such a system. GES derives node vector , a semantic summary of all documents on a node based on vector space model (VSM). The node-based topology adaptation algorithm and search protocol are then discussed. However, when there are many categories of...
Show moreEfficient searching is one of the important design issues in peer-to-peer (P2P) networks. Among various searching techniques, semantic-based searching has drawn significant attention recently. Gnutella-like efficient searching system (GES) [29] is such a system. GES derives node vector , a semantic summary of all documents on a node based on vector space model (VSM). The node-based topology adaptation algorithm and search protocol are then discussed. However, when there are many categories of documents at each node, the node vector representation may be inaccurate. We extend the idea of GES and present a class-based search system (CSS). It makes use of a document clustering algorithm: OSKM [27] to cluster all documents on a node into several classes. Each class can be viewed as a virtual node. As a result, class vector replaces node vector and plays an important role in class-based topology adaptation and search process, which makes CSS very efficient. Our simulation demonstrates that CSS outperforms GES.
Show less
Date Issued: 2006
PURL: http://purl.flvc.org/fcla/dt/13367
Subject Headings: Peer-to-peer architecture (Computer networks), Management information systems, Computer security, Cascading style sheets, Web sites--Design
Format: Document (PDF)

Title: Reputation-based system for encouraging cooperation of nodes in mobile ad hoc networks.
Creator: Anantvalee, Tiranuch., Florida Atlantic University, Wu, Jie
Abstract/Description: In a mobile ad hoc network, node cooperation in packet forwarding is required for the network to function properly. However, since nodes in this network usually have limited resources, some selfish nodes might intend not to forward packets to save resources for their own use. To discourage such behavior, we propose RMS, a reputation-based system, to detect selfish nodes and respond to them by showing that being cooperative will benefit there more than being selfish. We also detect, to some...
Show moreIn a mobile ad hoc network, node cooperation in packet forwarding is required for the network to function properly. However, since nodes in this network usually have limited resources, some selfish nodes might intend not to forward packets to save resources for their own use. To discourage such behavior, we propose RMS, a reputation-based system, to detect selfish nodes and respond to them by showing that being cooperative will benefit there more than being selfish. We also detect, to some degree, nodes who forward only the necessary amount of packets to avoid being detected as selfish. We introduce the use of a state model to decide what we should do or respond to nodes in each state. In addition, we introduce the use of a timing period to control when the reputation should be updated and to use as a timeout for each state. The simulation results show that RMS can identify selfish nodes and punish them accordingly, which provide selfish nodes with an incentive to behave more cooperatively.
Show less
Date Issued: 2006
PURL: http://purl.flvc.org/fcla/dt/13406
Subject Headings: Computer networks--Security measures, Wireless communication systems, Routers (Computer networks), Computer network architectures
Format: Document (PDF)

Title: Fault tolerant scheduling for multiprocessor systems.
Creator: Mahanthi, Gangadhar., Florida Atlantic University, Wu, Jie, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: In the last few years, it has become profound to achieve higher performance of computers by solely upgrading logic technology. This required a move to a parallel processing system or a multiprocessor system in order to build faster computer systems. The importance of multiprocessor systems is increasing due to many reasons, one of which is reliability. In a multiprocessor system, a number of tasks may concurrently exist. To operate the system efficiently, one must carefully schedule the tasks...
Show moreIn the last few years, it has become profound to achieve higher performance of computers by solely upgrading logic technology. This required a move to a parallel processing system or a multiprocessor system in order to build faster computer systems. The importance of multiprocessor systems is increasing due to many reasons, one of which is reliability. In a multiprocessor system, a number of tasks may concurrently exist. To operate the system efficiently, one must carefully schedule the tasks. This thesis proposes a set of algorithms to schedule these tasks exploiting the inherent redundancy of processors in a multiprocessor system. Also discussed are some reliability issues and application to different networks with some examples.
Show less
Date Issued: 1992
PURL: http://purl.flvc.org/fcla/dt/14822
Subject Headings: Multiprocessors, Fault-tolerant computing, Electronic digital computers--Reliability
Format: Document (PDF)

Title: Group structures in object-oriented database authorization.
Creator: Fernandez, Minjie Hua., Florida Atlantic University, Wu, Jie
Abstract/Description: When there are a large number and a variety of users in a system, the authorization rules for these users will become too difficult and cumbersome to maintain and the evaluation algorithm would not be efficient. Also, it is hard for security administrators to understand why a specific user is given a set of rights. In this thesis we develop group structures to solve these problems. Groups of users rather than individual users are subjects that receive access rights from the authorization...
Show moreWhen there are a large number and a variety of users in a system, the authorization rules for these users will become too difficult and cumbersome to maintain and the evaluation algorithm would not be efficient. Also, it is hard for security administrators to understand why a specific user is given a set of rights. In this thesis we develop group structures to solve these problems. Groups of users rather than individual users are subjects that receive access rights from the authorization system. We present structurings and primitives for user groups. Although they are presented in the context of an object-oriented database system they are general and could be applied to other data model, and even in operating systems.
Show less
Date Issued: 1992
PURL: http://purl.flvc.org/fcla/dt/14878
Subject Headings: Electronic data processing--Security measures, User interfaces (Computer systems)
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: Load balancing on multiprocessor systems.
Creator: More, Hemant B., Florida Atlantic University, Wu, Jie, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: The utilization of a multiprocessor system is enhanced when idle time of processors is reduced. Allocation of processes from overloaded processors to idle processors can balance the load on multiprocessor systems and increase system throughput by reducing the process execution time. This thesis presents a study of parameters, issues and existing algorithms related to load balancing. The performance of load balancing on hypercubes using three new algorithms is explored and analyzed. A new...
Show moreThe utilization of a multiprocessor system is enhanced when idle time of processors is reduced. Allocation of processes from overloaded processors to idle processors can balance the load on multiprocessor systems and increase system throughput by reducing the process execution time. This thesis presents a study of parameters, issues and existing algorithms related to load balancing. The performance of load balancing on hypercubes using three new algorithms is explored and analyzed. A new algorithm to balance load on hypercubes in the presence of link faults is presented and analyzed here. Another algorithm to balance load on hypercube systems containing faulty processors is proposed and studied. The applicability of load balancing to real life problems is demonstrated by showing that the execution of branch and bound problem on hypercubes speeds up when load balancing is used.
Show less
Date Issued: 1993
PURL: http://purl.flvc.org/fcla/dt/14957
Subject Headings: Hypercube networks (Computer networks), Multiprocessors, Fault-tolerant computing
Format: Document (PDF)

Title: Optimal planning of robot calibration experiments by genetic algorithms.
Creator: Huang, Weizhen., Florida Atlantic University, Wu, Jie
Abstract/Description: In this thesis work, techniques developed in the science of genetic computing is applied to solve the problem of planning a robot calibration experiment. Robot calibration is a process by the robot accuracy is enhanced through modification of its control software. The selection of robot measurement configurations is an important element in successfully completing a robot calibration experiment. A classical genetic algorithm is first customized for a type of robot measurement configuration...
Show moreIn this thesis work, techniques developed in the science of genetic computing is applied to solve the problem of planning a robot calibration experiment. Robot calibration is a process by the robot accuracy is enhanced through modification of its control software. The selection of robot measurement configurations is an important element in successfully completing a robot calibration experiment. A classical genetic algorithm is first customized for a type of robot measurement configuration selection problem in which the robot workspace constraints are defined in terms of robot joint limits. The genetic parameters are tuned in a systematic way to greatly enhance the performance of the algorithm. A recruit-oriented genetic algorithm is then proposed, together with new genetic operators. Examples are also given to illustrate the concepts of this new genetic algorithm. This new algorithm is aimed at solving another type of configuration selection problem, in which not all points in the robot workspace are measurable by an external measuring device. Extensive simulation studies are conducted for both classical and recruit-oriented genetic algorithms, to examine the effectiveness of these algorithms.
Show less
Date Issued: 1995
PURL: http://purl.flvc.org/fcla/dt/15186
Subject Headings: Genetic algorithms, Robots--Calibration, Combinatorial optimization
Format: Document (PDF)

Title: Enhanced Fibonacci Cubes.
Creator: Qian, Haifeng., Florida Atlantic University, Wu, Jie, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: We propose the enhanced Fibonacci cube (EFC), which is defined based on the sequence Fn = 2(n-2) + 2F(n-4). We study its topological properties, embeddings, applications, routings, VLSI/WSI implementations, and its extensions. Our results show that EFC retains many properties of the hypercube. It contains the Fibonacci cube (FC) and extended Fibonacci cube of the same order as subgraphs and maintains virtually all the desirable properties of FC. EFC is even better in some structural...
Show moreWe propose the enhanced Fibonacci cube (EFC), which is defined based on the sequence Fn = 2(n-2) + 2F(n-4). We study its topological properties, embeddings, applications, routings, VLSI/WSI implementations, and its extensions. Our results show that EFC retains many properties of the hypercube. It contains the Fibonacci cube (FC) and extended Fibonacci cube of the same order as subgraphs and maintains virtually all the desirable properties of FC. EFC is even better in some structural properties, embeddings, applications and VLSI designs than FC or hypercube. With EFC, there are more cubes with various structures and sizes for selection, and more backup cubes into which faulty hypercubes can be reconfigured, which alleviates the size limitation of the hypercube and results in a higher level of fault tolerance.
Show less
Date Issued: 1995
PURL: http://purl.flvc.org/fcla/dt/15196
Subject Headings: Integrated circuits--Very large scale integration, Hypercube networks (Computer networks), Algorithms, Fault-tolerant computing, Multiprocessors
Format: Document (PDF)

Title: Embedding binomial trees in faulty hypercube multiprocessors.
Creator: Luo, Yinqiu., Florida Atlantic University, Wu, Jie, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: We study the embedding of binomial trees with variable roots in faulty hypercubes. Based on novel embedding strategies, we propose three embedding algorithms with variable nodes as the root. The first algorithm can tolerate up to n - 1 faulty links, but the execution can be done within log2(n - 1) subcube splits. The second one can tolerate up to [(3(n - 1))\2] faulty links. The last one can tolerate up to [(3(n - 4))\2] faulty nodes.
Date Issued: 1996
PURL: http://purl.flvc.org/fcla/dt/15345
Subject Headings: Hypercube networks (Computer networks), Trees (Graph theory), Multiprocessors, Parallel processing (Electronic computers), Computer algorithms, Fault-tolerant computing, Embedded computer systems
Format: Document (PDF)

Title: The effect of compression of performance in a demand paging operating system.
Creator: Wynn, Allen Chester., Florida Atlantic University, Wu, Jie, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: In this thesis, we measure and analyze the effects of compression in a demand paging operating system. We first explore existing compression algorithms and page replacement policies currently in use. Then we examine the OS/2 operating system which is modified to include page-based compression. Software trace hooks are inserted into the operating system to determine the amount of time required to process a page fault for each type of page, e.g. non-compressed, compressed, zero-filled, and the...
Show moreIn this thesis, we measure and analyze the effects of compression in a demand paging operating system. We first explore existing compression algorithms and page replacement policies currently in use. Then we examine the OS/2 operating system which is modified to include page-based compression. Software trace hooks are inserted into the operating system to determine the amount of time required to process a page fault for each type of page, e.g. non-compressed, compressed, zero-filled, and the number of page faults for each type of page. Software trace measurements as well as physical timings are taken on a system without compressed pages and the same system with compressed pages. We find the system with compressed pages shows a slight increase in paging activity for memory constrained systems, but performance (time) is improved in both memory constrained and unconstrained systems.
Show less
Date Issued: 1997
PURL: http://purl.flvc.org/fcla/dt/15421
Subject Headings: Paging (Computer science), Data compression (Computer science), Operating systems (Computers)
Format: Document (PDF)

Title: Parallel algorithms for domain load balance.
Creator: Huang, Hao., Florida Atlantic University, Wu, Jie
Abstract/Description: To improve the performance of parallel/distributed systems, we propose four parallel load balance algorithms. The new partition algorithm achieves load balance among processors via domain partition. If we assume the problem domain is evenly load distributed, this algorithm will divide the whole domain into a required number of subdomains with the same area. If a problem domain has a dynamic load distribution, although the new partition algorithm is still suitable for the initial mapping, we...
Show moreTo improve the performance of parallel/distributed systems, we propose four parallel load balance algorithms. The new partition algorithm achieves load balance among processors via domain partition. If we assume the problem domain is evenly load distributed, this algorithm will divide the whole domain into a required number of subdomains with the same area. If a problem domain has a dynamic load distribution, although the new partition algorithm is still suitable for the initial mapping, we propose three dynamic load balance algorithms. These dynamic algorithms achieve load balance among processors by transferring load among processors. We applied the new partition algorithm to a specific domain and compared the method to some existing partition algorithms. We also simulated three dynamic load balance algorithms. Results of comparisons and simulations show that all the four algorithms have satisfactory performance.
Show less
Date Issued: 1997
PURL: http://purl.flvc.org/fcla/dt/15478
Subject Headings: Algorithms, Parallel processing (Electronic computers)
Format: Document (PDF)

Title: Checkpointing schemes for high-performance parallel applications in networks of workstations.
Creator: He, Fusen., Florida Atlantic University, Wu, Jie
Abstract/Description: In this thesis, a low interprocessor communication overhead and high performance data parallelism parallel application model in a network of workstations (NOWs) is proposed. Checkpointing and rollback technologies are used in this model for performance enhancement purpose. The proposed model is analyzed both theoretically and numerically. The simulation results show that a high performance of the parallel application model is expected. As a case study, the proposed model is used to the...
Show moreIn this thesis, a low interprocessor communication overhead and high performance data parallelism parallel application model in a network of workstations (NOWs) is proposed. Checkpointing and rollback technologies are used in this model for performance enhancement purpose. The proposed model is analyzed both theoretically and numerically. The simulation results show that a high performance of the parallel application model is expected. As a case study, the proposed model is used to the parallel Everglades Landscape Fire Model (ELFM) code which was developed by South Florida Water Management District (SFWMD). The parallel programming environment is Message-Passing Interface (MPI). A synchronous checkpointing and rollback mechanism is used to handle the spread of fire which is a dynamic and irregular component of the model. Results show that the performance of the parallel ELFM using MPI is significantly enhanced by the application of checkpointing and rollback.
Show less
Date Issued: 1998
PURL: http://purl.flvc.org/fcla/dt/15597
Subject Headings: Computer networks, Electronic data processing--Distributed processing, Fault-tolerant computing
Format: Document (PDF)

Title: Time-step optimal broadcasting in mesh networks with minimum total communication distance.
Creator: Cang, Songluan., Florida Atlantic University, Wu, Jie
Abstract/Description: We propose a new minimum total communication distance (TCD) algorithm and an optimal TCD algorithm for broadcast in a 2-dimensional mesh (2-D mesh). The former generates a minimum TCD from a given source node, and the latter guarantees a minimum TCD among all the possible source nodes. These algorithms are based on a divide-and-conquer approach where a 2-D mesh is partitioned into four submeshes of equal size. The source node sends the broadcast message to a special node called an eye in each...
Show moreWe propose a new minimum total communication distance (TCD) algorithm and an optimal TCD algorithm for broadcast in a 2-dimensional mesh (2-D mesh). The former generates a minimum TCD from a given source node, and the latter guarantees a minimum TCD among all the possible source nodes. These algorithms are based on a divide-and-conquer approach where a 2-D mesh is partitioned into four submeshes of equal size. The source node sends the broadcast message to a special node called an eye in each submesh. The above procedure is then recursively applied in each submesh. These algorithms are extended to a 3-dimensional mesh (3-D mesh), and are generalized to a d-dimensional mesh or torus. In addition, the proposed approach can potentially be used to solve optimization problems in other collective communication operations.
Show less
Date Issued: 1999
PURL: http://purl.flvc.org/fcla/dt/15647
Subject Headings: Computer algorithms, Parallel processing (Electronic computers), Computer architecture
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: Fault-tolerant routing in two-dimensional and three-dimensional meshes.
Creator: Chen, Xiao., Florida Atlantic University, Wu, Jie, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
Abstract/Description: Mesh-connected multicomputers are one of the simplest and least expensive structures to build a system using hundreds and even thousands of processors. The nodes communicate with each other by sending and receiving messages. As the system gets larger and larger, it not only requires the routing algorithms be efficient but also fault-tolerant. The fault model we use in 2-D meshes is a faulty block while in 3-D meshes, the fault model is a faculty cube. In order to route messages through...
Show moreMesh-connected multicomputers are one of the simplest and least expensive structures to build a system using hundreds and even thousands of processors. The nodes communicate with each other by sending and receiving messages. As the system gets larger and larger, it not only requires the routing algorithms be efficient but also fault-tolerant. The fault model we use in 2-D meshes is a faulty block while in 3-D meshes, the fault model is a faculty cube. In order to route messages through feasible minimum paths, the extended safety level is used to determine the existence of a minimal path and faulty block (cube) information is used to guide the routing. This dissertation presents an in-depth study of fault-tolerant minimal routing in 2-D tori, 3-D meshes, and tree-based fault-tolerant multicasting in 2-D and 3-D meshes using extended safety levels. Also path-based fault-tolerant deadlock-free multicasting in 2-D and 3-D meshes is studied. In fault-tolerant minimal routing in 2-D meshes, if no faulty block is encountered, any adaptive minimal routing can be used until the message encounters a faulty block. The next step is guided by the faulty block information until the message gets away from the faulty block. After that, any minimal adaptive routing can be used again. The minimal routing in 2-D tori is similar to that in 2-D meshes if at the beginning of the routing a conversion is made from a 2-D torus to a 2-D mesh. The fault-tolerant minimal routing in 3-D meshes can be done in a similar way. In the tree-based multicasting in 2-D and 3-D meshes, a time-step optimal and traffic-step suboptimal algorithm is proposed. Several heuristic strategies are presented to resolve a conflict, which are compared by simulations. A path-based fault-tolerant deadlock-free multicast algorithm in 2-D meshes with inter-block distance of at least three is presented to solve the deadlock problem in tree-based multicast algorithms. The approach is then extended to 3-D meshes and to inter-block distance of at least two in 2-D meshes. The path is Hamiltonian that is only updated locally in the neighborhood of a faulty block when a faulty block is encountered. Two virtual channels are used to prevent deadlock in 2-D and 3-D meshes with inter-block (inter-cube) distance of at least three and two more virtual channels are added if the inter-block distance is at least two.
Show less
Date Issued: 1999
PURL: http://purl.flvc.org/fcla/dt/12597
Subject Headings: Fault-tolerant computing, Computer algorithms
Format: Document (PDF)

Fault-tolerant computing (13)	+ -
Wireless communication systems (12)	+ -
Computer algorithms (10)	+ -
Mobile computing (9)	+ -
Hypercube networks (Computer networks) (7)	+ -

Computer network protocols (6)	+ -
Parallel processing (Electronic computers) (6)	+ -
Computer networks (5)	+ -
Routers (Computer networks) (5)	+ -
Algorithms (4)	+ -
Electronic data processing--Distributed processing (4)	+ -
Multiprocessors (4)	+ -
Computer architecture (3)	+ -
Computer network architectures (3)	+ -
Computer security (3)	+ -
Electronic digital computers--Power supply (3)	+ -
Peer-to-peer architecture (Computer networks) (3)	+ -
Computer networks--Security measures (2)	+ -
Internetworking (Telecommunication) (2)	+ -
Mobile communication systems (2)	+ -
Operating systems (Computers) (2)	+ -
Wireless communication systems--Mathematics (2)	+ -
Ad hoc networks (Computer networks)--Programming (1)	+ -
Blood--Diseases--Diagnosis (1)	+ -
Blood--Examination (1)	+ -
Cascading style sheets (1)	+ -
Combinatorial optimization (1)	+ -
Computational grids (Computer systems) (1)	+ -
Computer capacity--Management (1)	+ -
Computer industry--Technological innovations (1)	+ -

College of Engineering and Computer Science (32)	+ -
Department of Computer and Electrical Engineering and Computer Science (32)	+ -
Wu, Bing. (2)	+ -
Anantvalee, Tiranuch. (1)	+ -
Brown, Larry. (1)	+ -

Cang, Songluan. (1)	+ -
Chen, Xiao. (1)	+ -
Dai, Fei. (1)	+ -
Dai, Qing. (1)	+ -
Du, Kemei. (1)	+ -
Fernandez, Minjie Hua. (1)	+ -
Gao, Ming. (1)	+ -
Goyal, Praduemn K. (1)	+ -
He, Fusen. (1)	+ -
Huang, Chun-Jung (1)	+ -
Huang, Hao. (1)	+ -
Huang, Juncheng. (1)	+ -
Huang, Ke. (1)	+ -
Huang, Weizhen. (1)	+ -
Ibriq, Jamil (1)	+ -
Jawhar, Imad. (1)	+ -
Jiang, Zhen. (1)	+ -
Khumanthem, Rajesh Singh. (1)	+ -
Li, Hailan. (1)	+ -
Li, Xiuqi (1)	+ -
Lou, Wei. (1)	+ -
Luo, Yinqiu. (1)	+ -
Mahanthi, Gangadhar. (1)	+ -

Search In

Pages

Pages

Sort Results By:

Narrow results by:

Collection

Topical Subject

Genre

Type of Resource

Language

Creator

Format

Owner