Dissertations / Theses: '100503 Computer Communications Networks'

1

Goodeve, Donald Munro. "Performance of multiprocessor communications networks." Thesis, University of York, 1994. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.359273.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Tilley, Kevin Joseph. "Performance of computer communications for manufacturing." Thesis, University of Cambridge, 1991. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.386857.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Gunderson, Renee M. "Network security for a communications company." Online version, 2002. http://www.uwstout.edu/lib/thesis/2002/2002gundersonr.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Glazer, D. W. (David W. ). "On routing and congestion control in computer communications networks." Thesis, McGill University, 1986. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=66146.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Biddiscombe, Martin David. "Free market communications." Thesis, University College London (University of London), 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.325627.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Cox, Criston W. "Optimizing bandwidth of tactical communications systems." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2005. http://library.nps.navy.mil/uhtbin/hyperion/05Jun%5FCox.pdf.

Full text

Abstract:

Thesis (M.S. in Systems Technology (Joint Command, Control, Communications, Computers and Intelligence (JC4I))--Naval Postgraduate School, June 2005.
Thesis Advisor(s): William Kemple, John Osmundson. Includes bibliographical references (p. 59-60). Also available online.

APA, Harvard, Vancouver, ISO, and other styles

7

Savacool, Richard. "Firewall resistance to metaferography in network communications /." Online version of thesis, 2010. http://hdl.handle.net/1850/12272.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Mackie, David Sean. "Extending the reach of personal area networks by transporting Bluetooth communications over IP networks." Thesis, Rhodes University, 2007. http://hdl.handle.net/10962/d1006551.

Full text

Abstract:

This thesis presents an investigation of how to extend the reach of a Bluetooth personal area network by introducing the concept of Bluetooth Hotspots. Currently two Bluetooth devices cannot communicate with each other unless they are within radio range, since Bluetooth is designed as a cable-replacement technology for wireless communications over short ranges. An investigation was done into the feasibility of creating Bluetooth hotspots that allow distant Bluetooth devices to communicate with each other by transporting their communications between these hotspots via an alternative network infrastructure such as an IP network. Two approaches were investigated, masquerading of remote devices by the local hotspot to allow seamless communications and proxying services on remote devices by providing them on a local hotspot using a distributed service discovery database. The latter approach was used to develop applications capable of transporting Bluetooth’s RFCOMM and L2CAP protocols. Quantitative tests were performed to establish the throughput performance and latency of these transport applications. Furthermore, a number of selected Bluetooth services were tested which lead us to conclude that most data-based protocols can be transported by the system.

APA, Harvard, Vancouver, ISO, and other styles

9

Pendergast, Mark Overton. "Interprogram communication for PC/LAN-based collaborative applications: PLEXNET, a session level communications system." Diss., The University of Arizona, 1989. http://hdl.handle.net/10150/184784.

Full text

Abstract:

This dissertation describes the analysis, design, and implementation of a session level communication system referred to as PLEXNET. PLEXNET was developed specifically to provide communication services required by Computer Supported Cooperative Work (CSCW) applications but which are not currently available as part of commercially available LAN products. CSCW services include such things as: reliable broadcast communications, dynamic multicasting, and message queuing. Analysis of CSCW networking requirements entailed: reviewing CSCW applications and communications systems; synthesizing a data exchange model for collaborative tools; and defining a target system (PC-LAN). PLEXNET design provides a discussion of: networking tradeoffs, the relationship between PLEXNET and NETBIOS, PLEXNET queue structure, and PLEXNET implementation details. The design and implementation of PLEXNET were validated by performing discrete event simulations comparing response times and resource utilization for three communication paradigms and by developing four collaborative applications which employ PLEXNET for data communications. These applications are: Multi-User LAN Editor, Electronic Discussion System, Contracts Procurement, and Video Switcher.

APA, Harvard, Vancouver, ISO, and other styles

10

Weiss, Ron 1970. "Cellular computation and communications using engineered genetic regulatory networks." Thesis, Massachusetts Institute of Technology, 2001. http://hdl.handle.net/1721.1/8228.

Full text

Abstract:

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2001.
Includes bibliographical references (p. 130-138).
In this thesis, I present an engineering discipline for obtaining complex, predictable, and reliable cell behaviors by embedding biochemical logic circuits and programmed intercellular communications into cells. To accomplish this goal, I provide a well-characterized component library, a biocircuit design methodology, and software design tools. I have built and characterized an initial cellular gate library with biochemical gates that implement the NOT, IMPLIES, and AND logic functions in E. coli cells. The logic gates perform computation using DNA-binding proteins, small molecules that interact with these proteins, and segments of DNA that regulate the expression of the proteins. I introduce genetic process engineering, a methodology for modifying the DNA encoding of existing genetic elements to achieve the desired input/output behavior for constructing reliable circuits of significant complexity. I demonstrate the feasibility of digital computation in cells by building several operational in-vivo digital logic circuits, each composed of three gates that have been optimized by genetic process engineering.
(cont.) I also demonstrate engineered intercellular communications with programmed enzymatic activity and chemical diffusions to carry messages, using DNA from the Vibrio fischeri lux operon. The programmed communications is essential for obtaining coordinated behavior from cell aggregates. In addition to the above experimental contributions, I have developed BioSPICE, a prototype software tool for biocircuit design. It supports both static and dynamic simulations and analysis of single cell environments and small cell aggregates. Finally, I present the Microbial Colony Language (MCL), a model for programming cell aggregates. The language is expressive enough for interesting applications, yet relies on simple primitives that can be mapped to the engineered biological processes described above.
by Ron Weiss.
Ph.D.

APA, Harvard, Vancouver, ISO, and other styles

11

Papaioannou, Dimitri A. 1971. "Channel allocation and admission control in cellular communications networks." Thesis, Massachusetts Institute of Technology, 1998. http://hdl.handle.net/1721.1/46120.

Full text

Abstract:

Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1998.
Includes bibliographical references (p. 62-64).
by Dimitri A. Papaioannou.
M.S.

APA, Harvard, Vancouver, ISO, and other styles

12

Yao, Li-Jun. "Real-time communications in token ring networks." Title page, abstract and contents only, 1994. http://web4.library.adelaide.edu.au/theses/09PH/09phy248.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Carpenter, J. R. "Writing coastlines : locating narrative resonance in transatlantic communications networks." Thesis, University of the Arts London, 2015. http://ualresearchonline.arts.ac.uk/7825/.

Full text

Abstract:

The term ‘writing coastlines’ implies a double meaning. The word ‘writing’ refers both to the act of writing and to that which is written. The act of writing translates aural, physical, mental and digital processes into marks, actions, utterances, and speech-acts. The intelligibility of that which is written is intertwined with both the context of its production and of its consumption. The term ‘writing coastlines’ may refer to writing about coastlines, but the coastlines themselves are also writing in so far as they are translating physical processes into marks and actions. Coastlines are the shifting terrains where land and water meet, always neither land nor water and always both. The physical processes enacted by waves and winds may result in marks and actions associated with both erosion and accretion. Writing coastlines are edges, ledges, legible lines caught in the double bind of simultaneously writing and erasing. These in-between places are liminal spaces – points of both departure and arrival, and sites of exchange. One coastline implies another, implores a far shore. The dialogue implied by this entreaty intrigues me. The coastlines of the United Kingdom and those of Atlantic Canada are separated by three and a half thousand kilometres of ocean. Yet for centuries, fishers, sailors, explorers, migrants, emigrants, merchants, messengers, messages, packets, ships, submarine cables, aeroplanes, satellite signals and wireless radio waves have attempted to bridge this distance. These comings and goings have left traces. Generations of transatlantic migrations have engendered networks of communications. As narratives of place and displacement travel across, beyond, and through these networks, they become informed by the networks’ structures and inflected with the syntax and grammar of the networks’ code languages. Writing coastlines interrogates this in-between space with a series of questions: When does leaving end and arriving begin? When does the emigrant become the immigrant? What happens between call and response? What narratives resonate in the spaces between places separated by time, distance, and ocean yet inextricably linked by generations of immigration? This thesis takes an overtly interdisciplinary approach to answering these questions. This practice-led research refers to and infers from the corpora and associated histories, institutions, theoretical frameworks, modes of production, venues, and audiences of the visual, media, performance, and literary arts, as well as from the traditionally more scientific realms of cartography, navigation, network archaeology, and creative computing. Writing Coastlines navigates the emerging and occasionally diverging theoretical terrains of electronic literature, locative narrative, media archaeology, and networked art through the methodology of performance writing pioneered at Dartington College of Art (Bergvall 1996, Hall 2008). Central to this methodology is an iterative approach to writing, which interrogates the performance of writing in and across contexts toward an extended compositional process. Writing Coastlines will contribute to a theoretical framework and methodology for the creation and dissemination of networked narrative structures for stories of place and displacement that resonate between sites, confusing and confounding boundaries between physical and digital, code and narrative, past and future, home and away. Writing Coastlines will contribute to the creation of a new narrative context from which to examine a multi-site-specific place-based identity by extending the performance writing methodology to incorporate digital literature and locative narrative practices, by producing and publicly presenting a significant body of creative and critical work, and by developing a mode of critical writing which intertwines practice with theory.

APA, Harvard, Vancouver, ISO, and other styles

14

Hegarty, Declan. "FPGA-based architectures for next generation communications networks." Thesis, University of Glasgow, 2008. http://theses.gla.ac.uk/455/.

Full text

Abstract:

This engineering doctorate concerns the application of Field Programmable Gate Array (FPGA) technology to some of the challenges faced in the design of next generation communications networks. The growth and convergence of such networks has fuelled demand for higher bandwidth systems, and a requirement to support a diverse range of payloads across the network span. The research which follows focuses on the development of FPGA-based architectures for two important paradigms in contemporary networking - Forward Error Correction and Packet Classification. The work seeks to combine analysis of the underlying algorithms and mathematical techniques which drive these applications, with an informed approach to the design of efficient FPGA-based circuits.

APA, Harvard, Vancouver, ISO, and other styles

15

Bignell, Allan M. "Photonic bus and photonic mesh networks : design techniques in extremely high speed networks /." *McMaster only, 1997.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

16

Verenzuela, Daniel. "Scalability of Device-to-Device Communications in Cellular Networks." Thesis, KTH, Skolan för informations- och kommunikationsteknik (ICT), 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-187444.

Full text

Abstract:

In current cellular networks the demand of traffic is rapidly increasing and new techniques need to be developed to accommodate future service requirements. Device-to-Device (D2D) communications is one technique that has been proposed to improve the performance of the system by allowing devices to communicate directly without routing traffic through the base station. This technique has the means to improved performance and support new proximity based services. Nowadays new applications based on geographical proximity are becoming more and more popular suggesting that D2D communications will have a high de- mand in the near future. Thus the study of the scalability of D2D communications is of paramount importance. We define the scalability of D2D communications underlay cellular networks as the maximum number of D2D links that can share the cellular resources while assuring QoS to both D2D links and cellular users. In this thesis we study the scalability of D2D communication underlay cellu- lar networks in a multi-cell environment. We propose interference coordination schemes to maximize the number of D2D links while assuring QoS to D2D links and cellular users. Three interference coordination schemes have been proposed considering dif- ferent levels of available channel state information (CSI). The first scheme is called no CSI centralized (N-CSIC) scheme and it is based on a centralized solution where no CSI is needed. The second is partial CSI distributed (P-CSID) scheme and it is based on a distributed solution where partial CSI is available. The last scheme is named full CSI optimal (F-CSIOp) scheme and it is achieved by formulating an optimization problem considering full CSI to be available. Extensive mathematical and numerical analysis is conducted to develop and evaluate the proposed schemes. The results show that F-CSIOp scheme offers the best performance followed by the P-CSID and finally N-CSIC, thus a clear relationship is found between complexity and performance. The P-CSID offers a practical solution for a low complexity interference co- ordination scheme that achieves good scalability and capacity for a wide range of strict QoS requirements. Moreover the results show that further improvement can be achieved if proper selection of the involved parameters is done along with the implementations of closed loop power control (CLPC) schemes. The N-CSIC scheme provides a good solution for low SINR values of D2D links when the QoS of cellular users is low. Thus it is a good candidate for applications like sensor networks or M2M communications where the SINR requirements are rather low and there are no primary users to impose more interference constraints. Finally we conclude that good scalability and capacity can be achieved with the proposed low complexity interference coordination schemes for D2D communications and provide interesting topics for future research.

APA, Harvard, Vancouver, ISO, and other styles

17

Yantchev, Jelio Todorov. "Communications in concurrent systems - programming language primitives and interconnection networks." Thesis, University of Southampton, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.316475.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Nish, Rose. "Creation of a covert communications network for evasion of surveillance." Scholarly Commons, 2016. https://scholarlycommons.pacific.edu/uop_etds/216.

Full text

Abstract:

People all around the world have their internet access censored or monitored by governments or large corporations. Whistleblowers and human rights activists oftentimes need to communicate in secret to avoid persecution by the powerful organization monitoring their communications. Current anonymity systems often depend on the public internet, and as such are subject to some degree of interference. Cloak is a textual communication network created to hide the existence of the network itself from an outside observer, such as a repressive government or corrupt corporation. Cloak does not use the public internet, and as such would evade the majority of the monitoring in place today. Cloak also does not use any special infrastructure or create its own infrastructure, minimizing the risk of infrastructure attacks. Finally, Cloak provides plausible deniability for its users should they be investigated. Cloak works by hiding its messages inside of normal phone activity. Two Cloak nodes can identify each other by looking at wifi probe messages that are generated by phones in the vicinity of an open wifi hotspot. They can then connect to the hotspot and browse like normal, while hiding messages inside their browsing. Because this is open wifi, the other nodes can see the hidden messages and store them, and carry them closer to their destination. Cloak can hide its messages in a lot of ways. It can first send images with messages embedded in them. It can also use places where a website asks for data in a opaque format, such as YouTube video ids. Finally, if encrypted browsing is available, a Cloak node can just send the encrypted message and act like something went wrong with its encrypted browsing.

APA, Harvard, Vancouver, ISO, and other styles

19

Tariq, Sana. "Inside all-optical networks /." Online version of thesis, 2009. http://hdl.handle.net/1850/10960.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Gong, P. "Energy efficient and secure wireless communications for wireless sensor networks." Thesis, City, University of London, 2017. http://openaccess.city.ac.uk/18026/.

Full text

Abstract:

This dissertation considers wireless sensor networks (WSNs) operating in severe environments where energy efficiency and security are important factors. This main aim of this research is to improve routing protocols in WSNs to ensure efficient energy usage and protect against attacks (especially energy draining attacks) targeting WSNs. An enhancement of the existing AODV (Ad hoc On-Demand Distance Vector) routing protocol for energy efficiency, called AODV-Energy Harvesting Aware (AODVEHA), is proposed and evaluated. It not only inherits the advantages of AODV which are well suited to ad hoc networks, but also makes use of the energy harvesting capability of sensor nodes in the network. In addition to the investigation of energy efficiency, another routing protocol called Secure and Energy Aware Routing Protocol (ETARP) designed for energy efficiency and security of WSNs is presented. The key part of the ETARP is route selection based on utility theory, which is a novel approach to simultaneously factor energy efficiency and trustworthiness of routes in the routing protocol. Finally, this dissertation proposes a routing protocol to protect against a specific type of resource depletion attack called Vampire attacks. The proposed resource-conserving protection against energy draining (RCPED) protocol is independent of cryptographic methods, which brings advantage of less energy cost and hardware requirement. RCPED collaborates with existing routing protocols, detects abnormal sign of Vampire attacks and determines the possible attackers. Then routes are discovered and selected on the basis of maximum priority, where the priority that reflects the energy efficiency and safety level of route is calculated by means of Analytic Hierarchy Process (AHP). The proposed analytic model for the aforementioned routing solutions are verified by simulations. Simulations results validate the improvements of proposed routing approaches in terms of better energy efficiency and guarantee of security.

APA, Harvard, Vancouver, ISO, and other styles

21

Scrase, Andrew N. "On RDL and its application to the performability of communications networks." Thesis, Open University, 1991. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.278916.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Ni, Jian. "Content management and admission control in multimedia content delivery networks /." View abstract or full-text, 2003. http://library.ust.hk/cgi/db/thesis.pl?ELEC%202003%20NI.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Modi, Sohrab. "Free space laser communications on the Macintosh computers /." Online version of thesis, 1990. http://hdl.handle.net/1850/10547.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Veenendaal, Bert. "The distribution of geographic information systems data in a computer communications network." Thesis, Curtin University, 1999. http://hdl.handle.net/20.500.11937/1971.

Full text

Abstract:

Geographic information systems (GIS) are developing in a rapidly expanding distributed environment. With the ever-increasing growth of computer networks and the Internet in particular, it is imperative that GIS take advantage of distributed data technologies to provide users and applications with shared and improved access to geographic data.Geographic data distribution design is concerned with determining what data gets placed at which computer network sites and involves the issues of data partitioning, allocation and dynamic migration. Partitioning is concerned with how data, or fragments of the data, are apportioned to partitions. These partitions must then be assigned to network sites in an allocation process. Because data usage and access changes by applications in a dynamic environment, migration strategies are necessary to redistribute the data. In order for data distribution to reflect current usage patterns of applications, the design process must obtain and accumulate data usage information from applications.This dissertation first details the predicate fragmentation (PF) model. The core of the model is the PF tree that has been developed and implemented to store and maintain usage information. User predicates, obtained from application queries, are inserted into the tree and primitive predicates can be identified from the tree. These primitive predicates define the fragmentation from which a data distribution can be determined. Predicate insertion and pruning operations are essential to the maintenance of the tree structure.A methodology that uses the PF model to obtain a partitioning, allocation and migration strategy is then outlined. The fragments identified from the PF trees are aggregated into partitions that are then assigned to individual network sites using a site access allocation strategy. A dynamic migration strategy then uses changes in the PF trees to identify the data that must be migrated to a new site in order to accommodate the changing application environment.The implementation of the geographic data distribution methodology is referred to as GEODDIS. The methodology was tested and evaluated using a mineral occurrence application called GEOMINE which was developed with the ArcInfo GIS. The results indicate that geographic data distribution performs well when successive applications have similar data usage requirements. The implementation of the geographic data distribution methodology is referred to as GEODDIS. The methodology was tested and evaluated using a mineral occurrence application called GEOMINE which was developed with the ArcInfo GIS. The results indicate that geographic data distribution performs well when successive applications have similar data usage requirements. For applications with very different data usage patterns, the performance decreases to the worst case scenario where all the data must be transferred to the site where it is used. The tree pruning and data migration operations are essential to maintaining a PF tree structure and distribution that reflects the current data usage of applications.

APA, Harvard, Vancouver, ISO, and other styles

25

Wikström, Alexander, Mark Thomson, and Lolita Mageramova. "Virtual Private Networks: : A feasibility study of secure communications between remote locations." Thesis, Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE), 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:hh:diva-24550.

Full text

Abstract:

Virtual Private Networks (VPNs) are an integral part of protecting company communications from unauthorized viewing, replication or manipulation. In order for employees to remotely conduct business in an effective and secure manner from a branch location or while traveling, Virtual Private Networks can be viewed as an absolute necessity. Starting with a certain set of network communication requirements, our project's hypothesis was that the most suitable VPN implementation for Cheap Flats (a fictitious company we created) would be an IPSec client VPN. Included in the report are basic definitions, implementations and tests for three different types of VPNs that were used to confirm this hypothesis: 1) Site-to-site: Tunnel mode connection between VPN gateways. The process of encrypting and transferring data between networks is transparent to end-users. [1] 2) IPSec client: Network Layer VPN for both network-to-network and remote-access deployments. End-users will need to run either Cisco or Open Source VPN software on their PCs. 3) Clientless SSL: “Remote-access VPN technology that provides Presentation Layer encryption services for Applications through local redirection on the client.” [2] VPN communications are established using a browser rather than specific software installed on the end-user’s device. The test results from the above VPN implementations have been published and comparisons were made between the different types of VPNs regarding the time taken to apply network device/end-user configurations, expenses incurred in procuring additional equipment/software to implement the VPN (if any), impact on end-users, scalability and lastly, the overall functionality of the VPN solution as it relates to the day-to-day business operations. Following the testing phase, a discussion of the merits and drawbacks of each of the VPN implementations was drafted. After which, a final recommendation was presented regarding the VPN solution that best fit the needs of the hypothetical company described in the paper.

APA, Harvard, Vancouver, ISO, and other styles

26

Tang, Jia. "QoS-driven adaptive resource allocation for mobile wireless communications and networks." [College Station, Tex. : Texas A&M University, 2006. http://hdl.handle.net/1969.1/ETD-TAMU-1050.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Kim, Hyoungshick. "Complex network analysis for secure and robust communications." Thesis, University of Cambridge, 2012. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.610134.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Miller, Mark Henry Bruce. "The optimum communications architecture for deep level gold mining." Diss., Pretoria : [s.n.], 2000. http://upetd.up.ac.za/thesis/available/etd-01122007-124105/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Locquet, Alexandre Daniel. "Chaotic optical communications using delayed feedback systems." Available online, Georgia Institute of Technology, 2005, 2005. http://etd.gatech.edu/theses/available/etd-01102006-133806/.

Full text

Abstract:

Thesis (Ph. D.)--Electrical and Computer Engineering, Georgia Institute of Technology, 2006.
Bertrand Boussert, Committee Member ; Douglas B. Williams, Committee Member ; William T. Rhodes, Committee Member ; Yves Berthelot, Committee Member ; David S. Citrin, Committee Chair.

APA, Harvard, Vancouver, ISO, and other styles

30

Kulkarni, Narayan J. "Design and implementation of a communications package to network a group of microcomputers /." Online version of thesis, 1985. http://hdl.handle.net/1850/9047.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

DeJean, Gerald Reuben. "Design of compact antennas in multilayer technology for wireless communications : WLAN applications." Available online, Georgia Institute of Technology, 2005, 2004. http://etd.gatech.edu/theses/available/etd-12092004-162859/unrestricted/dejean%5Fgerald%5Fr%5F200505%5Fmast.pdf.

Full text

Abstract:

Thesis (M. S.)--Electrical and Computer Engineering, Georgia Institute of Technology, 2005.
Joy Laskar, Committee Member ; Manos Tentzeris, Committee Member ; John Papapolymerou, Committee Chair. Includes bibliographical references.

APA, Harvard, Vancouver, ISO, and other styles

32

Saad, Mohamed Elsayed Mostafa Luo Zhi-Quan. "Design of optical networks: performance bounds, complexity and algorithms /." *McMaster only, 2004.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

33

Chan, Kam Chau Tony. "Design of all-optical networks and web hosting service." HKBU Institutional Repository, 2005. http://repository.hkbu.edu.hk/etd_ra/637.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Veenendaal, Bert. "The distribution of geographic information systems data in a computer communications network." Curtin University of Technology, School of Computing, 1999. http://espace.library.curtin.edu.au:80/R/?func=dbin-jump-full&object_id=9877.

Full text

Abstract:

Geographic information systems (GIS) are developing in a rapidly expanding distributed environment. With the ever-increasing growth of computer networks and the Internet in particular, it is imperative that GIS take advantage of distributed data technologies to provide users and applications with shared and improved access to geographic data.Geographic data distribution design is concerned with determining what data gets placed at which computer network sites and involves the issues of data partitioning, allocation and dynamic migration. Partitioning is concerned with how data, or fragments of the data, are apportioned to partitions. These partitions must then be assigned to network sites in an allocation process. Because data usage and access changes by applications in a dynamic environment, migration strategies are necessary to redistribute the data. In order for data distribution to reflect current usage patterns of applications, the design process must obtain and accumulate data usage information from applications.This dissertation first details the predicate fragmentation (PF) model. The core of the model is the PF tree that has been developed and implemented to store and maintain usage information. User predicates, obtained from application queries, are inserted into the tree and primitive predicates can be identified from the tree. These primitive predicates define the fragmentation from which a data distribution can be determined. Predicate insertion and pruning operations are essential to the maintenance of the tree structure.A methodology that uses the PF model to obtain a partitioning, allocation and migration strategy is then outlined. The fragments identified from the PF trees are aggregated into partitions that are then assigned to individual network sites using a site access allocation strategy. A dynamic migration strategy then uses changes in the PF ++
trees to identify the data that must be migrated to a new site in order to accommodate the changing application environment.The implementation of the geographic data distribution methodology is referred to as GEODDIS. The methodology was tested and evaluated using a mineral occurrence application called GEOMINE which was developed with the ArcInfo GIS. The results indicate that geographic data distribution performs well when successive applications have similar data usage requirements. The implementation of the geographic data distribution methodology is referred to as GEODDIS. The methodology was tested and evaluated using a mineral occurrence application called GEOMINE which was developed with the ArcInfo GIS. The results indicate that geographic data distribution performs well when successive applications have similar data usage requirements. For applications with very different data usage patterns, the performance decreases to the worst case scenario where all the data must be transferred to the site where it is used. The tree pruning and data migration operations are essential to maintaining a PF tree structure and distribution that reflects the current data usage of applications.

APA, Harvard, Vancouver, ISO, and other styles

35

Hsiao, Hsu-Feng. "Multimedia streaming congestion control over heterogeneous networks : from distributed computation and end-to-end perspectives /." Thesis, Connect to this title online; UW restricted, 2005. http://hdl.handle.net/1773/5946.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Yuen, Siu Yu. "Routing and time-slot assignment algorithms and connection management in photonic circuit switched networks /." View abstract or full-text, 2005. http://library.ust.hk/cgi/db/thesis.pl?ELEC%202005%20YUEN.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Yu, Sam Shaokai. "Performance analysis and call control procedures in high-speed multimedia personal wireless communications /." Title page, abstract and contents only, 1999. http://web4.library.adelaide.edu.au/theses/09PH/09phy936.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Chen, An. "Buffer-efficient RTA algorithms in optical TDM networks /." View abstract or full-text, 2007. http://library.ust.hk/cgi/db/thesis.pl?ECED%202007%20CHENA.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Igumbor, Osedum Peter. "A proxy approach to protocol interoperability within digital audio networks." Thesis, Rhodes University, 2010. http://hdl.handle.net/10962/d1004852.

Full text

Abstract:

Digital audio networks are becoming the preferred solution for the interconnection of professional audio devices. Prominent amongst their advantages are: reduced noise interference, signal multiplexing, and a reduction in the number of cables connecting networked devices. In the context of professional audio, digital networks have been used to connect devices including: mixers, effects units, preamplifiers, breakout boxes, computers, monitoring controllers, and synthesizers. Such networks are governed by protocols that define the connection management rocedures, and device synchronization processes of devices that conform to the protocols. A wide range of digital audio network control protocols exist, each defining specific hardware requirements of devices that conform to them. Device parameter control is achieved by sending a protocol message that indicates the target parameter, and the action that should be performed on the parameter. Typically, a device will conform to only one protocol. By implication, only devices that conform to a specific protocol can communicate with each other, and only a controller that conforms to the protocol can control such devices. This results in the isolation of devices that conform to disparate protocols, since devices of different protocols cannot communicate with each other. This is currently a challenge in the professional music industry, particularly where digital networks are used for audio device control. This investigation seeks to resolve the issue of interoperability between professional audio devices that conform to different digital audio network protocols. This thesis proposes the use of a proxy that allows for the translation of protocol messages, as a solution to the interoperability problem. The proxy abstracts devices of one protocol in terms of another, hence allowing all the networked devices to appear as conforming to the same protocol. The proxy receives messages on behalf of the abstracted device, and then fulfills them in accordance with the protocol that the abstracted device conforms to. Any number of protocol devices can be abstracted within such a proxy. This has the added advantage of allowing a common controller to control devices that conform to the different protocols.

APA, Harvard, Vancouver, ISO, and other styles

40

Tsang, Chi-kai Alex. "A study of distribution channels for computer communications products in Hong Kong /." [Hong Kong : University of Hong Kong], 1993. http://sunzi.lib.hku.hk/hkuto/record.jsp?B13497832.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Bilbeisi, Hana. "Time-slotted scheduling for agile all-photonics networks : performance and complexity." Thesis, McGill University, 2007. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=112558.

Full text

Abstract:

Schedulers in optical switches are still electronic, the performance of these units has a significant impact on the performance of the network and could form a bottleneck in high speed networks, such as AAPN. Four time-slotted scheduling algorithms are investigated in this study, PIM, iSlip, PHM and Adapted-SRA. The study addresses the performance of AAPN for each of the algorithms, and evaluates the hardware complexity, estimating the running time of the algorithms. Performance measures were collected from an OPNET model, designed to emulate AAPN. Furthermore, hardware complexity and timing constraints were evaluated through hardware simulations, for iSlip, and through analysis for the rest of the algorithms. iSlip confirmed its feasibility by meeting the 10us timing constraint set by AAPN. The study revealed the superiority of iSlip and PHM over PIM and Adapted-SRA.

APA, Harvard, Vancouver, ISO, and other styles

42

Lee, Seung Min. "Application of coding techniques to multiple access schemes with contention." Diss., Georgia Institute of Technology, 1990. http://hdl.handle.net/1853/14716.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Chonbodeechalermroong, Yongyut School of Electrical Engineering UNSW. "Simple star multihop optical network." Awarded by:University of New South Wales. School of Electrical Engineering, 2001. http://handle.unsw.edu.au/1959.4/20328.

Full text

Abstract:

A new multihop wavelength-division multiplexed (WDM) optical network designed for uniform traffic with two wavelengths per node that can give the maximum throughput and minimum delay is proposed. It is called a 'Simple Star' multihop optical network. This network has good characteristics in traffic balance and small average number of hops. Moreover, Simple Star can be used together with multiple star couplers to reduce the number of wavelength used. Furthermore, unlike most existing networks, this network does not impose an upper limit to the number of nodes. Another interesting pattern is Simple Star with Center Node (Simple Star CN) particularly for prime numbers of nodes. It can be shown that the average number of hops of Simple Star (normal plus CN) is in between those of Shufflenet and Kautz, but the throughput and delay are better. An associated network called Simple Star Shared Channel (Simple Star SC) for two transceivers per node is also presented and it can be used together with multiple star couplers to reduce the number of wavelengths. An example of a 16-node Simple Star SC shows that the number of wavelengths used can be 8 times less than that in the normal Simple Star network. The Shared Channel simulation model is based on the concept of CSMA/CD (Carrier Sense Multiple Access with Collision Detection).

APA, Harvard, Vancouver, ISO, and other styles

44

Smith, Craig Scott. "Implementing pipelined circuit switching on the PICA aligned offset cube topology." Thesis, Georgia Institute of Technology, 1996. http://hdl.handle.net/1853/13362.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Lim, Hiam Hiok. "Intelligent quality of service algorithms for high speed networks." Monash University, School of Computer Science and Software Engineering, 2002. http://arrow.monash.edu.au/hdl/1959.1/8275.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Tsang, Chi-kai Alex, and 曾志佳. "A study of distribution channels for computer communications products in Hong Kong." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1993. http://hub.hku.hk/bib/B31265832.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Alston, Katherine Yvette. "A heuristic on the rearrangeability of shuffle-exchange networks." CSUSB ScholarWorks, 2004. https://scholarworks.lib.csusb.edu/etd-project/2521.

Full text

Abstract:

The algorithms which control network routing are specific to the network because the algorithms are designed to take advantage of that network's topology. The "goodness" of a network includes such criteria as a simple routing algorithm and a simple routing algorithm would increase the use of the shuffle-exchange network.

APA, Harvard, Vancouver, ISO, and other styles

48

Barbosa, Manuel Romano dos Santos Pinto. "Traffic management and control of automated guided vehicles using artificial neural networks." Thesis, University of Warwick, 1997. http://wrap.warwick.ac.uk/4200/.

Full text

Abstract:

An industrial traffic management and control system based on Automated Guided Vehicles faces several combined problems. Decisions must be made concerning which vehicles will respond, or are allocated to each of the transport orders. Once a vehicle is allocated a transport order, a route has to be selected that allows it to reach its target location. In order for the vehicle to move efficiently along the selected route it must be provided with the means to recognise and adapt to the changing characteristics of the path it must follow. When several vehicles are involved these decisions are interrelated and must take into account the coordination of the movements of the vehicles in order to avoid collisions and maximise the performance of the transport system. This research concentrates on the problem of routing the vehicles that have already been assigned destinations associated with transport orders. In nearly all existing AGV systems this problem is simplified by considering there to be a fixed route between source and destination workstations. However if the system is to be used more efficiently, and particularly if it must support the requirements of modern manufacturing strategies, such as Justin- Time and Flexible Manufacturing Systems, of moving very small batches more frequently, then there is a need for a system capable of dealing with the increased complexity of the routing problem. The consideration of alternative paths between any two workstations together with the possibility of other vehicles blocking routes while waiting at a particular location, increases enormously the number of alternatives that must be considered in order to identify the routes for each vehicle leading to an optimum solution. Current methods used to solve this type of problem do not provide satisfactory solutions for all cases, which leaves scope for improvement. The approach proposed in this work takes advantage of the use of Backpropagation Artificial Neural Networks to develop a solution for the routing problem. A novel aspect of the approach implemented is the use of a solution derived for routing a single vehicle in a physical layout when some pieces of track are set as unavailable, as the basis for the solution when several vehicles are involved. Another original aspect is the method developed to deal with the problem of selecting a route between two locations based on an analysis of the conditions of the traffic system, when each movement decision has to be made. This lead to the implementation of a step-by-step search of the available routes for each vehicle. Two distinct phases can be identified in the approach proposed. First the design of a solution based on an ANN to solve the single vehicle case, and subsequently the development and testing of a solution for a multi-vehicle case. To test and implement these phases a specific layout was selected, and an algorithm was implemented to generate the data required for the design of the ANN solution. During the development of alternative solutions it was found that the addition of simple rules provided a useful means to overcome some of the limitations of the ANN solution, and a "hybrid" solution was originated. Numerous computer simulations were performed to test the solutions developed against alternatives based on the best published heuristic rules. The results showed that while it was not possible to generate a globally optimal solution, near optimal solutions could be obtained and the best hybrid solution was marginally better than the best of the currently available heuristic rules.

APA, Harvard, Vancouver, ISO, and other styles

49

Jiang, Qiangfeng. "ALGORITHMS FOR FAULT TOLERANCE IN DISTRIBUTED SYSTEMS AND ROUTING IN AD HOC NETWORKS." UKnowledge, 2013. http://uknowledge.uky.edu/cs_etds/16.

Full text

Abstract:

Checkpointing and rollback recovery are well-known techniques for coping with failures in distributed systems. Future generation Supercomputers will be message passing distributed systems consisting of millions of processors. As the number of processors grow, failure rate also grows. Thus, designing efficient checkpointing and recovery algorithms for coping with failures in such large systems is important for these systems to be fully utilized. We presented a novel communication-induced checkpointing algorithm which helps in reducing contention for accessing stable storage to store checkpoints. Under our algorithm, a process involved in a distributed computation can independently initiate consistent global checkpointing by saving its current state, called a tentative checkpoint. Other processes involved in the computation come to know about the consistent global checkpoint initiation through information piggy-backed with the application messages or limited control messages if necessary. When a process comes to know about a new consistent global checkpoint initiation, it takes a tentative checkpoint after processing the message. The tentative checkpoints taken can be flushed to stable storage when there is no contention for accessing stable storage. The tentative checkpoints together with the message logs stored in the stable storage form a consistent global checkpoint. Ad hoc networks consist of a set of nodes that can form a network for communication with each other without the aid of any infrastructure or human intervention. Nodes are energy-constrained and hence routing algorithm designed for these networks should take this into consideration. We proposed two routing protocols for mobile ad hoc networks which prevent nodes from broadcasting route requests unnecessarily during the route discovery phase and hence conserve energy and prevent contention in the network. One is called Triangle Based Routing (TBR) protocol. The other routing protocol we designed is called Routing Protocol with Selective Forwarding (RPSF). Both of the routing protocols greatly reduce the number of control packets which are needed to establish routes between pairs of source nodes and destination nodes. As a result, they reduce the energy consumed for route discovery. Moreover, these protocols reduce congestion and collision of packets due to limited number of nodes retransmitting the route requests.

APA, Harvard, Vancouver, ISO, and other styles

50

Farmer, Jason Z. "Multi-objective routing optimization for multiple level priority and preemption in multi-tiered networks." Link to electronic thesis, 2006. http://www.wpi.edu/Pubs/ETD/Available/etd-121806-235007/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic '100503 Computer Communications Networks'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles