To see the other types of publications on this topic, follow the link: Computer network design.
Dissertations / Theses on the topic 'Computer network design'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Computer network design.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
1
Geha, Abbas. "Computer enhanced network design." Thesis, University of Sussex, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.344069.
Full text
2
NAVAS, JOSE RICARDO PORTILHO. "TOPICS IN COMPUTER NETWORK DESIGN." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 1985. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=14053@1.
Full textAbstract:
CONSELHO NACIONAL DE DESENVOLVIMENTO CIENTÍFICO E TECNOLÓGICOTELECOMUNICAÇÕES BRASILEIRAS S/A
O trabalho propõe um método heurístico para a análise de modelos de redes de filas fechadas, denominado algoritmo linearizado de redes simplificado (ALS), o qual é o resultado de uma simplificação no Algoritmo Linearizador original. O ALS mostrou-se interessante na análise de redes de grande porte (redes com mais de 10 classes de usuários) por apresentar um tempo de processamento bastante pequeno, se comparado com o tempo do Algoritmo Linearizador e de outros algoritmos existentes na literatura. É apresentado também a definição de um método aproximado para a integração dos mecanismos de encaminhamento e controle de fluxo em redes de computadores comutados por pacote. Resultados de simulação mostram que com esse esquema é possível utilizar de uma maneira bastante eficiente os recursos da rede.
This work presents a heuristic method called Simplifield Linearizer Algorithm for analyisis of closed queueing network models. The proposed method from some simplifications introduced in the original Linearizer Algorithm. The Simplified Linearizer Algorithm is quite useful in the analysis of large network (network with more than ten user classes) due to its smaller processing time as compared with the processing time required by the Linearizer Algorithm and others describ in the literature. Also, this work defines an approximate method for the integration of the routing and flow control mechanism in packet switching computer networks. Simulation results shom that this integration scheme improves the efficiency associated with the utilization of the network resources.
3
Alexander, David. "A Network Metadata Infrastructure for Locating Network Devices." Ohio University / OhioLINK, 2004. http://www.ohiolink.edu/etd/view.cgi?ohiou1088176648.
Full text
4
Zhao, Wenrui. "Routing and Network Design in Delay Tolerant Networks." Diss., Georgia Institute of Technology, 2006. http://hdl.handle.net/1853/14085.
Full textAbstract:
Delay tolerant networks (DTNs) are a class of emerging networks that exhibit significantly different characteristics from today's Internet, such as intermittent connectivity, large delay, and high loss rates. DTNs have important applications in disaster relief, military, rural Internet access, environmental sensing and surveillance, interplanetary communication, underwater sensing, and vehicular communication. While not the common case for networking, DTNs represent some of the most critical cases, where the ability to communicate can make a huge difference for human lives.
Supporting effective communication in DTNs, however, is challenging. First, with intermittent connectivity, DTNs are often extremely limited in capacity. Second, given resource limitations and uncertainty in DTNs, it is critical to deliver data efficiently and robustly. The situation is especially acute for multicast which sends data to multiple destinations.
This thesis seeks to address these two issues. To enhance network capacity in DTNs, we propose a message ferrying scheme that exploits the use of special mobile nodes (called message ferries) and controlled device mobility to deliver data. Message ferries are utilized to transport data via mobility between sources and destinations. We develop a foundation for the control of the mobility of message ferries, and nodes if possible, to cooperatively deliver data under a variety of conditions. We also study another approach which deploys new nodes called throwboxes to enhance capacity. Throwboxes are small and inexpensive wireless devices. By relaying data between mobile nodes, throwboxes are able to create data transfer opportunities that otherwise would not exist. We systematically investigate the issues of deployment and routing, and develop algorithms for various deployment and routing approaches. Based on extensive evaluation, we obtain several findings to guide the design and operation of throwbox-augmented DTNs.
To address the issue of efficient and robust data delivery, we focus on DTN multicasting. Given the unique characteristics of DTNs, traditional solutions such as IP multicast can not be simply ported to DTNs. We identify the limitations of IP multicast semantics in DTNs and define new semantic models for DTN multicast. Based on these semantic models, we develop and evaluate several multicast routing algorithms with different routing strategies.
5
alyanbaawi, ashraf. "DESIGN OF EFFICIENT MULTICAST ROUTING PROTOCOLS FOR COMPUTER NETWORKS." OpenSIUC, 2020. https://opensiuc.lib.siu.edu/dissertations/1775.
Full textAbstract:
Multicasting can be done in two different ways: source based tree approach andshared tree approach. Shared tree approach is preferred over source-based treeapproach because in the later construction of minimum cost tree per source is neededunlike a single shared tree in the former approach. However, in shared tree approach asingle core needs to handle the entire traffic load resulting in degraded multicastperformance. Besides, it also suffers from „single point failure‟. Multicast is acommunication between one or multiple senders and multiple receivers, which used asa way of sending IP datagrams to a group of interested receivers in one transmission.Core-based trees major concerns are core selection and core as single point of failure.The problem of core selection is to choose the best core or cores in the network toimprove the network performance.In this dissertation we propose 1) a multiple core selection approach for core-based tree multicasting, senders can select different cores to have an efficient loadbalanced multicore multicasting. It will overcome any core failure as well. 2) Novel andefficient schemes for load shared multicore multicasting are presented. Multiple coresare selected statically, that is, independent of any existing multicast groups and also theselection process is independent of any underlying unicast protocol. Some of theselected cores can be used for fault- tolerant purpose also to guard against any possible core failures. 3) We have presented two novel and efficient schemes forgroup-based load shared multicore multicasting in which members of a multicast groupuse the same core tree for their multicasting. 4) We also presented two schemes aim atachieving low latency multicasting along with load sharing for delay sensitive multicastapplications. Besides, we have presented a unique approach for core migration, whichuses two very important parameters, namely, depth of a core tree and pseudo diameterof a core. One noteworthy point from the viewpoint of fault tolerance is that the degreeof fault-tolerance can be enhanced from covering single point-failure to any number ofcore failures.
6
Zang, Joanna Q. "Design of a redundancy protocol /." free to MU campus, to others for purchase, 2003. http://wwwlib.umi.com/cr/mo/fullcit?p1418080.
Full text
7
Liu, Changlei, and 劉長雷. "Bluetooth network design." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2003. http://hub.hku.hk/bib/B29188635.
Full text
8
Morley, George David. "Analysis and design of ring-based transport networks." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2001. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/NQ60329.pdf.
Full text
9
Crowley, Patrick. "Design and analysis of architectures for programmable network processing systems /." Thesis, Connect to this title online; UW restricted, 2003. http://hdl.handle.net/1773/6991.
Full text
10
Al-Mousa, Yamin Samir. "MAC/routing design for under water sensor networks /." Online version of thesis, 2007. http://hdl.handle.net/1850/4496.
Full text
11
Long, Weili. "On the topology design of hose-model VPN networks /." View abstract or full-text, 2008. http://library.ust.hk/cgi/db/thesis.pl?ECED%202008%20LONG.
Full text
12
Robeson, Bridget M. "A local area network & wide area network design." Master's thesis, This resource online, 1992. http://scholar.lib.vt.edu/theses/available/etd-12232009-020117/.
Full text
13
Fang, Jun-Wai 1960. "Design and performance evaluation of a proposed backbone network for PC-Networks interconnection." Thesis, The University of Arizona, 1989. http://hdl.handle.net/10150/276941.
Full textAbstract:
This thesis is concerned with the design of a high-speed backbone network which provides a high bandwidth interconnection for various Personal Computer Networks (PC-Networks) with an integrated service of voice and data. With the advanced technology of optical fiber as the transmission medium, several different existing topologies and protocols are discussed for the backbone network design. The token ring protocol is simulated and evaluated to find out a suitable buffer size and the length of voice and data packet for backbone network. The Network II.5 simulation tool is applied to simulate the token ring simulation model with different parameters. The Network Interface Unit (NIU) is designed from the simulation results with a cost-effective consideration.
14
Lee, Myung Sub 1953. "PC-based design of network management package for broadband network." Thesis, The University of Arizona, 1988. http://hdl.handle.net/10150/276772.
Full textAbstract:
The description of a Network Management Package (NMP) for Packet Communications Units (PCUs) in a Local Area Network (LAN) is presented. The LAN consists of a Sytek LocalNet 20, a Sytek System 2000, a Sytek System 6000, and a Concord Data Systems Token/Net. The NMP accesses and controls the local and remote PCUs on the networks. The communication interface software module is responsible for opening and closing the session between the PC and PCU ports. The NMP supports a set of operations used by a network manager to control and manage the network PCUs. The user uses the NMP to integrate each PCU and check and set its attributes. The NMP was developed to run in the Computer Engineering Research Laboratory and in the University of Arizona broadband cable plant. The NMP allows different PCUs (local or remote) to check and modify PCU's attributes while users work on their own PCUs. (Abstract shortened with permission of author.)
15
Zhu, Yong. "Routing, Resource Allocation and Network Design for Overlay Networks." Diss., Georgia Institute of Technology, 2006. http://hdl.handle.net/1853/14017.
Full textAbstract:
Overlay networks have been the subject of significant research and practical interest recently in addressing the inefficiency and ossification of the current Internet. In this thesis, we cover various aspects of overlay network design, including overlay routing algorithms, overlay network assignment and multihomed overlay networks. We also examine the behavior of overlay networks under a wide range of network settings and identify several key factors that affect the performance of overlay networks. Based on these findings, practical design guidelines are also given. Specifically, this thesis addresses the following problems:
1) Dynamic overlay routing: We perform an extensive simulation study to investigate the performance of available bandwidth-based dynamic overlay routing from three important aspects: efficiency, stability, and safety margin. Based on the findings, we propose a hybrid routing scheme that achieves good performance in all three aspects. We also examine the effects of several factors on overlay routing performance, including network load, traffic variability, link-state staleness, number of overlay hops, measurement errors, and native sharing effects.
2) Virtual network assignment: We investigate the virtual network (VN) assignment problem in the scenario of network virtualization. Specifically, we develop a basic VN assignment scheme without reconfiguration and use it as the building block for all other advanced algorithms. Subdividing heuristics and adaptive optimization strategies are presented to further improve the performance. We also develop a selective VN reconfiguration scheme that prioritizes the reconfiguration for the most critical VNs. 3) Overlay network configuration tool for PlanetLab: We develop NetFinder, an automatic overlay network configuration tool to efficiently allocate PlanetLab resources to individual overlays. NetFinder continuously monitors the resource utilization of PlanetLab and accepts a user-defined overlay topology as input and selects the set of PlanetLab nodes and their interconnection for the user overlay. 4) Multihomed overlay network: We examine the effectiveness of combining multihoming and overlay routing from the perspective of an overlay service provider (OSP). We focus on the corresponding design problem and examine, with realistic network performance and pricing data, whether the OSP can provide a network service that is profitable, better (in terms of round-trip time), and less expensive than the competing native ISPs.
16
Richter, John Peter Frank. "An investigation into the design and implementation of an internet-scale network simulator." Thesis, Rhodes University, 2009. http://hdl.handle.net/10962/d1004840.
Full textAbstract:
Simulation is a complex task with many research applications - chiey as a research tool, to test and evaluate hypothetical scenarios. Though many simulations execute similar operations and utilise similar data, there are few simulation frameworks or toolkits that allow researchers to rapidly develop their concepts. Those that are available to researchers are limited in scope, or use old technology that is no longer useful to modern researchers. As a result of this, many researchers build their own simulations without a framework, wasting time and resources on a system that could already cater for the majority of their simulation's requirements. In this work, a system is proposed for the creation of a scalable, dynamic-resolution network simulation framework that provides scalable scope for researchers, using modern technologies and languages. This framework should allow researchers to rapidly develop a broad range of semantically-rich simulations, without the necessity of superor grid-computers or clusters. Design and implementation are discussed and alternative network simulations are compared to the proposed framework. A series of simulations, focusing on malware, is run on an implementation of this framework, and the results are compared to expectations for the outcomes of those simulations. In conclusion, a critical review of the simulator is made, considering any extensions or shortcomings that need to be addressed.
17
Kolinska, Anna. "Performance Evaluation Tools for Interconnection Network Design." PDXScholar, 1994. https://pdxscholar.library.pdx.edu/open_access_etds/4764.
Full textAbstract:
A methodology is proposed for designing performance optimized computer systems. The methodology uses software tools created for performance monitoring and evaluation of parallel programs, replacing actual hardware with a simulator modeling the hardware under development. We claim that a software environment can help hardware designers to make decisions on the architectural design level. A simulator executes real programs and provides access to performance monitors from user's code. The performance monitoring system collects data traces when running the simulator and the performance analysis module extracts performance data of interest, that are later displayed with visualization tools. Key features of our methodology are "plug and play" simulation and modeling hardware/software interaction during the process of hardware design. The ability to use different simulators gives the user flexibility to configure the system for the required functionality, accuracy and simulation performance. Evaluation of hardware performance based on results obtained by modeling hardware/software interaction is crucial for designing performance optimized computer systems. We have developed a software system, based on our design methodology, for performance evaluation of multicomputer interconnection networks. The system, called the Parsim Common Environment (PCE), consists of an instrumented network simulator that executes assembly language instructions, and performance analysis and visualization modules. Using PCE we have investigated a specific network design example. The system helped us spot performance problems, explain why they happened and find the ways to solve them. The obtained results agreed with observations presented in the literature, hence validating our design methodology and the correctness of the software performance evaluation system for hardware designs. Using software tools a designer can easily check different design options and evaluate the obtained performance results without the overhead of building expensive prototypes. With our system, data analysis that required 10 man-hours to complete manually took just a couple of seconds on a Sparc-4 workstation. Without experimentation with the simulator and the performance evaluation environment one might build an expensive hardware prototype, expecting improved performance, and then be disappointed with poorer results than expected. Our tools help designers spot and solve performance problems at early stages of the hardware design process.
18
AmirFaiz, Farhad 1959. "DESIGN OF A COMMUNICATION PORT AND IMPLEMENTATION OF A RECONFIGURABLE MEDIA TRANSLATION GATEWAY (COMPUTER, CONNECTION, NETWORK, BRIDGE, COMPATIBLE)." Thesis, The University of Arizona, 1986. http://hdl.handle.net/10150/275529.
Full text
19
Bailey, Scott P. "Neural network design on the SRC-6 reconfigurable computer." Thesis, Monterey, Calif. : Naval Postgraduate School, 2006. http://bosun.nps.edu/uhtbin/hyperion.exe/06Dec%5FBailey.pdf.
Full textAbstract:
Thesis (M.S. in Electrical Engineering)--Naval Postgraduate School, December 2006.Thesis Advisor(s): Douglas J. Fouts. "December 2006." Includes bibliographical references (p. 105-106). Also available in print.
20
Luan, Hao. "Peer-to-peer content distribution network design /." View abstract or full-text, 2007. http://library.ust.hk/cgi/db/thesis.pl?ECED%202007%20LUAN.
Full text
21
Diler, Timur. "Network processors and utilizing their features in a multicast design." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2004. http://library.nps.navy.mil/uhtbin/hyperion/04Mar%5FDiler.pdf.
Full textAbstract:
Thesis (M.S. in Computer Science and M.S. in Electrical Engineering)--Naval Postgraduate School, March 2004.Thesis advisor(s): Su Wen, Jon Butler. Includes bibliographical references (p. 53-54). Also available online.
22
Ke, Yu-Kung. "Scalable mechanisms for IP QoS-based routing with performance objective." Diss., Georgia Institute of Technology, 2002. http://hdl.handle.net/1853/13753.
Full text
23
Viswanathan, Lakshmi. "Genetic algorithms for uncapacitated network design." Thesis, Massachusetts Institute of Technology, 1995. http://hdl.handle.net/1721.1/36022.
Full textAbstract:
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1995.Includes bibliographical references (leaves 124).
by Viswanathan Lakshmi.
M.S.
24
Hassan, Hoda Mamdouh. "A Reference Model and Architecture for Future Computer Networks." Diss., Virginia Tech, 2010. http://hdl.handle.net/10919/27916.
Full textAbstract:
The growing need for a trustworthy Future Internet demands evolutionary approaches unfettered by legacy constrains and concepts. The networking community is calling for new network architectural proposals that address the deficiencies identified in present network realizations, acknowledge the need for a trustworthy IT infrastructure, and satisfy the society's emerging and future requirements. Proposed architectures need to be founded on well-articulated design principles, account for network operational and management complexities, embrace technology and application heterogeneity, regulate network-inherent emergent behavior, and overcome shortcomings attributed to present network realizations.
This dissertation presents our proposed clean-slate Concern-Oriented Reference Model (CORM) for architecting future computer networks. CORM stands as a guiding framework from which network architectures can be derived according to specific functional, contextual, and operational requirements or constraints. CORM represents a pioneering attempt within the network realm, and to our knowledge, CORM is the first reference model that is bio-inspired and derived in accordance with the Function-Behavior-Structure (FBS) engineering framework.
CORM conceives a computer network as a software-dependent complex system whose design needs to be attempted in a concern-oriented bottom-up approach along two main dimensions: a vertical dimension addressing structure and configuration of network building blocks; and a horizontal dimension addressing communication and interactions among the previously formulated building blocks. For each network dimension, CORM factors the design space into function, structure, and behavior, applying to each the principle of separation of concerns for further systematic decomposition.
In CORM, the network-building block is referred to as the Network Cell (NC), which represents CORMâ s first basic abstraction. An NC's structure and inherent behavior are bio-inspired, imitating a bacterium cell in a bacteria colony, thus it is capable of adaptation, self-organization and evolution. An NC's functional operation is defined by CORM second basic abstraction; the ACRF framework. The ACRF framework is a conceptual framework for network-concerns derived according to our interpretation of computer network requirement specifications. CORM networks are recursively synthesized in a bottom-up fashion out of CORM NCs. CORM addresses the multi-dimensionality of computer networks by modeling the network structure and behavior using a network structural template (NST), and an information flow model (IFM), respectively. Being developed according to a complex system paradigm, CORM refutes the long endorsed concept of layering, intrinsically accounts for emergent behavior, and ensures system integrity and stability.
As a reference model, CORM is more typical of conventional engineering. Therefore it was validated using the FBS engineering framework. However, the behavior to be realized in CORM-based networks was substantiated and evaluated by deriving CellNet, our proposed CORM-based network architecture. CellNet-compliant protocols' behavioral adaptation and modification were illustrated and evaluated through simulation.
CORM will have a profound impact on the operation and behavior of computer networks composing the Internet. By introducing awareness adaptability and evolvability as network intrinsic features, CORM-based Internet will proactively respond to changes in operational contexts, underlying technologies, and end user requirements. A major direction in CORM future work would be to detail the IFM component.Ph. D.
25
Jardetzky, Paul Wenceslas. "Network file server design for continuous media." Thesis, University of Cambridge, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.241058.
Full text
26
Gummadi, Krishna Phani. "Measurement-driven modeling and design of internet-scale systems /." Thesis, Connect to this title online; UW restricted, 2005. http://hdl.handle.net/1773/6964.
Full text
27
Say, Fatih. "Minimum Concave Cost Multicommodity Network Design." Master's thesis, METU, 2005. http://etd.lib.metu.edu.tr/upload/12606432/index.pdf.
Full textAbstract:
Minimum Concave Cost Multicommodity Network Design Problem arises in many application areas, such as transportation planning, distributed energy system and especially both circuit and packet switching backbone network design. Exact concave optimization algorithms have been developed, but these methods are applicable if the network size is small. Therefore, these problems are usually solved by non-exact iterative methods.
In this thesis work, methods proposed for circuit switching and packet switching network design are evaluated in detail. After a comprehensive literate survey, Yaged&rsquos Linearization, Minoux greedy and Minoux accelerated greedy methods are found to be applicable to circuit switching network design when both solution quality and computational time is considered. Previously, it has been found that Minoux greedy methods may create routings with cycles and in order to eliminate these cycles a modification has been proposed. In this work, this modification is extended and evaluated in detail. Similarly, Gerla and Kleinrock&rsquo
s Concave Branch Elimination, Gersht&rsquo
s greedy and Stacey&rsquo
s Concave Link Elimination methods are investigated within the context of packet switching network design. All of these methods consider aggregate flows on each link simultaneously re-routing more than one commodity in one step. This thesis work also considers an alternative disaggregate approach, where only one commodity is handled at a time. Finally, algorithms proposed for circuit switching network design problem are adapted to the packet switching case and an extensive comparative computational study is performed to point out the best method with respect to time and solution quality for a number of networks and cost structure. Computational results have shown that modification on Minoux greedy to eliminate cycles leads to considerable improvements and the disaggregate approach gives the best result in some networks and cost structure.
28
Lin, Katherine Xiaoyan. "Green optical network design : power optimization of wide area and metropolitan area networks." Thesis, Massachusetts Institute of Technology, 2011. http://hdl.handle.net/1721.1/66434.
Full textAbstract:
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2011.Cataloged from PDF version of thesis.
Includes bibliographical references (p. 133-134).
Advancements in technology are fueling huge growth in network traffic capacity. Demand for low cost, reliable, and high bitrate transmissions grows 40-110% internationally every year. To date, most research has focused on cost minimization of wide area and metropolitan area networks. In this thesis, we concentrate instead on finding scalable WAN designs with respect to power constraints and optimal MAN topologies with minimal capital and operating expenditures. We find optical bypass networks to be most scalable with respect to power consumption, especially when quality of service and network flexibility, reliability, and protection are considered. The power consumption of the standard bypass network can be lowered further through a hybrid design in which whole wavelengths of core, stable traffic between node pairs are routed via direct, fixed lightpaths using patch panelling and unexpected, bursty traffic is switched on a standard optical bypass network. We analyze power distribution among components and find the OXC switch most scalable at each node and O/E/O switches and routers wasteful. Finally, we prove that shortest path and minimum hop routing is power optimal and traffic balanced routing should be avoided. We approximate MAN topologies with regular graphs for tractable analysis. We augment a previous cost-based joint optimization formulation [13] with power expenditure modelling and obtain closed form solutions for optimal node degree and normalized network costs. We find that the optimal node connectivity increases 20-25% due to the added operating expenditures. Normalized network cost and normalized network cost per unit traffic also rise by approximately 25%. Our results show that the Generalized Moore graph with node degree between 0.05N and 0.08N is both power and cost minimal for a purely optical network.
by Katherine Xiaoyan Lin.
M.Eng.
29
Rezaee, Arman. "Network coding, multi-packet reception, and feedback : design tools for wireless broadcast networks." Thesis, Massachusetts Institute of Technology, 2011. http://hdl.handle.net/1721.1/68508.
Full textAbstract:
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2011.Cataloged from PDF version of thesis.
Includes bibliographical references (p. 89-92).
In this thesis, we address the combination of three technologies in wireless broadcast networks: network coding, multi-packet reception (MPR) and feedback. We will primarily discuss the performance of a single-hop network, both with and without these technologies. A single-hop network can be used as a building block for larger and more topologically diverse networks and provides a basis for analyzing the interaction of these mechanisms. Because many applications are interested in speedy transmission of data, we have focused our attention on answering the question of how to optimally use these technologies in order to reduce the overall transmission time. Initially, we consider a fully connected network and show that MPR capability of m can reduce the total time for a file transfer by as much as a factor of m/2 without network coding. We emphasize that a two-fold MPR capability will not reduce the total dissemination time without network coding and is thus ineffective. We also show that no gain can be obtained, if network coding is used without MPR. However the combination of network coding and MPR can reduce the total transfer time by as much as a factor of m. We then consider transmission of a file over a broadcast erasure channel with a potentially large number of receivers. Noting that traditional reliable multicast protocols suffer from the inevitable feedback implosion associated with servicing a large number of receivers, we present a novel feedback protocol dubbed SMART, Speeding Multicast by Acknowledgment Reduction Technique. The protocol involves an asymptotically optimal predictive model which determines a suitable feedback time that assures most receivers have completed the download. We also introduce a new single slot feedback mechanism, which enables any number of receivers to give their feedback simultaneously. We show that scheduling the feedback according to this predictive model and enhancing the protocol by the single slot mechanism reduces the feedback traffic as well as transmission of extraneous coded packets, and will provide a good completion time characteristic for all users. We show that counter to conventional wisdom, Quality of Experience (QoE) of multicast sessions is not sensitive to the number of users, however it is very sensitive to imbalanced effective rate and heterogeneity among users. Furthermore, we show that SMART performs nearly as well as an omniscient transmitter that requires no feedback.
by Arman Rezaee.
S.M.
30
Cheung, Jimmy. "Design and development of a network architecture for a chemical sensor network." Thesis, Massachusetts Institute of Technology, 2005. http://hdl.handle.net/1721.1/91381.
Full textAbstract:
Thesis (M. Eng. and S.B.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2005.Includes bibliographical references (leaf 67).
A real-time continuous chemical sensor network can obtain detailed data to analyze the dynamic behavior of water systems such as a lake. The behaviors of interest to us in Upper Mystic Lake are the effects of stratification on methane water chemistry and the results of water mixing between layers. To monitor the water chemistry, a network of three buoys is populated with various sensors. This paper covers the design implementation of the network architecture for transmitting sensor data between buoys and a shore station. The buoys' sensors and construction are also included.
by Jimmy Cheung.
M.Eng.and S.B.
31
Subramanian, Suvinay. "Ordered Mesh Network Interconnect (OMNI) : design and implementation of in-network coherence." Thesis, Massachusetts Institute of Technology, 2013. http://hdl.handle.net/1721.1/82379.
Full textAbstract:
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2013.Title as it appears in MIT Commencement Exercises program, June 2013: Design and implementation of in-network coherence. Cataloged from PDF version of thesis.
Includes bibliographical references (p. 101-104).
CMOS technology scaling has enabled increasing transistor density on chip. At the same time, multi-core processors that provide increased performance, vis-a'-vis power efficiency, have become prevalent in a power constrained environment. The shared memory model is a predominant paradigm in such systems, easing programmability and increasing portability. However with memory being shared by an increasing number of cores, a scalable coherence mechanism is imperative for these systems. Snoopy coherence has been a favored coherence scheme owing to its high performance and simplicity. However there are few viable proposals to extend snoopy coherence to unordered interconnects - specifically, modular packet-switched interconnects that have emerged as a scalable solution to the communication challenges in the CMP era. This thesis proposes a distributed in-network global ordering scheme that enables snoopy coherence on unordered interconnects. The proposed scheme is realized on a two-dimensional mesh interconnection network, referred to as OMNI (Ordered Mesh Network Interconnect). OMNI is an enabling solution for the SCORPIO processor prototype developed at MIT - a 36-core chip multi-processor supporting snoopy coherence, and fabricated in a commercial 45nm technology. OMNI is shown to be effective, reducing runtime by 36% in comparison to directory and Hammer coherence protocol implementations. The OMNI network achieves an operating frequency of 833 MHz post-layout, occupies 10% of the chip area, and consumes less than 100mW of power.
by Suvinay Subramanian.
S.M.
32
Oh, Khoon Wee. "Wireless network security : design considerations for an enterprise network /." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2004. http://library.nps.navy.mil/uhtbin/hyperion/04Dec%5FOh.pdf.
Full text
33
Srinivasan, Sridhar. "Design and Use of Managed Overlay Networks." Diss., Georgia Institute of Technology, 2007. http://hdl.handle.net/1853/14501.
Full textAbstract:
As the role of the Internet has been steadily gaining in importance,
overlays are increasingly being used to provide new services and to
deploy older ones. Some of the services for which overlays have been
proposed include multicast, quality of service (QoS), search, and
resilient networks. The use of overlays, in turn, has led to more
interest in improving their performance. The performance of an overlay
network depends significantly on how the network is structured, i.e.,
the placement of the nodes in the underlying network topology, the
links between the overlay nodes and the access links of these nodes.
This thesis focuses on algorithms for improving the performance of
34
Harper, Scott Jeffery. "Design of a hardware interface for a high-speed parallel network." Thesis, This resource online, 1994. http://scholar.lib.vt.edu/theses/available/etd-01102009-063929/.
Full text
35
Ingco, Divinagracia I. (Divinagracia Ilagan). "Network design problems for improving facility locations." Thesis, Massachusetts Institute of Technology, 1989. http://hdl.handle.net/1721.1/14494.
Full textAbstract:
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1989.Includes bibliographical references (leaf 116).
by Divinagracia I. Ingco.
M.S.
36
Johnston, Matthew R. (Matthew Ryan). "A robust optimization approach to network design." Thesis, Massachusetts Institute of Technology, 2010. http://hdl.handle.net/1721.1/62451.
Full textAbstract:
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2010.Cataloged from PDF version of thesis.
Includes bibliographical references (p. 91-93).
This thesis addresses the problem of logical topology design for optical backbone networks subject to traffic following a Gaussian distribution. The network design problem is broken into three tasks: traffic routing, capacity allocation, and link placement. The routing and capacity allocation problems are formulated as a convex mathematical program. To extend this formulation to discrete optimization problems, such as the link placement sub-problem, it is reformulated as a mixed integer linear program (MILP) by extending tools from robust optimization to Gaussian variables. Bounds are presented to relate capacity allocation to the probability of traffic overflow on a link. Lastly, the link placement subproblem is formulated as an MILP and network topologies for deterministic traffic are compared with those for stochastic traffic. Additionally, this thesis presents a scheme in which a dedicated backup network is designed to provide protection from random link failures. Upon a link failure in the primary network, traffic is rerouted through a preplanned path in the backup network. We introduce a novel approach for dealing with random link failures, in which probabilistic survivability guarantees are provided to limit capacity over-provisioning. We show that the optimal backup routing strategy in this respect depends on the reliability of the primary network. Specifically, as primary links become less likely to fail, the optimal backup networks employ more resource sharing amongst backup paths. We apply results from the field of robust optimization to formulate an ILP for the design and capacity provisioning of these backup networks. We then propose a simulated annealing heuristic to solve this problem for large-scale networks, and we present simulation results to verify our analysis on optimal backup networks.
by Matthew R. Johnston.
S.M.
37
Sulaiman, Md Nasir. "The design of a neural network compiler." Thesis, Loughborough University, 1994. https://dspace.lboro.ac.uk/2134/25628.
Full textAbstract:
Computer simulation is a flexible and economical way for rapid prototyping and concept evaluation with Neural Network (NN) models. Increasing research on NNs has led to the development of several simulation programs. Not all simulations have the same scope. Some simulations allow only a fixed network model and some are more general. Designing a simulation program for general purpose NN models has become a current trend nowadays because of its flexibility and efficiency. A proper programming language specifically for NN models is preferred since the existing high-level languages such as C are for NN designers from a strong computer background. The program translations for NN languages come from combinations which are either interpreter and/or compiler. There are also various styles of programming languages such as a procedural, functional, descriptive and object-oriented. The main focus of this thesis is to study the feasibility of using a compiler method for the development of a general-purpose simulator - NEUCOMP that compiles the program written as a list of mathematical specifications of the particular NN model and translates it into a chosen target program. The language supported by NEUCOMP is based on a procedural style. Information regarding the list of mathematical statements required by the NN models are written in the program. The mathematical statements used are represented by scalar, vector and matrix assignments. NEUCOMP translates these expressions into actual program loops. NEUCOMP enables compilation of a simulation program written in the NEUCOMP language for any NN model, contains graphical facilities such as portraying the NN architecture and displaying a graph of the result during training and finally to have a program that can run on a parallel shared memory multi-processor system.
38
Kandah, Farah Issa. "A Secure and Reliable Interference-Aware Wireless Mesh Network Design." Diss., North Dakota State University, 2012. https://hdl.handle.net/10365/26479.
Full textAbstract:
A wireless mesh network (WMN) is a multihop wireless network consisting of a large number of wireless nodes of which some are called gateway nodes and connected with a wired network. Wireless mesh network have attracted much research attention recently due to its flexibility, low-cost and robustness, which facilitate its usability in many potential applications, including last-mile broadband Internet access, neighborhood gaming, Video-on-Demand (VoD), distributed file backup, video surveillance, etc. The broadcast nature, the lack of infrastructure as well as the flexible deployment nature of wireless mesh networks make it different from wired networks, therefore more attention in designing the wireless mesh network is needed to maintain a good performance of this promising technology. We, in this study, investigate the wireless mesh network design taking into consideration three design factors seeking an improvement in the network performance by reducing the interference influence in the network, improving the network reliability to satisfy more requests, and securing the network against malicious eavesdropping attacks. Our design is presented into three sub-problems; sub-problem (1), which seeks an interference-aware robust topology control scheme, sub-problem (2) which seeks a multipath routing scheme, and sub-problem (3) which seeks a secure key management scheme. Through simulations and comparisons with previous work, we show that our proposed solutions outperform previous schemes in providing a better network performance in terms of reducing the network interference, satisfying more number of requests and increasing the network resistance to malicious eavesdropping attacks.
39
Carlini, Nicholas. "Evaluation and Design of Robust Neural Network Defenses." Thesis, University of California, Berkeley, 2018. http://pqdtopen.proquest.com/#viewpdf?dispub=10931076.
Full textAbstract:
Neural networks provide state-of-the-art results for most machine learning tasks. Unfortunately, neural networks are vulnerable to test-time evasion attacks adversarial examples): inputs specifically designed by an adversary to cause a neural network to misclassify them. This makes applying neural networks in security-critical areas concerning. In this dissertation, we introduce a general framework for evaluating the robustness of neural network through optimization-based methods. We apply our framework to two different domains, image recognition and automatic speech recognition, and find it provides state-of-the-art results for both. To further demonstrate the power of our methods, we apply our attacks to break 14 defenses that have been proposed to alleviate adversarial examples. We then turn to the problem of designing a secure classifier. Given this apparently-fundamental vulnerability of neural networks to adversarial examples, instead of taking an existing classifier and attempting to make it robust, we construct a new classifier which is provably robust by design under a restricted threat model. We consider the domain of malware classification, and construct a neural network classifier that is can not be fooled by an insertion adversary, who can only insert new functionality, and not change existing functionality. We hope this dissertation will provide a useful starting point for both evaluating and constructing neural networks robust in the presence of an adversary.
40
Saeed, Bahghtar Ibraheem. "Design of a wireless intelligent fuzzy controller network." Thesis, University of Huddersfield, 2014. http://eprints.hud.ac.uk/id/eprint/24569/.
Full textAbstract:
Since the first application of fuzzy logic in the field of control engineering, fuzzy logic control has been successfully employed in controlling a wide variety of applications, such as commercial appliances, industrial automation, robots, traffic control, cement kilns and automotive engineering. The human knowledge on controlling complex and non-linear processes can be incorporated into a controller in the form of linguistic expressions. Despite these achievements, however, there is still a lack of an empirical or analytical design study which adequately addresses a systematic auto-tuning method. Indeed, tuning is one of the most crucial parts in the overall design of fuzzy logic controllers and it has become an active research field. Various techniques have been utilised to develop algorithms to fine-tune the controller parameters from a trial and error method to very advanced optimisation techniques. The structure of fuzzy logic controllers is not straightforward as is the case in PID controllers. In addition, there is also a set of parameters that can be adjusted, and it is not always easy to find the relationship between the parameters and the controller performance measures. Moreover, in general, controllers have a wide range of setpoints; changing from one value to another requiring the controller parameters to be re-tuned in order to maintain a satisfactory performance over the entire range of setpoints. This thesis deals with the design and implementation of a new intelligent algorithm for fuzzy logic controllers in a wireless network structure. The algorithm enables the controllers to learn about their plants and systematically tune their gains. The algorithm also provides the capability of retaining the knowledge acquired during the tuning process. Furthermore, this knowledge is shared on the network through a wireless communication link with other controllers. Based on the relationships between controller gains and the closed-loop characteristics, an auto-tuning algorithm is developed. Simulation experiments using standard second order systems demonstrate the effectiveness of the algorithm with respect to auto-tuning, tracking setpoints and rejecting external disturbances. Furthermore, a zero overshoot response is produced with improvements in the transient and the steady state responses. The wireless network structure is implemented using LabVIEW by composing a network of several fuzzy controllers. The results demonstrate that the controllers are able to retain and share the knowledge.
41
You, N. Z. "The design of a microcomputer workstation in a network computer system." Thesis, University of Manchester, 1985. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.356422.
Full text
42
Omarouayache, Salim. "A graph theoretic approach to transputer network design for computer vision." Thesis, City University London, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.281815.
Full text
43
Li, Liang. "Energy-efficient design and implementation of turbo codes for wireless sensor network." Thesis, University of Southampton, 2012. https://eprints.soton.ac.uk/345593/.
Full textAbstract:
The objective of this thesis is to apply near Shannon limit Error-Correcting Codes (ECCs), particularly the turbo-like codes, to energy-constrained wireless devices, for the purpose of extending their lifetime. Conventionally, sophisticated ECCs are applied to applications, such as mobile telephone networks or satellite television networks, to facilitate long range and high throughput wireless communication. For low power applications, such as Wireless Sensor Networks (WSNs), these ECCs were considered due to their high decoder complexities. In particular, the energy efficiency of the sensor nodes in WSNs is one of the most important factors in their design. The processing energy consumption required by high complexity ECCs decoders is a significant drawback, which impacts upon the overall energy consumption of the system. However, as Integrated Circuit (IC) processing technology is scaled down, the processing energy consumed by hardware resources reduces exponentially. As a result, near Shannon limit ECCs have recently begun to be considered for use in WSNs to reduce the transmission energy consumption [1,2]. However, to ensure that the transmission energy consumption reduction granted by the employed ECC makes a positive improvement on the overall energy efficiency of the system, the processing energy consumption must still be carefully considered. The main subject of this thesis is to optimise the design of turbo codes at both an algorithmic and a hardware implementation level for WSN scenarios. The communication requirements of the target WSN applications, such as communication distance, channel throughput, network scale, transmission frequency, network topology, etc, are investigated. Those requirements are important factors for designing a channel coding system. Especially when energy resources are limited, the trade-off between the requirements placed on different parameters must be carefully considered, in order to minimise the overall energy consumption. Moreover, based on this investigation, the advantages of employing near Shannon limit ECCs in WSNs are discussed. Low complexity and energy-efficient hardware implementations of the ECC decoders are essential for the target applications.
44
Gomoluch, Mark Stephen. "The design of a low-cost local area network." Thesis, Cardiff University, 1989. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.329796.
Full text
45
Angelopoulos, Georgios Ph D. Massachusetts Institute of Technology. "Energy-aware network coding circuit and system design." Thesis, Massachusetts Institute of Technology, 2011. http://hdl.handle.net/1721.1/66021.
Full textAbstract:
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2011.Cataloged from PDF version of thesis.
Includes bibliographical references (p. 73-78).
Network Coding (NC) has been shown to provide several advantages in communication networks in terms of throughput, data robustness and security. However, its applicability to networks with resource constrained nodes, like Body Area Networks (BANs), has been questioned due to its complexity requirements. Proposed NC implementations are based on high-end CPUs and GPUs, consuming hundreds of Watts, without providing enough insight about its energy requirements. As more and more mobile devices, sensors and other low power systems are used in modern communication protocols, a highly efficient and optimized implementation of NC is required. In this work, an effort is made to bridge NC theory with ultra low power applications. For this reason, an energy-scalable, low power accelerator is designed in order to explore the minimum energy requirements of NC. Based on post-layout simulation results using a TSMC 65nm process, the proposed encoder consumes 22.15 uW at 0.4V, achieving a processing throughput of 80 MB/s. These numbers reveal that NC can indeed be incorporated into resource constrained networks with battery-operated or even energy scavenging nodes. Apart from the hardware design, a new partial packet recovery mechanism based on NC, called PPRNC, is proposed. PPRNC exploits information contained in partial packets, similarly to existing Hybrid-ARQ schemes, but with a PHY-agnostic approach. Minimization of the number of retransmitted packets saves transmission energy and results in higher total network throughput, making PPRNC an attractive candidate for energy constrained networks, such as BANs, as well as modern, high-speed wireless mesh networks. The proposed mechanism is analyzed and implemented using commercial development boards, validating its ability to extract information contained from partial packets.
by Georgios Angelopoulos.
S.M.
46
Muller, Casey Maloney Rosales 1980. "Design and performance of a wired viral network." Thesis, Massachusetts Institute of Technology, 2003. http://hdl.handle.net/1721.1/29699.
Full textAbstract:
Thesis (M.Eng. and S.B.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2003.Includes bibliographical references (p. 47-51).
We constructed a network that fully distributes access to audiovisual information. The information is apportioned among a family of machines. We call it Viral because it can scale in an ad hoc way and the addition of new nodes adds to the overall network capability. The network uses multiple multicast for distribution, acquires content from the broadcast television system, and makes viewing video content a more user-centric activity. In this thesis we address the performance of this network in comparison with other ways of providing the same spatio-temporal diversity of access to a body of work. We first provide some theoretical estimate of the capacity, and then we show how the network we built approaches those limits. This is done in terms of a presumed distribution of what the user wants.
by Casey Maloney Rosales Muller.
M.Eng.and S.B.
47
Anjali, Tricha. "DiffServ/MPLS Network Design and Management." Diss., Georgia Institute of Technology, 2004. http://hdl.handle.net/1853/5191.
Full textAbstract:
The MultiProtocol Label Switching (MPLS) framework is used in many networks to provide efficient load balancing which distributes the traffic for efficient Quality of Service (QoS) provisioning in the network. If the MPLS framework is combined with Differentiated Services (DiffServ) architecture, together they can provide aggregate-based service differentiation and QoS. The combined use of DiffServ and MPLS in a network is called DiffServ-aware Traffic Engineering (DS-TE). Such DiffServ-based MPLS networks demand development of efficient methods for QoS provisioning. In this thesis, an automated manager for management of these DiffServ-based MPLS networks is proposed. This manager, called Traffic Engineering Automated Manager (TEAM), is a centralized authority for adaptively managing a DiffServ/MPLS domain and it is responsible for dynamic bandwidth and route management. TEAM is designed to provide a novel and unique architecture capable of managing large scale MPLS/DiffServ domains without any human interference. TEAM constantly monitors the network state and reconfigures the network for efficient handling of network events. Under the umbrella of TEAM, new schemes for Label Switched Path (LSP) setup/teardown, traffic routing, and network measurement are proposed and evaluated through simulations. Also, extensions to include Generalized MPLS (GMPLS) networks and inter-domain management are proposed.
48
O'Neal, Matthew R. "A design comparison between IPv4 and IPv6 in the context of MYSEA, and implementation of an IPv6 MYSEA prototype." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2003. http://library.nps.navy.mil/uhtbin/hyperion-image/03Jun%5FONeal.pdf.
Full textAbstract:
Thesis (M.S. in Computer Science)--Naval Postgraduate School, June 2003.Thesis advisor(s): Cynthia E. Irvine, Thuy D. Nguyen. Includes bibliographical references (p. 49-50). Also available online.
49
Savage, Stefan R. "Protocol design in an uncooperative Internet /." Thesis, Connect to this title online; UW restricted, 2002. http://hdl.handle.net/1773/6995.
Full text
50
Cloud, Jason M. (Jason Michael). "Cross-layer design with multi-packet reception, MAC, and network coding in multi-hop networks." Thesis, Massachusetts Institute of Technology, 2011. http://hdl.handle.net/1721.1/66024.
Full textAbstract:
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2011.Cataloged from PDF version of thesis.
Includes bibliographical references (p. 87-90).
A cross-layer design approach is proposed that can be used to optimize the cooperative use of multi-packet reception (MPR) and network coding. A simple and intuitive model is constructed for the behavior of an opportunistic network coding scheme called COPE proposed by Katti et. al., MPR, the 802.11 MAC, and their combination. The model is then applied to key small canonical topology components and their larger counterparts. The results obtained from this model match the available experimental results with fidelity. Using this model, fairness allocation by the 802.11 MAC is shown to significantly impede performance and cause non-monotonic saturation behaviors; hence, a new MAC approach is devised that not only substantially improves throughput by providing monotonic saturation but provides fairness to flows of information rather than to nodes. Using this improved MAC, it is shown that cooperation between network coding and MPR achieves super-additive gains of up to 6.3 times that of routing alone with the standard 802.11 MAC. Furthermore, the model is extended to analyze the improved MAC's asymptotic, delay, and throughput behaviors. Finally, it is shown that although network performance is reduced under substantial asymmetry or limited implementation of MPR to a central/bottleneck node, there are some important practical cases, even under these conditions, where MPR, network coding, and their combination provide significant gains.
by Jason M. Cloud.
S.M.