Current Search: Computer network architectures (x)
View All Items
(21 - 40 of 42)
Pages
- Title
- Permutation-based data compression.
- Creator
- Mihnea, Amalya, Charles E. Schmidt College of Science, Department of Mathematical Sciences
- Abstract/Description
-
The use of permutations in data compression is an aspect that is worthy of further exploration. The work that has been done in video compression based on permutations was primarily oriented towards lossless algorithms. The study of previous algorithms has led to a new algorithm that could be either lossless or lossy, for which the amount of compression and the quality of the output can be controlled. The lossless version of our algorithm performs close to lossy versions of H.264 and it...
Show moreThe use of permutations in data compression is an aspect that is worthy of further exploration. The work that has been done in video compression based on permutations was primarily oriented towards lossless algorithms. The study of previous algorithms has led to a new algorithm that could be either lossless or lossy, for which the amount of compression and the quality of the output can be controlled. The lossless version of our algorithm performs close to lossy versions of H.264 and it improves on them for the majority of the videos that we analyzed. Our algorithm could be used in situations where there is a need for lossless compression and the video sequences are part of a single scene, e.g., medical videos, where loss of information could be risky or expensive. Some results on permutations, which may be of independent interest, arose in developing this algorithm. We report on these as well.
Show less - Date Issued
- 2011
- PURL
- http://purl.flvc.org/FAU/3333054
- Subject Headings
- Data compression (Telecommunication), Combinatorics, Network architecture and design, Computer network architectures, Mathematical optimization
- Format
- Document (PDF)
- Title
- Broadband-ISDN signaling: Protocol description and enhancements for future services.
- Creator
- Vasi, Idris Taher., Florida Atlantic University, Lobo, Andrea, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
- Abstract/Description
-
Broadband-ISDN Network Architecture and Signaling concepts are described with particular emphasis on Asynchronous Transfer Mode (ATM) technology. A consolidated view of various aspects of B-ISDN/ATM Access and Network Signaling functions, architecture and protocols is presented. Additionally, a suggested evolutionary growth path for the B-ISDN signaling protocols is summarized. This is followed by a high-level comparison of two protocols under consideration for network signaling. The result...
Show moreBroadband-ISDN Network Architecture and Signaling concepts are described with particular emphasis on Asynchronous Transfer Mode (ATM) technology. A consolidated view of various aspects of B-ISDN/ATM Access and Network Signaling functions, architecture and protocols is presented. Additionally, a suggested evolutionary growth path for the B-ISDN signaling protocols is summarized. This is followed by a high-level comparison of two protocols under consideration for network signaling. The result of this evaluation indicates that the requirements of network signaling are best met by a protocol stack based on SS7 concepts. Finally, a set of future B-ISDN and Multimedia services is presented in context of the requirements they would impose on the signaling protocols. Enhancements to the access signaling protocol are proposed for the support of multiconnection and/or multiparty calls. These extensions/enhancements consist of a set of simplified messages, information elements and procedures based on message flows. Evolution and backward compatibility to existing protocols are taken into account while developing the extensions.
Show less - Date Issued
- 1994
- PURL
- http://purl.flvc.org/fcla/dt/15016
- Subject Headings
- Asynchronous transfer mode, Computer network architectures, Broadband communication systems, Data transmission systems, Computer network protocols, Integrated services digital networks
- Format
- Document (PDF)
- Title
- Software decomposition for multicore architectures.
- Creator
- Jain, Ankit., Florida Atlantic University, Shankar, Ravi
- Abstract/Description
-
Current multicore processors attempt to optimize consumer experience via task partitioning and concurrent execution of these (sub)tasks on the cores. Conversion of sequential code to parallel and concurrent code is neither easy, nor feasible with current methodologies. We have developed a mapping process that synergistically uses top-down and bottom-up methodologies. This process is amenable to automation. We use bottom-up analysis to determine decomposability and estimate computation and...
Show moreCurrent multicore processors attempt to optimize consumer experience via task partitioning and concurrent execution of these (sub)tasks on the cores. Conversion of sequential code to parallel and concurrent code is neither easy, nor feasible with current methodologies. We have developed a mapping process that synergistically uses top-down and bottom-up methodologies. This process is amenable to automation. We use bottom-up analysis to determine decomposability and estimate computation and communication metrics. The outcome is a set of proposals for software decomposition. We then build abstract concurrent models that map these decomposed (abstract) software modules onto candidate multicore architectures; this resolves concurrency issues. We then perform a system level simulation to estimate concurrency gain and/or cost, and QOS (Qualify-of-Service) metrics. Different architectural combinations yield different QOS metrics; the requisite system architecture may then be chosen. We applied this 'middle-out' methodology to optimally map a digital camera application onto a processor with four cores.
Show less - Date Issued
- 2006
- PURL
- http://purl.flvc.org/fcla/dt/13349
- Subject Headings
- Optimal designs (Statistics), Software architecture, Software engineering, Computer architecture, System design, Computer networks--Security measures
- Format
- Document (PDF)
- Title
- An efficient and scalable core allocation strategy for multicore systems.
- Creator
- Rani, Manira S., College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
- Abstract/Description
-
Multiple threads can run concurrently on multiple cores in a multicore system and improve performance/power ratio. However, effective core allocation in multicore and manycore systems is very challenging. In this thesis, we propose an effective and scalable core allocation strategy for multicore systems to achieve optimal core utilization by reducing both internal and external fragmentations. Our proposed strategy helps evenly spreading the servicing cores on the chip to facilitate better...
Show moreMultiple threads can run concurrently on multiple cores in a multicore system and improve performance/power ratio. However, effective core allocation in multicore and manycore systems is very challenging. In this thesis, we propose an effective and scalable core allocation strategy for multicore systems to achieve optimal core utilization by reducing both internal and external fragmentations. Our proposed strategy helps evenly spreading the servicing cores on the chip to facilitate better heat dissipation. We introduce a multi-stage power management scheme to reduce the total power consumption by managing the power states of the cores. We simulate three multicore systems, with 16, 32, and 64 cores, respectively, using synthetic workload. Experimental results show that our proposed strategy performs better than Square-shaped, Rectangle-shaped, L-Shaped, and Hybrid (contiguous and non-contiguous) schemes in multicore systems in terms of fragmentation and completion time. Among these strategies, our strategy provides a better heat dissipation mechanism.
Show less - Date Issued
- 2011
- PURL
- http://purl.flvc.org/FAU/3172698
- Subject Headings
- Modularity (Engineering), Multicasting (Computer networks), Convergence (Telecommunication), Computer architecture, Memory management (Computer science), Cache memory
- Format
- Document (PDF)
- Title
- Efficient and Effective Searching m Unstructured FileSharing Peer-to-Peer Networks.
- Creator
- Li, Xiuqi, Wu, Jie, Florida Atlantic University, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
- Abstract/Description
-
Peer-to-peer (P2P) networking has been receiving increasing attention from the research community recently. How to conduct efficient and effective searching in such networks has been a challenging research topic. This dissertation focuses on unstructured file-sharing peer-to-peer networks. Three novel searching schemes are proposed, implemented, and evaluated. In the first scheme named ISRL (Intelligent Search by Reinforcement Learning), we propose to systematically learn the best route to...
Show morePeer-to-peer (P2P) networking has been receiving increasing attention from the research community recently. How to conduct efficient and effective searching in such networks has been a challenging research topic. This dissertation focuses on unstructured file-sharing peer-to-peer networks. Three novel searching schemes are proposed, implemented, and evaluated. In the first scheme named ISRL (Intelligent Search by Reinforcement Learning), we propose to systematically learn the best route to desired files through reinforcement learning when topology adaptation is impossible or infeasible. To discover the best path to desired files, ISRL not only explores new paths by forwarding queries to randomly chosen neighbors, but also exploits the paths that have been discovered for reducing the cumulative query cost. Three models of ISRL are put forwarded: a basic version for finding one desired file, MP-ISRL (MP stands for Multiple-Path ISRL) for finding at least k files, and C-ISRL (C refers to Clustering) for reducing maintenance overhead through clustering when there are many queries. ISRL outperforms existing searching approaches in unstructured peer-to-peer networks by achieving similar query quality with lower cumulative query cost. The experimental results confirm the performance improvement of ISRL. The second approach, HS-SDBF (Hint-based Searching by Scope Decay Bloom Filter), addresses the issue of effective and efficient hint propagation. We design a new data structure called SDBF (Scope Decay Bloom Filter) to represent and advertise probabilistic hints. Compared to existing proactive schemes, HSSDBF can answer many more queries successfully at a lower amortized cost considering both the query traffic and hint propagation traffic. Both the analytic and the experimental results support the performance improvement of our protocol. The third algorithm, hybrid search, seeks to combine the benefits of both forwarding and non-forwarding searching schemes. In this approach, a querying source directly probes its own extended neighbors and forwards a query to a subset of its extended neighbors and guides these neighbors to probe their own extended neighbors on its behalf. The hybrid search is able to adapt query execution to the popularity of desired files without generating too much state maintenance overhead because of the 1-hop forwarding inherent in the approach. It achieves a higher query efficiency than the forwarding scheme and a better success rate than the non-forwarding approach. To the best of our knowledge, this work is the first attempt to integrate forwarding and non-forwarding schemes. Simulation results demonstrate the effectiveness of the hybrid search.
Show less - Date Issued
- 2006
- PURL
- http://purl.flvc.org/fau/fd/FA00012572
- Subject Headings
- Peer-to-peer architecture (Computer networks), Computer security, Database searching, Internetworking (Telecommunication), Heterogeneous computing
- Format
- Document (PDF)
- Title
- Model-Driven Architecture and the Secure Systems Methodology.
- Creator
- Morrison, Patrick, Fernandez, Eduardo B., Florida Atlantic University, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
- Abstract/Description
-
As a compamon and complement to the work being done to build a secure systems methodology, this thesis evaluates the use of Model-Driven Architecture (MDA) in support of the methodology's lifecycle. The development lifecycle illustrated follows the recommendations of this secure systems methodology, while using MDA models to represent requirements, analysis, design, and implementation information. In order to evaluate MDA, we analyze a well-understood distributed systems security problem,...
Show moreAs a compamon and complement to the work being done to build a secure systems methodology, this thesis evaluates the use of Model-Driven Architecture (MDA) in support of the methodology's lifecycle. The development lifecycle illustrated follows the recommendations of this secure systems methodology, while using MDA models to represent requirements, analysis, design, and implementation information. In order to evaluate MDA, we analyze a well-understood distributed systems security problem, remote access, as illustrated by the internet "secure shell" protocol, ssh. By observing the ability of MDA models and transformations to specify remote access in each lifecycle phase, MDA's strengths and weaknesses can be evaluated in this context. A further aim of this work is to extract concepts that can be contained in an MDA security metamodel for use in future projects.
Show less - Date Issued
- 2007
- PURL
- http://purl.flvc.org/fau/fd/FA00012537
- Subject Headings
- Expert systems (Computer science), Software engineering, Computer-aided design, Computer network architectures
- 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
- Web services cryptographic patterns.
- Creator
- Hashizume, Keiko., College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
- Abstract/Description
-
Data security has been identified as one of the most important concerns where sensitive messages are exchanged over the network. In web service architecture, multiple distributed applications communicate with each other over the network by sending XML messages. How can we protect these sensitive messages? Some web services standards have emerged to tackle this problem. The XML Encryption standard defines the process of encrypting and decrypting all of an XML message, part of an XML message,...
Show moreData security has been identified as one of the most important concerns where sensitive messages are exchanged over the network. In web service architecture, multiple distributed applications communicate with each other over the network by sending XML messages. How can we protect these sensitive messages? Some web services standards have emerged to tackle this problem. The XML Encryption standard defines the process of encrypting and decrypting all of an XML message, part of an XML message, or even an external resource. Like XML Encryption, the XML Signature standard specifies how to digitally sign an entire XML message, part of an XML message, or an external object. WS-Security defines how to embed security tokens, XML encryption, and XML signature into XML documents. It does not define new security mechanisms, but leverages existing security technologies such as encryption and digital signature.
Show less - Date Issued
- 2009
- PURL
- http://purl.flvc.org/FAU/216413
- Subject Headings
- Computer networks, Access control, Data encryption (Computer science), XML (Document markup language), Digital signatures, Computer network architectures
- Format
- Document (PDF)
- Title
- MACHINE LEARNING DEMODULATOR ARCHITECTURES FOR POWER-LIMITED COMMUNICATIONS.
- Creator
- Gorday, Paul E., Nurgun, Erdol, Florida Atlantic University, Department of Computer and Electrical Engineering and Computer Science, College of Engineering and Computer Science
- Abstract/Description
-
The success of deep learning has renewed interest in applying neural networks and other machine learning techniques to most fields of data and signal processing, including communications. Advances in architecture and training lead us to consider new modem architectures that allow flexibility in design, continued learning in the field, and improved waveform coding. This dissertation examines neural network architectures and training methods suitable for demodulation in power-limited...
Show moreThe success of deep learning has renewed interest in applying neural networks and other machine learning techniques to most fields of data and signal processing, including communications. Advances in architecture and training lead us to consider new modem architectures that allow flexibility in design, continued learning in the field, and improved waveform coding. This dissertation examines neural network architectures and training methods suitable for demodulation in power-limited communication systems, such as those found in wireless sensor networks. Such networks will provide greater connection to the world around us and are expected to contain orders of magnitude more devices than cellular networks. A number of standard and proprietary protocols span this space, with modulations such as frequency-shift-keying (FSK), Gaussian FSK (GFSK), minimum shift keying (MSK), on-off-keying (OOK), and M-ary orthogonal modulation (M-orth). These modulations enable low-cost radio hardware with efficient nonlinear amplification in the transmitter and noncoherent demodulation in the receiver.
Show less - Date Issued
- 2020
- PURL
- http://purl.flvc.org/fau/fd/FA00013511
- Subject Headings
- Deep learning, Machine learning--Technique, Demodulators, Wireless sensor networks, Computer network architectures
- Format
- Document (PDF)
- Title
- Improving Cooperation in P2P Networks: A Social Network Approach.
- Creator
- Ponce, Victor, Wu, Jie, Florida Atlantic University, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
- Abstract/Description
-
Due to the dynamic nature of P2P systems, it is impossible to keep an accurate history of the transactions that take place while avoiding security attacks such as whitewashing and collusion, and abuse such as freeriding . This is why it is important to develop a mechanism that rewards cooperative peers and punishes misbehaving peers. Modeling P2P networks as social structures can allow incentive mechanisms to be used that prevent the negative behaviors mentioned. In this thesis, we extend a...
Show moreDue to the dynamic nature of P2P systems, it is impossible to keep an accurate history of the transactions that take place while avoiding security attacks such as whitewashing and collusion, and abuse such as freeriding . This is why it is important to develop a mechanism that rewards cooperative peers and punishes misbehaving peers. Modeling P2P networks as social structures can allow incentive mechanisms to be used that prevent the negative behaviors mentioned. In this thesis, we extend a social network algorithm to include credit transfer between peers in order to reduce the path length of queries. We also develop a selection strategy that involves different aspects of peer interactions in P2P networks, which is promoted by our credit transfer mechanism that discourages misbehaving peers by taking away credits that they have with good peers and transferring them to more cooperative ones. The simulation results show that our algorithm is effective in reducing the debt between peers, meaning that peers become more cooperative, and shortening the average path length to a satisfied query while increasing delivery ratio.
Show less - Date Issued
- 2007
- PURL
- http://purl.flvc.org/fau/fd/FA00012539
- Subject Headings
- Peer-to-peer architecture (Computer networks)--Technological innovations, Social interaction, Network analysis (Planning)
- Format
- Document (PDF)
- Title
- An uncertainty-aware reputation system in mobile networks: analysis and applications.
- Creator
- Li, Feng., College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
- Abstract/Description
-
Many emerging mobile networks aim to provide wireless network services without relying on any infrastructure. The main challenge in these networks comes from their self-organized and distributed nature. There is an inherent reliance on collaboration among the participants in order to achieve the aimed functionalities. Therefore, establishing and quantifying trust, which is the driving force for collaboration, is important for applications in mobile networks. This dissertation focuses on...
Show moreMany emerging mobile networks aim to provide wireless network services without relying on any infrastructure. The main challenge in these networks comes from their self-organized and distributed nature. There is an inherent reliance on collaboration among the participants in order to achieve the aimed functionalities. Therefore, establishing and quantifying trust, which is the driving force for collaboration, is important for applications in mobile networks. This dissertation focuses on evaluating and quantifying trust to stimulate collaboration in mobile networks, introducing uncertainty concepts and metrics, as well as providing the various analysis and applications of uncertainty-aware reputation systems. Many existing reputation systems sharply divide the trust value into right or wrong, thus ignoring another core dimension of trust: uncertainty. As uncertainty deeply impacts a node's anticipation of others' behavior and decisions during interaction, we include it in the reputation system. Specifically, we use an uncertainty metric to directly reflect a node's confidence in the sufficiency of its past experience, and study how the collection of trust information may affect uncertainty in nodes' opinions. Higher uncertainty leads to higher transaction cost and reduced acceptance of communication. We exploit mobility to efficiently reduce uncertainty and to speed up trust convergence. We also apply the new reputation system to enhance the analysis of the interactions among mobile nodes, and present three sample uncertainty-aware applications. We integrate the uncertainty-aware reputation model with game theory tools, and enhance the analysis on interactions among mobile nodes., Instead of reactively protecting the mobile networks from existing attacks as in the traditional security paradigms, the analysis in this dissertation gives more insights on nodes' rationality in the interaction, which will enable the mechanism design in mobile networks to be security and incentive compatible. Moreover, we present three sample applications, in which we clearly identify the challenges, specifically formalize the problems, and cleverly employ the uncertainty mitigation schemes. These applications show that the uncertainty definition and mitigation schemes can benefit a broad range of applications, including fields such as security, network services, and routing.
Show less - Date Issued
- 2009
- PURL
- http://purl.flvc.org/FAU/210520
- Subject Headings
- Wireless communication systems, Security measures, Wireless communication systems, Technological innovations, Computer network architectures, Mobile computing, Ad hoc networks (Computer networks), Security measures
- Format
- Document (PDF)
- Title
- Progress towards push button verification for business process execution language artifacts.
- Creator
- Vargas, Augusto., College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
- Abstract/Description
-
Web Service Business Process Execution Language (BPEL) has become a standard language in the world of Service Oriented Architecture (SOA) for specifying interactions between internet services. This standard frees developers from low-level concerns involving platform, implementation, and versioning. These freedoms risk development of less robust artifacts that may even become part of a mission-critical system. Model checking a BPEL artifact for correctness with respect to temporal logic...
Show moreWeb Service Business Process Execution Language (BPEL) has become a standard language in the world of Service Oriented Architecture (SOA) for specifying interactions between internet services. This standard frees developers from low-level concerns involving platform, implementation, and versioning. These freedoms risk development of less robust artifacts that may even become part of a mission-critical system. Model checking a BPEL artifact for correctness with respect to temporal logic properties is computationally complex, since it requires enumerating all communication and synchronization amongst various services with itself. This entails modeling BPEL features such as concurrency, hierarchy, interleaving, and non-deterministic choice. The thesis will provide rules and procedures for translating these features to a veriable model written in Promela. We will use these rules to build a program which automates the translation process, bringing us one step closer to push button verification. Finally, two BPEL artifacts will be translated, manually edited, verified, and analyzed.
Show less - Date Issued
- 2009
- PURL
- http://purl.flvc.org/FAU/369386
- Subject Headings
- Electronic commerce, Computer programs, Computer network architectures, Expert systems (Computer science), Web servers, Management, Computer systems, Verification
- Format
- Document (PDF)
- Title
- A pattern-driven process for secure service-oriented applications.
- Creator
- Delessy, Nelly A., Florida Atlantic University, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
- Abstract/Description
-
During the last few years, Service-Oriented Architecture (SOA) has been considered to be the new phase in the evolution of distributed enterprise applications. Even though there is a common acceptance of this concept, a real problem hinders the widespread use of SOA : A methodology to design and build secure service-oriented applications is needed. In this dissertation, we design a novel process to secure service-oriented applications. Our contribution is original not only because it applies...
Show moreDuring the last few years, Service-Oriented Architecture (SOA) has been considered to be the new phase in the evolution of distributed enterprise applications. Even though there is a common acceptance of this concept, a real problem hinders the widespread use of SOA : A methodology to design and build secure service-oriented applications is needed. In this dissertation, we design a novel process to secure service-oriented applications. Our contribution is original not only because it applies the MDA approach to the design of service-oriented applications but also because it allows their securing by dynamically applying security patterns throughout the whole process. Security patterns capture security knowledge and describe security mechanisms. In our process, we present a structured map of security patterns for SOA and web services and its corresponding catalog. At the different steps of a software lifecycle, the architect or designer needs to make some security decisions., An approach using a decision tree made of security pattern nodes is proposed to help making these choices. We show how to extract a decision tree from our map of security patterns. Model-Driven Architecture (MDA) is an approach which promotes the systematic use of models during a system's development lifecycle. In the dissertation we describe a chain of transformations necessary to obtain secure models of the service-oriented application. A main benefit of this process is that it decouples the application domain expertise from the security expertise that are both needed to build a secure application. Security knowledge is captured by pre-defined security patterns, their selection is rendered easier by using the decision trees and their application can be automated. A consequence is that the inclusion of security during the software development process becomes more convenient for the architects/designers., A second benefit is that the insertion of security is semi-automated and traceable. Thus, the process is flexible and can easily adapt to changing requirements. Given that SOA was developed in order to provide enterprises with modular, reusable and adaptable architectures, but that security was the principal factor that hindered its use, we believe that our process can act as an enabler for service-oriented applications.
Show less - Date Issued
- 2008
- PURL
- http://purl.flvc.org/FAU/58003
- Subject Headings
- Computer network architectures, Web servers, Management, Software engineering, Expert systems (Computer science)
- Format
- Document (PDF)
- Title
- A Comparison of Model Checking Tools for Service Oriented Architectures.
- Creator
- Venkat, Raghava, Khoshgoftaar, Taghi M., Florida Atlantic University, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
- Abstract/Description
-
Recently most of the research pertaining to Service-Oriented Architecture (SOA) is based on web services and how secure they are in terms of efficiency and effectiveness. This requires validation, verification, and evaluation of web services. Verification and validation should be collaborative when web services from different vendors are integrated together to carry out a coherent task. For this purpose, novel model checking technologies have been devised and applied to web services. "Model...
Show moreRecently most of the research pertaining to Service-Oriented Architecture (SOA) is based on web services and how secure they are in terms of efficiency and effectiveness. This requires validation, verification, and evaluation of web services. Verification and validation should be collaborative when web services from different vendors are integrated together to carry out a coherent task. For this purpose, novel model checking technologies have been devised and applied to web services. "Model Checking" is a promising technique for verification and validation of software systems. WS-BPEL (Business Process Execution Language for Web Services) is an emerging standard language to describe web service composition behavior. The advanced features of BPEL such as concurrency and hierarchy make it challenging to verify BPEL models. Based on all such factors my thesis surveys a few important technologies (tools) for model checking and comparing each of them based on their "functional" and "non-functional" properties. The comparison is based on three case studies (first being the small case, second medium and the third one a large case) where we construct synthetic web service compositions for each case (as there are not many publicly available compositions [1]). The first case study is "Enhanced LoanApproval Process" and is considered a small case. The second is "Enhanced Purchase Order Process" which is of medium size and the third, and largest is based on a scientific workflow pattern, called the "Service Oriented Architecture Implementing BOINC Workflow" based on BOINC (Berkeley Open Infrastructure Network Computing) architecture.
Show less - Date Issued
- 2007
- PURL
- http://purl.flvc.org/fau/fd/FA00012565
- Subject Headings
- Computer network architectures, Expert systems (Computer science), Software engineering, Web servers--Management
- Format
- Document (PDF)
- Title
- A Study on Partially Homomorphic Encryption Schemes.
- Creator
- Mithila, Shifat P., Karabina, Koray, Florida Atlantic University, Charles E. Schmidt College of Science, Department of Mathematical Sciences
- Abstract/Description
-
High processing time and implementation complexity of the fully homomorphic encryption schemes intrigued cryptographers to extend partially homomorphic encryption schemes to allow homomorphic computation for larger classes of polynomials. In this thesis, we study several public key and partially homomorphic schemes and discuss a recent technique for boosting linearly homomorphic encryption schemes. Further, we implement this boosting technique on CGS linearly homomorphic encryption scheme to...
Show moreHigh processing time and implementation complexity of the fully homomorphic encryption schemes intrigued cryptographers to extend partially homomorphic encryption schemes to allow homomorphic computation for larger classes of polynomials. In this thesis, we study several public key and partially homomorphic schemes and discuss a recent technique for boosting linearly homomorphic encryption schemes. Further, we implement this boosting technique on CGS linearly homomorphic encryption scheme to allow one single multiplication as well as arbitrary number of additions on encrypted plaintexts. We provide MAGMA source codes for the implementation of the CGS scheme along with the boosted CGS scheme.
Show less - Date Issued
- 2017
- PURL
- http://purl.flvc.org/fau/fd/FA00004840, http://purl.flvc.org/fau/fd/FA00004840
- Subject Headings
- Computer networks--Security measures., Computer security., Computers--Access control--Code words., Cyberinfrastructure., Computer network architectures., Cryptography., Number theory--Data processing.
- Format
- Document (PDF)
- Title
- Patterns for web services standards.
- Creator
- Ajaj, Ola, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
- Abstract/Description
-
Web services intend to provide an application integration technology that can be successfully used over the Internet in a secure, interoperable and trusted manner. Policies are high-level guidelines defining the way an institution conducts its activities. The WS-Policy standard describes how to apply policies of security definition, enforcement of access control, authentication and logging. WS-Trust defines a security token service and a trust engine which are used by web services to...
Show moreWeb services intend to provide an application integration technology that can be successfully used over the Internet in a secure, interoperable and trusted manner. Policies are high-level guidelines defining the way an institution conducts its activities. The WS-Policy standard describes how to apply policies of security definition, enforcement of access control, authentication and logging. WS-Trust defines a security token service and a trust engine which are used by web services to authenticate other web services. Using the functions defined in WS-Trust, applications can engage in secure communication after establishing trust. BPEL is a language for web service composition that intends to provide convenient and effective means for application integration over the Internet. We address security considerations in BPEL and how to enforce them, as well as its interactions with other web services standards such as WS-Security and WS-Policy.
Show less - Date Issued
- 2010
- PURL
- http://purl.flvc.org/FAU/1927300
- Subject Headings
- Computational grids (Computer systems), Computer systems, Verification, Expert systems (Computer science), Computer network architectures, Web servers, Management, Electronic commerce, Computer programs
- Format
- Document (PDF)
- Title
- Prognosis and health monitoring communications quality of service.
- Creator
- Tavtilov, Timur, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
- Abstract/Description
-
This thesis research was funded by the Southeast National Marine Renewable Energy Center (SNMREC) at Florida Atlantic University. Its objective is the development of Quality of Service (QoS) mechanisms for the wireless communications architecture used by the Prognosis and Health Monitoring (PHM) subsystem. There are numerous technical challenges that the PHM Communications Subsystem tries to solve. Due to ocean platform mobility from waves, currents, and other environmental factors, signal...
Show moreThis thesis research was funded by the Southeast National Marine Renewable Energy Center (SNMREC) at Florida Atlantic University. Its objective is the development of Quality of Service (QoS) mechanisms for the wireless communications architecture used by the Prognosis and Health Monitoring (PHM) subsystem. There are numerous technical challenges that the PHM Communications Subsystem tries to solve. Due to ocean platform mobility from waves, currents, and other environmental factors, signal quality can vary significantly. As a result, the wireless link between the electric generator platform and shore systems will have variable quality in terms of data rate, delay, and availability. In addition, the data traffic that flows from generator sensors and PHM applications to the shore systems consists of numerous types of messages that have different QoS demands (e.g. delay) and priority that depends on the message type, user ID, sensor location, and application-dependent parameters. The PHM Communications subsystem must handle effectively high priority messages, such as alarms, alerts, and remote control commands from shore systems. It also performs QoS in the application layer, so it can read the contents of every message to prioritize them. In order to perform QoS in the application layer the PHM subsystem relies on Java Servlet multithreaded technology and different queuing techniques to control message transmission order. Furthermore, it compresses all traffic that comes from the ocean-based electric generator/turbine platform to reduce the load on the wireless link. The PHM Communications subsystem consists of three components: the wireless link, the Link Manager, and the Web Services Network Proxy. We present experimental results for the Web Services Network Proxy and demonstrate the effectiveness of XML data compression and semantic-based message scheduling over a link with variable capacity.
Show less - Date Issued
- 2011
- PURL
- http://purl.flvc.org/FAU/3334098
- Subject Headings
- Computer network architecture, Service-oriented architecture (Computer science), Wireless communication services, Technological innovations, Wireless communication services, Quality control
- Format
- Document (PDF)
- Title
- CBR-based software quality models and quality of data.
- Creator
- Xiao, Yudong., Florida Atlantic University, Khoshgoftaar, Taghi M., College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
- Abstract/Description
-
The performance accuracy of software quality estimation models is influenced by several factors, including the following two important factors: performance of the prediction algorithm and the quality of data. This dissertation addresses these two factors, and consists of two components: (1) a proposed genetic algorithm (GA) based optimization of software quality models for accuracy enhancement, and (2) a proposed partitioning- and rule-based filter (PRBF) for noise detection toward...
Show moreThe performance accuracy of software quality estimation models is influenced by several factors, including the following two important factors: performance of the prediction algorithm and the quality of data. This dissertation addresses these two factors, and consists of two components: (1) a proposed genetic algorithm (GA) based optimization of software quality models for accuracy enhancement, and (2) a proposed partitioning- and rule-based filter (PRBF) for noise detection toward improvement of data quality. We construct a generalized framework of our embedded GA-optimizer, and instantiate the GA-optimizer for three optimization problems in software quality engineering: parameter optimization for case-based reasoning (CBR) models; module rank optimization for module-order modeling (MOM); and structural optimization for our multi-strategy classification modeling approach, denoted RB2CBL. Empirical case studies using software measurement data from real-world software systems were performed for the optimization problems. The GA-optimization approaches improved software quality prediction accuracy, highlighting the practical benefits of using GA for solving optimization problems in software engineering. The proposed noise detection approach, PRBF, was empirically evaluated using data categorized into two classes. Empirical studies on artificially corrupted datasets and datasets with known (natural) noise demonstrated that PRBF can effectively detect both artificial and natural noise. The proposed filter is a stable and robust technique, and always provided optimal or near-optimal noise detection results. In addition, it is applicable on datasets with nominal and numerical attributes, as well as those with missing values. The PRBF technique supports two methods of noise detection: class noise detection and cost-sensitive noise detection. The former is an easy-to-use method and does not need parameter settings, while the latter is suited for applications where each class has a specific misclassification cost. PRBF can also be used iteratively to investigate the two general types of data noise: attribute and class noise.
Show less - Date Issued
- 2005
- PURL
- http://purl.flvc.org/fcla/dt/12141
- Subject Headings
- Computer software--Quality control, Genetic programming (Computer science), Software engineering, Case-based reasoning, Combinatorial optimization, Computer network architecture
- Format
- Document (PDF)
- Title
- Controlling access to physical locations.
- Creator
- Desouza-Doucet, Ana C., Florida Atlantic University, Fernandez, Eduardo B.
- Abstract/Description
-
The need to secure and control access to rooms in premises has shifted from allowing some people to enter a room to giving permission to specific persons to access a room and recording who entered the room and the time they spent in it. With such need for higher security in mind, we design an access control system for controlling physical access of people to locations or to specific units in these locations. Our study gives emphasis to the organization of physical locations, including nested...
Show moreThe need to secure and control access to rooms in premises has shifted from allowing some people to enter a room to giving permission to specific persons to access a room and recording who entered the room and the time they spent in it. With such need for higher security in mind, we design an access control system for controlling physical access of people to locations or to specific units in these locations. Our study gives emphasis to the organization of physical locations, including nested rooms, and the approach used to assign permission to people to access such locations. We also define some security policies to be used in such model as well as appropriate user interfaces. Finally, we develop two patterns based on our model.
Show less - Date Issued
- 2006
- PURL
- http://purl.flvc.org/fcla/dt/13328
- Subject Headings
- Software architecture, Computer networks--Access control, Computer security, Object-oriented programming (Computer science), Smart cards--Security measures
- Format
- Document (PDF)
- Title
- Patterns for secure interactions in social networks in Web 2.0.
- Creator
- Marin, Carolina, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
- Abstract/Description
-
A social network is a structure of individuals and organizations, which are connected by one or more types of interdependency, such as friendship, affinity, common interests or knowledge. Social networks use Web 2.0 technology, which is mostly based on a service-oriented architecture. We are studying patterns for social networks in this environment. A pattern is an encapsulated solution to a software problem in a given context, secure threats are possible in this context. We present a...
Show moreA social network is a structure of individuals and organizations, which are connected by one or more types of interdependency, such as friendship, affinity, common interests or knowledge. Social networks use Web 2.0 technology, which is mostly based on a service-oriented architecture. We are studying patterns for social networks in this environment. A pattern is an encapsulated solution to a software problem in a given context, secure threats are possible in this context. We present a collection of patterns associated with the most important aspects of social networks, with emphasis on controlling the actions of the users of these networks.
Show less - Date Issued
- 2012
- PURL
- http://purl.flvc.org/FAU/3342203
- Subject Headings
- Web 2.0, Computer network architectures, Online social networks, Security measures, Social media, Pattern recognition systems
- Format
- Document (PDF)
