Rozprawy doktorskie na temat „Computer network”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Sprawdź 50 najlepszych rozpraw doktorskich naukowych na temat „Computer network”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Przeglądaj rozprawy doktorskie z różnych dziedzin i twórz odpowiednie bibliografie.
Alexander, David. "A Network Metadata Infrastructure for Locating Network Devices". Ohio University / OhioLINK, 2004. http://www.ohiolink.edu/etd/view.cgi?ohiou1088176648.
Pełny tekst źródłaBrande, Julia K. Jr. "Computer Network Routing with a Fuzzy Neural Network". Diss., Virginia Tech, 1997. http://hdl.handle.net/10919/29685.
Pełny tekst źródłaPh. D.
Duff, Kevin Craig. "Network-layer reservation TDM for ad-hoc 802.11 networks". Thesis, Rhodes University, 2008. http://eprints.ru.ac.za/1146/.
Pełny tekst źródłaBurchett, Ian. "Quantifying Computer Network Security". TopSCHOLAR®, 2011. http://digitalcommons.wku.edu/theses/1118.
Pełny tekst źródłaSomalingam, Ramesh Ramvel. "Network performance monitoring for multimedia networks". Thesis, McGill University, 1996. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=23939.
Pełny tekst źródłaKim, Anthony Eli. "On network coding capacity : matroidal networks and network capacity regions". Thesis, Massachusetts Institute of Technology, 2010. http://hdl.handle.net/1721.1/62657.
Pełny tekst źródłaCataloged from PDF version of thesis.
Includes bibliographical references (p. 68-70).
One fundamental problem in the field of network coding is to determine the network coding capacity of networks under various network coding schemes. In this thesis, we address the problem with two approaches: matroidal networks and capacity regions. In our matroidal approach, we prove the converse of the theorem which states that, if a network is scalar-linearly solvable then it is a matroidal network associated with a representable matroid over a finite field. As a consequence, we obtain a correspondence between scalar-linearly solvable networks and representable matroids over finite fields in the framework of matroidal networks. We prove a theorem about the scalar-linear solvability of networks and field characteristics. We provide a method for generating scalar-linearly solvable networks that are potentially different from the networks that we already know are scalar-linearly solvable. In our capacity region approach, we define a multi-dimensional object, called the network capacity region, associated with networks that is analogous to the rate regions in information theory. For the network routing capacity region, we show that the region is a computable rational polytope and provide exact algorithms and approximation heuristics for computing the region. For the network linear coding capacity region, we construct a computable rational polytope, with respect to a given finite field, that inner bounds the linear coding capacity region and provide exact algorithms and approximation heuristics for computing the polytope. The exact algorithms and approximation heuristics we present are not polynomial time schemes and may depend on the output size.
by Anthony Eli Kim.
M.Eng.
Geha, Abbas. "Computer enhanced network design". Thesis, University of Sussex, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.344069.
Pełny tekst źródłaVega, Juan Carlos. "Computer network operations methodology". Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2004. http://library.nps.navy.mil/uhtbin/hyperion/04Mar%5FVega.pdf.
Pełny tekst źródłaPost, David L. "Network Management: Assessing Internet Network-Element Fault Status Using Neural Networks". Ohio : Ohio University, 2008. http://www.ohiolink.edu/etd/view.cgi?ohiou1220632155.
Pełny tekst źródłaDahlgren, Jeremy. "Efficient failure detection protocols for point-to-point communication networks /". Online version of thesis, 2004. https://ritdml.rit.edu/dspace/handle/1850/2752.
Pełny tekst źródłaOtten, Fred. "Network simulation for professional audio networks". Thesis, Rhodes University, 2015. http://hdl.handle.net/10962/d1017935.
Pełny tekst źródłaSundaresan, Latha. "Simple network management protocol /". Online version of thesis, 1995. http://hdl.handle.net/1850/12254.
Pełny tekst źródłaKusetoğulları, Hüseyin. "Network routing optimisation and effective multimedia transmission to enhance QoS in communication networks". Thesis, University of Warwick, 2012. http://wrap.warwick.ac.uk/46802/.
Pełny tekst źródłaZhao, Wenrui. "Routing and Network Design in Delay Tolerant Networks". Diss., Georgia Institute of Technology, 2006. http://hdl.handle.net/1853/14085.
Pełny tekst źródłaXie, Jing. "A Temporal Network Calculus for Performance Analysis of Computer Networks". Doctoral thesis, Norges teknisk-naturvitenskapelige universitet, Institutt for elektronikk og telekommunikasjon, 2011. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-14619.
Pełny tekst źródłaHall, Kristopher Joseph. "Thwarting Network Stealth Worms in Computer Networks through Biological Epidemiology". Diss., Virginia Tech, 2006. http://hdl.handle.net/10919/27726.
Pełny tekst źródłaPh. D.
McKenzie, Neil R. "The Cranium network interface architecture : support for message passing on adaptive packet routing networks /". Thesis, Connect to this title online; UW restricted, 1997. http://hdl.handle.net/1773/6874.
Pełny tekst źródłaJannotti, John 1974. "Network layer support for overlay networks". Thesis, Massachusetts Institute of Technology, 2002. http://hdl.handle.net/1721.1/29274.
Pełny tekst źródłaIncludes bibliographical references (p. 98-103).
Overlay networks are virtual networks formed by cooperating nodes that share an underlying physical network. They represent a flexible and deployable approach for applications to obtain new network semantics without modification of the underlying network, but they suffer from efficiency concerns. This thesis presents two new primitives for implementation in the network layer (i.e., the routers of the physical network). These primitives support the efficient operation and construction of overlay networks. Packet Reflection allows end hosts to request that routers perform specialized routing and duplication for certain packets. Path Painting allows multiple end hosts to determine where their disparate paths to a rendezvous point meet, in order to facilitate overlay topology building that reflects the topology of the underlying network. Both primitives can be incrementally deployed for incremental benefit. This thesis describes a variety applications of these primitives: application level multicast systems with various semantics, an extended Internet Indirect Infrastructure with latency benefits over the original proposal, and an extension to Chord which would allows faster lookups. Experimental results on simulated topologies indicate that when all routers support the proposed primitives, less that 5% overhead (in terms of link usage and latency) remains in two common overlay network usage scenarios. In addition, the benefits gained from deployment are significant even at low deployment levels. At approximately 25% deployment, the primitives have reduced overhead by over 50%. When intelligent deployment strategies are used, link usage overhead is less than 30% at less than 10% deployment. Finally, the results indicate that these benefits affect the area local to the deployed routers, providing a deployment incentive to independent networks.
by John Jannotti.
Ph.D.
Kim, MinJi Ph D. Massachusetts Institute of Technology. "Network coding for robust wireless networks". Thesis, Massachusetts Institute of Technology, 2012. http://hdl.handle.net/1721.1/71276.
Pełny tekst źródłaThis electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from student submitted PDF version of thesis.
Includes bibliographical references (p. 157-167).
Wireless networks and communications promise to allow improved access to services and information, ubiquitous connectivity, and mobility. However, current wireless networks are not well-equipped to meet the high bandwidth and strict delay requirements of future applications. Wireless networks suffer from frequent losses and low throughput. We aim to provide designs for robust wireless networks. This dissertation presents protocols and algorithms that significantly improve wireless network performance and effectively overcome interference, erasures, and attacks. The key idea behind this dissertation is in understanding that wireless networks are fundamentally different from wired networks, and recognizing that directly applying techniques from wired networks to wireless networks limits performance. The key ingredient underlying our algorithms and protocols is network coding. By recognizing the algebraic nature of information, network coding breaks the convention of routing networks, and allows mixing of information in the intermediate nodes and routers. This mixing has been shown to have numerous performance benefits, e.g. increase in throughput and robustness against losses and failures. We present three protocols and algorithms, each using network coding to harness a different characteristic of the wireless medium. We address the problem of interference, erasures, and attacks in wireless networks with the following network coded designs. -- Algebraic NC exploits strategic interference to provide a distributed, randomized code construction for multi-user wireless networks. Network coding framework simplifies the multi-user wireless network model, and allows us to describe the multi-user wireless networks in an algebraic framework. This algebraic framework provides a randomized, distributed code construction, which we show achieves capacity for multicast connections as well as a certain set of non-multicast connections. -- TCP/NC efficiently and reliably delivers data over unreliable lossy wireless networks. TCP, which was designed for reliable transmission over wired networks, often experiences severe performance degradation in wireless networks. TCP/NC combines network coding's erasure correction capabilities with TCP's congestion control mechanism and reliability. We show that TCP/NC achieves significantly higher throughput than TCP in lossy networks; therefore, TCP/NC is well suited for reliable communication in lossy wireless networks. -- Algebraic Watchdog takes advantage of the broadcast nature of wireless networks to provide a secure global self-checking network. Algebraic Watchdog allows nodes to detect malicious behaviors probabilistically, and police their neighbors locally using overheard messages. Unlike traditional detection protocols which are receiver-based, this protocol gives the senders an active role in checking the nodes downstream. We provide a trellis-based inference algorithm and protocol for detection, and analyze its performance. The main contribution of this dissertation is in providing algorithms and designs for robust wireless networks using network coding. We present how network coding can be applied to overcome the challenges of operating in wireless networks. We present both analytical and simulation results to support that network coded designs, if designed with care, can bring forth significant gains, not only in terms of throughput but also in terms of reliability, security, and robustness.
by MinJi Kim.
Ph.D.
Ray, Gavin Peter. "Computer network analysis and optimisation". Thesis, University of Plymouth, 1993. http://hdl.handle.net/10026.1/1639.
Pełny tekst źródłaLomas, Thomas Mark Angus. "Aspects of computer network security". Thesis, University of Cambridge, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.241051.
Pełny tekst źródłaNAVAS, 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.
Pełny tekst źródłaTELECOMUNICAÇÕ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.
Alsebae, Alaa. "Network coding for computer networking". Thesis, University of Warwick, 2014. http://wrap.warwick.ac.uk/72647/.
Pełny tekst źródłaBaronikian, Haig. "Modelling and analysis of a computer conferencing system". Thesis, McGill University, 1987. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=63756.
Pełny tekst źródłaSkaria, Sherin, i Fazely Hamedani Amir Reza. "Network Security Issues, Tools for Testing Security in Computer Network and Development Solution for Improving Security in Computer Network". Thesis, Halmstad University, Halmstad University, Halmstad University, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:hh:diva-4396.
Pełny tekst źródłaNguyen, Thanh Vinh. "Content distribution networks over shared infrastructure a paradigm for future content network deployment /". Access electronically, 2005. http://www.library.uow.edu.au/adt-NWU/public/adt-NWU20060509.094632/index.html.
Pełny tekst źródłaIrwin, Barry Vivian William. "A framework for the application of network telescope sensors in a global IP network". Thesis, Rhodes University, 2011. http://hdl.handle.net/10962/d1004835.
Pełny tekst źródłaCziva, Richard. "Towards lightweight, low-latency network function virtualisation at the network edge". Thesis, University of Glasgow, 2018. http://theses.gla.ac.uk/30758/.
Pełny tekst źródłaalyanbaawi, ashraf. "DESIGN OF EFFICIENT MULTICAST ROUTING PROTOCOLS FOR COMPUTER NETWORKS". OpenSIUC, 2020. https://opensiuc.lib.siu.edu/dissertations/1775.
Pełny tekst źródłaSmeda, Adel Abdullah. "Application of the Hopfield neural network in routing for computer networks". Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp01/MQ39701.pdf.
Pełny tekst źródłaHoltje, Carl. "Security in serverless network environments /". Link to online version, 2004. https://ritdml.rit.edu/dspace/handle/1850/439.
Pełny tekst źródłaLee, Anna H. "Simplified random network codes for multicast networks". Thesis, Massachusetts Institute of Technology, 2005. http://hdl.handle.net/1721.1/33306.
Pełny tekst źródłaIncludes bibliographical references (p. 43).
Network coding is a method of data transmission across a network which involves coding at intermediate nodes. Network coding is particularly attractive for multicast. Building on the work done on random linear network codes, we develop a constrained, simplified code construction suitable for multicast in wireless networks. We analyze bounds on sufficient code size and code success probability via an algebraic framework for network coding. We also present simulation results that compare generalized random network codes with our code construction. Issues unique to the simplified code are explored and a relaxation of the code to improve code performance is discussed.
by Anna H. Lee.
M.Eng.and S.B.
Shi, Xiaomeng Ph D. Massachusetts Institute of Technology. "Energy aware network coding in wireless networks". Thesis, Massachusetts Institute of Technology, 2012. http://hdl.handle.net/1721.1/78533.
Pełny tekst źródłaCataloged from PDF version of thesis.
Includes bibliographical references (p. 97-104).
Energy is one of the most important considerations in designing reliable low-power wireless communication networks. We focus on the problem of energy aware network coding. In particular, we investigate practical energy efficient network code design for wireless body area networks (WBAN). We first consider converge-cast in a star-shaped topology, in which a central base station (BS), or hub, manages and communicates directly with a set of nodes. We then consider a wireless-relay channel, in which a relay node assists in the transmission of data from a source to a destination. This wireless relay channel can be seen as a simplified extended star network, where nodes have relay capabilities. The objective is to investigate the use of network coding in these scenarios, with the goal of achieving reliability under low-energy and lower-power constraints. More specifically, in a star network, we propose a simple network layer protocol, study the mean energy to complete uploads of given packets from the nodes to the BS using a Markov chain model, and show through numerical examples that when reception energy is taken into account, the incorporation of network coding offers reductions in energy use. The amount of achievable gains depends on the number of nodes in the network, the degree of asymmetry in channel conditions experienced by different nodes, and the relative difference between transmitting and receiving power at the nodes. We also demonstrate the compatibility of the proposed scheme with the IEEE 802.15.6 WBAN standard by describing ways of incorporating network coding into systems compliant to the standard. For a wireless relay channel, we explore the strategic use of network coding according to both throughput and energy metrics. In the relay channel, a single source communicates to a single sink through the aid of a half-duplex relay. The fluid flow model is used to describe the case where both the source and the relay are coding, and Markov chain models are proposed to describe packet evolution if only the source or only the relay is coding. Although we do not attempt to explicitly categorize the optimal network coding strategies in the relay channel under different system parameters, we provide a framework for deciding whether and where to code, taking into account of throughput maximization and energy depletion constraints.
by Xiaomeng Shi.
Ph.D.
You, Bo. "Hub-Network for Distance Computation in Large Social Networks". Kent State University / OhioLINK, 2014. http://rave.ohiolink.edu/etdc/view?acc_num=kent1412601464.
Pełny tekst źródłaWells, Daniel David. "Network management for community networks". Thesis, Rhodes University, 2010. http://hdl.handle.net/10962/d1006587.
Pełny tekst źródłaKulkarni, Shrinivas Bhalachandra. "The simulation studies on a behaviour based trust routing protocol for ad hoc networks". Diss., Online access via UMI:, 2006.
Znajdź pełny tekst źródłaChaltseva, Anna. "Network state estimation in wireless multi-hop networks". Licentiate thesis, Luleå tekniska universitet, Datavetenskap, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-26357.
Pełny tekst źródłaGodkänd; 2012; 20111215 (anncha); LICENTIATSEMINARIUM Ämnesområde: Datorkommunikation/Computer Networking Examinator: Docent Evgeny Osipov, Institutionen för system- och rymdteknik, Luleå tekniska universitet Diskutant: Universitetslektor Olov Schelén, Luleå tekniska universitet samt Xarepo AB, Luleå Tid: Måndag den 20 februari 2012 kl 10.00 Plats: A1514 Demostudion, Luleå tekniska universitet
Ali, Dana, i Goran Kap. "Statistical Analysis of Computer Network Security". Thesis, KTH, Matematisk statistik, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-129948.
Pełny tekst źródłaMontgomery, Michael Charles. "Managing complexity in large-scale networks via flow and network aggregation /". Digital version accessible at:, 1998. http://wwwlib.umi.com/cr/utexas/main.
Pełny tekst źródłaDahal, Subharoj. "Implementing a redundant solution to improve network system reliability at XYZ Hospital". Online version, 2009. http://www.uwstout.edu/lib/thesis/2009/2009dahals.pdf.
Pełny tekst źródłaZhao, Xiaogeng. "An adaptive approach for optimized opportunistic routing over Delay Tolerant Mobile Ad hoc Networks". Thesis, Rhodes University, 2008. http://hdl.handle.net/10962/d1004822.
Pełny tekst źródłaZhou, Yuanyuan. "Energy-efficient protocols and topologies for sensor and personal-area networks". Online access for everyone, 2007. http://www.dissertations.wsu.edu/Dissertations/Summer2007/y_zhou_072307.pdf.
Pełny tekst źródłaMalmgren, Göran. "Network Planning of Single Frequency Broadcasting Networks". Licentiate thesis, KTH, Signaler, sensorer och system, 1996. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-28559.
Pełny tekst źródłaAhmed, Ebad. "Delay gains from network coding in wireless networks". Thesis, Massachusetts Institute of Technology, 2007. http://hdl.handle.net/1721.1/41253.
Pełny tekst źródłaIncludes bibliographical references (p. 73-77).
We consider a single-hop cellular wireless system with a single source (base station) broadcasting a stream of incoming files to multiple receivers over stochastic time-varying channels with non-zero erasure probabilities. The base station charges a price per receiver per file with the aim of maximizing its profit. Customers who wish to transmit files to the receivers decide to enter the system based on the price, the queuing delay, and the utility derived from the transaction. We look at network coding and scheduling as possible strategies for file transmission, and obtain approximate characterizations of the optimal customer admission rate, optimal price and the optimal base-station profit as functions of the first and second moments of the service time processes under mild assumptions. We show that network coding leads to significant gains in the base station profits as compared to scheduling, and also demonstrate that the optimal network coding window size is highly insensitive to the number of receivers, which suggests that pricing and coding decisions can be decoupled. We also investigate the behavior of network coding in the case where the number of receivers is sufficiently large, and derive scaling laws for the asymptotic gains from network coding. We subsequently propose a way to extend our analysis of single-source, multiple-receiver systems to multiple-source, multiple-receiver systems in general network topologies and obtain explicit characterizations of the file download completion time under network coding and scheduling, also taking into account the effects of collisions and interference among concurrent packet transmissions by two or more sources.
(cont.) Our formulation allows us to model multi-hop networks as a series of single-hop multiple-source, multiple-receiver systems, which provides a great deal of insight into the workings of larger and denser multi-hop networks such as overlay networks and peer-to-peer systems, and appears to be a promising application of network coding in such networks in the future.
by Ebad Ahmed.
M.Eng.
Kulakov, Anton. "Multiprocessing neural network simulator". Thesis, University of Southampton, 2013. https://eprints.soton.ac.uk/348420/.
Pełny tekst źródłaSchuhart, Russell G. "Hacking social networks examining the viability of using computer network attack against social networks". Thesis, Monterey, Calif. : Naval Postgraduate School, 2007. http://bosun.nps.edu/uhtbin/hyperion.exe/07Mar%5FSchuhart.pdf.
Pełny tekst źródłaThesis Advisor(s): David Tucker. "March 2007." Includes bibliographical references (p. 55-56). Also available in print.
Al-Amoudi, Ahmed. "Evaluation of virtual routing appliances as routers in a virtual environment /". Online version of thesis, 2008. http://hdl.handle.net/1850/7544.
Pełny tekst źródłaFan, Bo Electrical Engineering & Telecommunications Faculty of Engineering UNSW. "Sharing network measurements on peer-to-peer networks". Publisher:University of New South Wales. Electrical Engineering & Telecommunications, 2007. http://handle.unsw.edu.au/1959.4/40762.
Pełny tekst źródłaShafie, Sharil Idzwan. "Active modules of bipartite metabolic network". Thesis, University of Birmingham, 2018. http://etheses.bham.ac.uk//id/eprint/8635/.
Pełny tekst źródłaUmeh, Njideka Adaku. "Security architecture methodology for large net-centric systems". Diss., Rolla, Mo. : University of Missouri-Rolla, 2007. http://scholarsmine.mst.edu/thesis/Umeh_09007dcc8049b3f0.pdf.
Pełny tekst źródłaVita. The entire thesis text is included in file. Title from title screen of thesis/dissertation PDF file (viewed December 6, 2007) Includes bibliographical references (p. 60-63).