To see the other types of publications on this topic, follow the link: Network processors Computer architecture. Computer networks.
Dissertations / Theses on the topic 'Network processors Computer architecture. Computer networks'
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 'Network processors Computer architecture. Computer networks.'
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
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
2
Batra, Shalini. "An efficient algorithm and architecture for network processors." Master's thesis, Mississippi State : Mississippi State University, 2007. http://library.msstate.edu/etd/show.asp?etd=etd-07052007-194448.
Full text
3
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.
4
Boivie, Victor. "Network Processor specific Multithreading tradeoffs." Thesis, Linköping University, Department of Electrical Engineering, 2005. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-2940.
Full textAbstract:
Multithreading is a processor technique that can effectively hide long latencies that can occur due to memory accesses, coprocessor operations and similar. While this looks promising, there is an additional hardware cost that will vary with for example the number of contexts to switch to and what technique is used for it and this might limit the possible gain of multithreading.
Network processors are, traditionally, multiprocessor systems that share a lot of common resources, such as memories and coprocessors, so the potential gain of multithreading could be high for these applications. On the other hand, the increased hardware required will be relatively high since the rest of the processor is fairly small. Instead of having a multithreaded processor, higher performance gains could be achieved by using more processors instead.
As a solution, a simulator was built where a system can effectively be modelled and where the simulation results can give hints of the optimal solution for a system in the early design phase of a network processor system. A theoretical background to multithreading, network processors and more is also provided in the thesis.
5
Omundsen, Daniel (Daniel Simon) Carleton University Dissertation Engineering Electrical. "A pipelined, multi-processor architecture for a connectionless server for broadband ISDN." Ottawa, 1992.
Find full text
6
Winig, Robert J. "Conceptual design of a network architecture for a typical manufacturing information system using open systems integration." Thesis, This resource online, 1993. http://scholar.lib.vt.edu/theses/available/etd-07292009-090413/.
Full text
7
Musasa, Mutombo Mike. "Evaluation of embedded processors for next generation asic : Evaluation of open source Risc-V processors and tools ability to perform packet processing operations compared to Arm Cortex M7 processors." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-299656.
Full textAbstract:
Nowadays, network processors are an integral part of information technology. With the deployment of 5G network ramping up around the world, numerous new devices are going to take advantage of their processing power and programming flexibility. Contemporary information technology providers of today such as Ericsson, spend a great amount of financial resources on licensing deals to use processors with proprietary instruction set architecture designs from companies like Arm holdings. There is a new non-proprietary instruction set architecture technology being developed known as Risc-V. There are many open source processors based on Risc-V architecture, but it is still unclear how well an open-source Risc-V processor performs network packet processing tasks compared to an Arm-based processor. The main purpose of this thesis is to design a test model simulating and evaluating how well an open-source Risc-V processor performs packet processing compared to an Arm Cortex M7 processor. This was done by designing a C code simulating some key packet processing functions processing 50 randomly generated 72 bytes data packets. The following functions were tested: framing, parsing, pattern matching, and classification. The code was ported and executed in both an Arm Cortex M7 processor and an emulated open source Risc-V processor. A working packet processing test code was built, evaluated on an Arm Cortex M7 processor. Three different open-source Risc-V processors were tested, Arianne, SweRV core, and Rocket-chip. The execution time of both cases was analyzed and compared. The execution time of the test code on Arm was 67, 5 ns. Based on the results, it can be argued that open source Risc-V processor tools are not fully reliable yet and ready to be used for packet processing applications. Further evaluation should be performed on this topic, with a more in-depth look at the SweRV core processor, at physical open-source Risc-V hardware instead of emulators.Nätverksprocessorer är en viktig byggsten av informationsteknik idag. I takt med att 5G nätverk byggs ut runt om i världen, många fler enheter kommer att kunna ta del av deras kraftfulla prestanda och programerings flexibilitet. Informationsteknik företag som Ericsson, spenderarmycket ekonomiska resurser på licenser för att kunna använda proprietära instruktionsuppsättnings arkitektur teknik baserade processorer från ARM holdings. Det är väldigt kostam att fortsätta köpa licenser då dessa arkitekturer är en byggsten till designen av många processorer och andra komponenter. Idag finns det en lovande ny processor instruktionsuppsättnings arkitektur teknik som inte är licensierad så kallad Risc-V. Tack vare Risc-V har många propietära och öppen källkod processor utvecklats idag. Det finns dock väldigt lite information kring hur bra de presterar i nätverksapplikationer är känt idag. Kan en öppen-källkod Risc-V processor utföra nätverks databehandling funktioner lika bra som en proprietär Arm Cortex M7 processor? Huvudsyftet med detta arbete är att bygga en test model som undersöker hur väl en öppen-källkod Risc-V baserad processor utför databehandlings operationer av nätverk datapacket jämfört med en Arm Cortex M7 processor. Detta har utförts genom att ta fram en C programmeringskod som simulerar en mottagning och behandling av 72 bytes datapaket. De följande funktionerna testades, inramning, parsning, mönster matchning och klassificering. Koden kompilerades och testades i både en Arm Cortex M7 processor och 3 olika emulerade öppen källkod Risc-V processorer, Arianne, SweRV core och Rocket-chip. Efter att ha testat några öppen källkod Risc-V processorer och använt test koden i en ArmCortex M7 processor, kan det hävdas att öppen-källkod Risc-V processor verktygen inte är tillräckligt pålitliga än. Denna rapport tyder på att öppen-källkod Risc-V emulatorer och verktygen behöver utvecklas mer för att användas i nätverks applikationer. Det finns ett behov av ytterligare undersökning inom detta ämne i framtiden. Exempelvis, en djupare undersökning av SweRV core processor, eller en öppen-källkod Risc-V byggd hårdvara krävs.
8
Nguyen, Van Minh. "Wireless Link Quality Modelling and Mobility Management for Cellular Networks." Phd thesis, Telecom ParisTech, 2011. http://tel.archives-ouvertes.fr/tel-00702798.
Full textAbstract:
La qualité de communication dans un réseau sans fil est déterminée par la qualité du signal, et plus précisément par le rapport signal à interférence et bruit. Cela pousse chaque récepteur à se connecter à l'émetteur qui lui donne la meilleure qualité du signal. Nous utilisons la géométrie stochastique et la théorie des extrêmes pour obtenir la distribution de la meilleure qualité du signal, ainsi que celles de interférence et du maximum des puissances reçues. Nous mettons en évidence comment la singularité de la fonction d'affaiblissement modifie leurs comportements. Nous nous intéressons ensuite au comportement temporel des signaux radios en étudiant le franchissement de seuils par un processus stationnaire X (t). Nous démontrons que l'intervalle de temps que X (t) passe au-dessus d'un seuil γ → −∞ suit une distribution exponentielle, et obtenons 'egalement des r'esultats caract'erisant des franchissements par X (t) de plusieurs seuils adjacents. Ces r'esultats sont ensuite appliqu'es 'a la gestion de mobilit'e dans les r'eseaux cellulaires. Notre travail se concentre sur la fonction de 'handover measurement'. Nous identifions la meilleure cellule voisine lors d'un handover. Cette fonction joue un rôle central sur expérience perçue par l'utilisateur. Mais elle demande une coopération entre divers mécanismes de contrôle et reste une question difficile. Nous traitons ce problème en proposant des approches analytiques pour les réseaux émergents de types macro et pico cellulaires, ainsi qu'une approche d'auto- optimisation pour les listes de voisinage utilisées dans les réseaux cellulaires actuels.
9
Cashman, Neil. "SMART : an innovative multimedia computer architecture for processing ATM cells in real-time." Thesis, University of Sussex, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.313965.
Full text
10
Fink, Glenn Allen. "Visual Correlation of Network Traffic and Host Processes for Computer Security." Diss., Virginia Tech, 2006. http://hdl.handle.net/10919/28770.
Full textAbstract:
Much computer communications activity is invisible to the user, happening without explicit permission. When system administrators investigate network communications activities, they have difficulty tracing them back to the processes that cause them. The strictly layered TCP/IP networking model that underlies all widely used, general-purpose operating systems makes it impossible to trace a packet seen on the network back to the processes that are responsible for generating and receiving it. The TCP/IP model separates the concerns of network routing and process ownership so that the layers cannot share the information needed to correlate packets to processes. But knowing what processes are responsible for communications activities can be a great help in determining whether that activity is benign or malicious.
My solution combines a visualization tool, a kernel-level correlation engine, and middleware that ties the two together. My research enables security personnel to visually correlate packets to the processes they belong to helping users determine whether communications are benign or malicious. I present my discoveries about the system administrator community and relate how I created a new correlation technology. I conducted a series of initial interviews with system administrators to clarify the problem, researched available solutions in the literature, identified what was missing, and worked with users to build it. The users were my co-designers as I built a series of prototypes of increasing fidelity and conducted usability evaluations on them. I hope that my work will demonstrate how well the participatory design approach works.
My work has implications for the kernel structure of all operating system kernels with a TCP/IP protocol stack and network model. In light of my research, I hope security personnel will more clearly see sets of communicating processes on a network as basic computational units rather than the individual host computers. If kernel designers incorporate my findings into their work, it will enable much better security monitoring than is possible today making the Internet safer for all.Ph. D.
11
Ritholtz, Lee. "Intelligent text recognition system on a heterogeneous multi-core processor cluster a performance profile and architecture exploration /." Diss., Online access via UMI:, 2009.
Find full textAbstract:
Thesis (M.S.)--State University of New York at Binghamton, Thomas J. Watson School of Engineering and Applied Science, Department of Electrical and Computer Engineering, 2009.Includes bibliographical references.
12
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.
13
Iqneibi, Sami M. Carleton University Dissertation Engineering Electrical. "A blackboard architecture to support network fault diagnosis." Ottawa, 1992.
Find full text
14
Tarigopula, Srivamsi Mohanty Saraju. "A cam-based, high-performance classifier-scheduler for a video network processor." [Denton, Tex.] : University of North Texas, 2008. http://digital.library.unt.edu/permalink/meta-dc-6045.
Full text
15
Gao, Xin. "A space-efficient wireless mesh network : architecture, frequency planning and routing /." View abstract or full-text, 2008. http://library.ust.hk/cgi/db/thesis.pl?ECED%202008%20GAO.
Full text
16
Leung, Yiu-cheung. "A reconfigurable neural network for industrial sensory systems /." Hong Kong : University of Hong Kong, 2000. http://sunzi.lib.hku.hk/hkuto/record.jsp?B23234441.
Full text
17
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
18
Ayvat, Birol. "An evaluation of best effort traffic management of server and agent based active network management (SAAM) architecture." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2003. http://library.nps.navy.mil/uhtbin/hyperion-image/03Mar%5FAyvat.pdf.
Full text
19
Agbeko, Joseph. "Evaluation and application of bloom filters in computer network security /." Connect to resource online, 2009. http://rave.ohiolink.edu/etdc/view?acc_num=ysu1253733230.
Full text
20
Motiwala, Murtaza. "An architecture for network path selection." Diss., Georgia Institute of Technology, 2012. http://hdl.handle.net/1853/43576.
Full textAbstract:
Traditional routing protocols select paths based on static link weights and converge to new paths only when there is an outright reachability failure (such as a link or router failure). This design allows routing scale to hundreds of thousands of nodes, but it comes at the cost of functionality: routing provides only simple, single path connectivity. Networked applications in the wide-area, enterprise, and data center can all benefit from network protocols that allow traffic to be sent over multiple routes en route to a destination. This ability, also called multipath routing, has other significant benefits over single-path routing, such as more efficiently using network resources and recovering more quickly from network disruptions.
This dissertation explores the design of an architecture for path selection in the network and proposes a "narrow waist" interface for networks to expose choice in routing traffic to end systems. Because most networks are also business entities, and are sensitive to the cost of routing traffic in their network, this dissertation also develops a framework for exposing paths based on their cost. For this purpose, this dissertation develops a cost model for routing traffic in a network. In particular, this dissertation presents the following contributions:
* Design of path bits, a "narrow waist" for multipath routing. Our work ties a large number of multipath routing proposals by creating an interface (path bits) for decoupling the multipath routing protocols implemented by the network and end systems
(or other network elements) making a choice for path selection. Path bits permit simple, scalable, and efficient implementations of multipath routing protocols in the network that still provide enough expressiveness for end systems to select alternate paths. We demonstrate that our interface is flexible and leads to efficient network implementations by building prototype implementations on different hardware and
software platforms.
* Design of path splicing, a multipath routing scheme. We develop, path splicing, a multipath routing technique, which uses random perturbations from the shortest path to create exponentially large number of paths with only a linear increase in state in a network. We also develop a simple interface to enable end systems to make path selection decisions. We present various deployment paths for implementing path splicing in both intradomain and interdomain routing on the Internet.
* Design of low cost path-selection framework for a network. Network operators and end systems can have conflicting goals, where the network operators are concerned with saving cost and reducing traffic uncertainty; and end systems favor better performing paths. Exposing choice of routing in the network can thus, create a tension between the network operators and the end systems. We propose a path-selection framework where end systems make path selection decisions based on path performance and networks expose paths to end systems based on their cost to the network. This thesis presents a cost model for routing traffic in a network to enable network operators to reason about "what-if " scenarios and routing traffic on their network.
21
Vangal, Sriram R. "Performance and Energy Efficient Building Blocks for Network-on-Chip Architectures." Licentiate thesis, Linköping : Linköpings universitet, 2006. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-7845.
Full text
22
Srivatsa, Mudhakar. "Security Architecture and Protocols for Overlay Network Services." Diss., Georgia Institute of Technology, 2007. http://hdl.handle.net/1853/16284.
Full textAbstract:
Conventional wisdom suggests that in order to build a secure system, security must be an integral component in the system design. However, cost considerations drive most system designers to channel their efforts on the system's performance, scalability and usability. With little or no emphasis on security, such systems are vulnerable to a wide range of attacks that can potentially compromise confidentiality, integrity and availability of sensitive data. It is often cumbersome to redesign and implement massive systems with security as one of the primary design goals. This thesis advocates a proactive approach that cleanly retrofits security solutions into existing system architectures. The first step in this approach is to identify security threats, vulnerabilities and potential attacks on a system or an application. The second step is to develop security tools in the form of customizable and configurable plug-ins that address these security issues and minimally modify existing system code, while preserving its performance and scalability metrics.
This thesis uses overlay network applications to shepherd through and address challenges involved in supporting security in large scale distributed systems. In particular, the focus is on two popular applications: publish/subscribe networks and VoIP networks. Our work on VoIP networks has for the first time identified and formalized caller identification attacks on VoIP networks. We have identified two attacks: a triangulation based timing attack on the VoIP network's route set up protocol and a flow analysis attack on the VoIP network's voice session protocol. These attacks allow an external observer (adversary) to uniquely (nearly) identify the true caller (and receiver) with high probability. Our work on the publish/subscribe networks has resulted in the development of an unified framework for handling event confidentiality, integrity, access control and DoS attacks, while incurring small overhead on the system. We have proposed a key isomorphism paradigm to preserve the confidentiality of events on publish/subscribe networks while permitting scalable content-based matching and routing. Our work on overlay network security has resulted in a novel information hiding technique on overlay networks. Our solution represents the first attempt to transparently hide the location of data items on an overlay network.
23
Nottingham, Alastair. "GPF : a framework for general packet classification on GPU co-processors." Thesis, Rhodes University, 2012. http://hdl.handle.net/10962/d1006662.
Full textAbstract:
This thesis explores the design and experimental implementation of GPF, a novel protocol-independent, multi-match packet classification framework. This framework is targeted and optimised for flexible, efficient execution on NVIDIA GPU platforms through the CUDA API, but should not be difficult to port to other platforms, such as OpenCL, in the future. GPF was conceived and developed in order to accelerate classification of large packet capture files, such as those collected by Network Telescopes. It uses a multiphase SIMD classification process which exploits both the parallelism of packet sets and the redundancy in filter programs, in order to classify packet captures against multiple filters at extremely high rates. The resultant framework - comprised of classification, compilation and buffering components - efficiently leverages GPU resources to classify arbitrary protocols, and return multiple filter results for each packet. The classification functions described were verified and evaluated by testing an experimental prototype implementation against several filter programs, of varying complexity, on devices from three GPU platform generations. In addition to the significant speedup achieved in processing results, analysis indicates that the prototype classification functions perform predictably, and scale linearly with respect to both packet count and filter complexity. Furthermore, classification throughput (packets/s) remained essentially constant regardless of the underlying packet data, and thus the effective data rate when classifying a particular filter was heavily influenced by the average size of packets in the processed capture. For example: in the trivial case of classifying all IPv4 packets ranging in size from 70 bytes to 1KB, the observed data rate achieved by the GPU classification kernels ranged from 60Gbps to 900Gbps on a GTX 275, and from 220Gbps to 3.3Tbps on a GTX 480. In the less trivial case of identifying all ARP, TCP, UDP and ICMP packets for both IPv4 and IPv6 protocols, the effective data rates ranged from 15Gbps to 220Gbps (GTX 275), and from 50Gbps to 740Gbps (GTX 480), for 70B and 1KB packets respectively.LaTeX with hyperref package
24
Zhang, Ying Ping. "A study of architecture and performance of IBM Cyclops64 interconnection network." Access to citation, abstract and download form provided by ProQuest Information and Learning Company; downloadable PDF file 0.37Mb, 66 p, 2005. http://wwwlib.umi.com/dissertations/fullcit/1428258.
Full text
25
Hei, Xiaojun. "End-to-end network measurement and its applications in peer-to-peer networks /." View abstract or full-text, 2008. http://library.ust.hk/cgi/db/thesis.pl?ECED%202008%20HEI.
Full text
26
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.
Full text
27
梁耀祥 and Yiu-cheung Leung. "A reconfigurable neural network for industrial sensory systems." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2000. http://hub.hku.hk/bib/B31224751.
Full text
28
Ruyter, Masood. "The measurement of enterprise architecture to add value to small and medium enterprises." Thesis, Cape Peninsula University of Technology, 2012. http://hdl.handle.net/20.500.11838/2293.
Full textAbstract:
Thesis (MTech (Information Technology))--Cape Peninsula University of Technology, 2012.South Africa has a complex financial and retail service industry with high reliance on the use of IT systems to ensure effectiveness and maintainability. Decision making and improved outcomes may be done through an IT aligned enterprise architecture (EA) strategy. EA is a capability that contributes to the support and success of an organisations' IT. Organisations are currently using EA to better align IT and the business strategy which provides a comprehensive v.ew of the IT system. Thus, EA is increasing in organisations yet the measurement and value of EA is limited to organisations and enterprise architects. The discussions of the benefits and value of EA has been discussed for several years, however there are still no consensus about how the benefits and value of EA can be measured. The lack and clear understanding of the benefits and value of EA needs to consider different aspects of IT as well as the shareholders when measuring the benefits and value of EA to an organisation.
29
Fan, 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.
Full textAbstract:
With the extremely rapid development of the Internet in recent years, emerging peer-to-peer network overlays are meeting the requirements of a more sophisticated communications environment, providing a useful substrate for applications such as scalable file sharing, data storage, large-scale multicast, web-cache, and publish-subscribe services. Due to its design flexibility, peer-to-peer networks can offer features including self-organization, fault-tolerance, scalability, load-balancing, locality and anonymity. As the Internet grows, there is an urgent requirement to understand real-time network performance degradation. Measurement tools currently used are ping, traceroute and variations of these. SNMP (Simple Network Management Protocol) is also used by network administrators to monitor local networks. However, ping and traceroute can only be used temporarily, SNMP can only be deployed at certain points in networks and these tools are incapable of sharing network measurements among end-users. Due to the distributed nature of networking performance data, peer-to-peer overlay networks present an attractive platform to distribute this information among Internet users. This thesis aims at investigating the desirable locality property of peer-to-peer overlays to create an application to share Internet measurement performance. When measurement data are distributed amongst users, it needs to be localized in the network allowing users to retrieve it when external Internet links fail. Thus, network locality and robustness are the most desirable properties. Although some unstructured overlays also integrate locality in design, they fail to reach rarely located data items. Consequently, structured overlays are chosen because they can locate a rare data item deterministically and they can perform well during network failures. In structured peer-to-peer overlays, Tapestry, Pastry and Chord with proximity neighbour selection, were studied due to their explicit notion of locality. To differentiate the level of locality and resiliency in these protocols, P2Psim simulations were performed. The results show that Tapestry is the more suitable peer-to-peer substrate to build such an application due to its superior localizing data performance. Furthermore, due to the routing similarity between Tapestry and Pastry, an implementation that shares network measurement information was developed on freepastry, verifying the application feasibility. This project also contributes to the extension of P2Psim to integrate with GT-ITM and link failures.
30
Dai, Lillian Lei 1978. "Proactive mobile wireless networks : an infrastructureless wireless network architecture for delay-sensitive applications." Thesis, Massachusetts Institute of Technology, 2008. http://hdl.handle.net/1721.1/44409.
Full textAbstract:
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2008.Includes bibliographical references (p. 197-213).
Infrastructureless wireless networks are an important class of wireless networks that is best suited for scenarios where there is temporary and localized telecommunication demand. Such networks consist of wireless devices that can form a network autonomously without the need for pre-deployed telecommunication infrastructures such as base-stations and access points. Over the past several decades, significant research and development efforts have been devoted to a particular type of infrastructureless wireless networks called mobile ad hoc wireless networks (MANETs). In addition to autonomous network formation, wireless devices in MANETs have routing capabilities and help one another to forward information in a multihop fashion. The applications envisioned for MANETs include communication during disaster relief, search and rescue, and small tactical unit operations where the existing telecommunication infrastructures may be destroyed or are unavailable. While significant strides have been made in all aspects of MANET networking, adoption of such technology has been limited to date despite its potential. We believe that this lack of adoption is due to a fundamental mismatch between application demands and the MANET network architecture. While the flexibility of anytime and anywhere communication offered by MANETs is appealing, these networks are not designed to provide assured service for delay-sensitive applications such as communication during a search and rescue mission or in a battlefield. In fact, MANETs may be frequently disconnected due to mobility and/or device failure. Such disconnections may persist for an unacceptable length of time, during which, there may be loss of critical time-sensitive information and degraded network performance due to mismatches to routing and transport layer protocols.
(cont.) To provide service assurance in these scenarios, it is insufficient to limit technical improvements to the traditional networking layers (such as power control, coding, or routing) since network disconnections may still occur. We argue that a Proactive Wireless Network Architecture is needed - one that proactively maintains network connectivity in order to provide assured message delivery for applications with high quality of service (QoS) demands. The two key features of a proactive wireless network are: (1) Network disconnection prediction via localization, trajectory prediction, and large-scale channel estimation and (2) Network topology control via the adaptive deployment of additional wireless devices, called helper nodes, and by proactively controlling their movements toward regions of predicted disconnections prior to the occurrence of such disconnections. Hence, unlike MANETs, proactive wireless networks are designed to anticipate and respond to network disconnection events via active connectivity maintenance with helper nodes, thereby preventing network disruptions and message loss. In this dissertation, we present the proposed proactive wireless network architecture, quantify operating scenarios where the proposed network architecture is a sensible choice, and present system-level performance analyses under various helper node deployment schemes.
by Lillian Lei Dai.
Ph.D.
31
Tarigopula, Srivamsi. "A CAM-Based, High-Performance Classifier-Scheduler for a Video Network Processor." Thesis, University of North Texas, 2008. https://digital.library.unt.edu/ark:/67531/metadc6045/.
Full textAbstract:
Classification and scheduling are key functionalities of a network processor. Network processors are equipped with application specific integrated circuits (ASIC), so that as IP (Internet Protocol) packets arrive, they can be processed directly without using the central processing unit. A new network processor is proposed called the video network processor (VNP) for real time broadcasting of video streams for IP television (IPTV). This thesis explores the challenge in designing a combined classification and scheduling module for a VNP. I propose and design the classifier-scheduler module which will classify and schedule data for VNP. The proposed module discriminates between IP packets and video packets. The video packets are further processed for digital rights management (DRM). IP packets which carry regular traffic will traverse without any modification. Basic architecture of VNP and architecture of classifier-scheduler module based on content addressable memory (CAM) and random access memory (RAM) has been proposed. The module has been designed and simulated in Xilinx 9.1i; is built in ISE simulator with a throughput of 1.79 Mbps and a maximum working frequency of 111.89 MHz at a power dissipation of 33.6mW. The code has been translated and mapped for Spartan and Virtex family of devices.
32
Grandy, Richard Stephen. "Application of reliable host-based multicast to large scale simulations." Online access for everyone, 2007. http://www.dissertations.wsu.edu/Thesis/Fall2007/R_Grandy_122007.pdf.
Full text
33
Gin, Andrew. "Building a Secure Short Duration Transaction Network." Thesis, University of Canterbury. Computer Science and Software Engineering, 2007. http://hdl.handle.net/10092/1188.
Full textAbstract:
The objective of this project was to design and test a secure IP-based architecture suitable for short duration transactions. This included the development of a prototype test-bed in which various operating scenarios (such as cryptographic options, various IP-based architectures and fault tolerance) were demonstrated. A solution based on SIP secured with TLS was tested on two IP based architectures. Total time, CPU time and heap usage was measured for each architecture and encryption scheme to examine the viability of such a solution. The results showed that the proposed solution stack was able to complete transactions in reasonable time and was able to recover from transaction processor failure. This research has demonstrated a possible architecture and protocol stack suitable for IP-based transaction networks. The benefits of an IP-based transaction network include reduced operating costs for network providers and clients, as shared IP infrastructure is used, instead of maintaining a separate IP and X.25 network.
34
Zhang, Tao. "RADAR: compiler and architecture supported intrusion prevention, detection, analysis and recovery." Diss., Available online, Georgia Institute of Technology, 2006, 2006. http://etd.gatech.edu/theses/available/etd-08042006-122745/.
Full textAbstract:
Thesis (Ph. D.)--Computing, Georgia Institute of Technology, 2007.Ahamad, Mustaque, Committee Member ; Pande, Santosh, Committee Chair ; Lee, Wenke, Committee Member ; Schwan, Karsten, Committee Member ; Yang, Jun, Committee Member.
35
Chakravarti, Arjav Jagannath. "Scientific computation on a peer-to-peer network using mobile agents." Columbus, Ohio : Ohio State University, 2004. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=osu1086190904.
Full textAbstract:
Thesis (Ph. D.)--Ohio State University, 2004.Title from first page of PDF file. Document formatted into pages; contains xvii, 119 p.; also includes graphics. Includes abstract and vita. Advisor: Gerald Baumgartner, Dept. of Computer and Information Science. Includes bibliographical references (p. 111-119).
36
Akbas, Mustafa Ilhan. "Evaluation Of Core Stateless Guaranteed Fair Network Architecture." Master's thesis, METU, 2006. http://etd.lib.metu.edu.tr/upload/2/12608027/index.pdf.
Full textAbstract:
The problem of providing Quality of Service (QoS) in the Internet has been an extremely active area of research and various mechanisms have been proposed related to this subject. Developing network applications have requirements such as bounded delay, jitter, minimum bandwidth and maximum loss rate. There is also a need to support large bandwidth networks because of growing link speeds. Previous QoS efforts did not fully satisfy all these needs of future networks but more recent approaches aim to be both scalable and rich in the provision of guaranteed services. Consequently core-stateless systems received much attention in recent years because of their scalability in supporting per-flow QoS. The property of not maintaining any per-flow state in the core routers is known as being core-stateless. In this thesis study, the need for core-stateless network architectures is pointed out and a literature survey about these schemes is carried out. Core-Stateless Guaranteed Fair (CSGF) network architecture, which provides deterministic fairness guarantees in a work-conserving manner, is selected and evaluated. Simulation studies about stateful Virtual Clock (VC) algorithm and CSGF&rsquos sub-protocols Core-Stateless Virtual Clock (CSVC), Core-Stateless Guaranteed Throughput (CSGT) and Core-Stateless Guaranteed Fairness (CSGF) are presented. Finally, the deficiencies in fairness of CSGF are demonstrated.
37
Tsietsi, Mosiuoa. "Prototyping a peer-to-peer session initiation protocol user agent /." [S.l. : s.n.], 2008. http://eprints.ru.ac.za/1115/.
Full text
38
MacInnis, Robert F. "A scalable architecture for the demand-driven deployment of location-neutral software services." Thesis, University of St Andrews, 2010. http://hdl.handle.net/10023/1844.
Full textAbstract:
This thesis presents a scalable service-oriented architecture for the demand-driven deployment of location-neutral software services, using an end-to-end or ‘holistic’ approach to address identified shortcomings of the traditional Web Services model. The architecture presents a multi-endpoint Web Service environment which abstracts over Web Service location and technology and enables the dynamic provision of highly-available Web Services. The model describes mechanisms which provide a framework within which Web Services can be reliably addressed, bound to, and utilized, at any time and from any location. The presented model eases the task of providing a Web Service by consuming deployment and management tasks. It eases the development of consumer agent applications by letting developers program against what a service does, not where it is or whether it is currently deployed. It extends the platform-independent ethos of Web Services by providing deployment mechanisms which can be used independent of implementation and deployment technologies. Crucially, it maintains the Web Service goal of universal interoperability, preserving each actor’s view upon the system so that existing Service Consumers and Service Providers can participate without any modifications to provider agent or consumer agent application code. Lastly, the model aims to enable the efficient consumption of hosting resources by providing mechanisms to dynamically apply and reclaim resources based upon measured consumer demand.
39
Venkateshwaran, Anjali. "An experimental investigation of dynamically reconfigurable computer network architectures through simulation." Thesis, Virginia Tech, 1988. http://hdl.handle.net/10919/43066.
Full textAbstract:
The research described in this thesis is divided conveniently into three components: (1)
the credibility assessment of a simulation model for the investigation of dynamically
reconfigurable computer network architectures, (2) a comparative study of the standardized
time series method of simulation output analysis, and (3) an experimental comparison of the
effects of dynamic reconfigurability on message transmission delays and network throughput.
The credibility assessment relies almost completely on verification procedures applied
to both communicative and program representations of the model. In the absence of an extant
system, validation consists of extensive, program traces to assure that model behavior
matches expectations and reflects no inconsistencies.
Application of a standardized time series technique produces the advantages reported
by other researchers with regard to sampling efficiency (information derived per sample unit)
when dynamic reconfigurability is precluded. The inherent non-stationarity induced by reconfiguration
reveals the sensitivity of standardized time series and the consequent adjustment
to preserve coverage. A compromise between coverage and sampling efficiency prompts the
choice of the batch means method for experimental comparison.
Experimental comparison shows that under high traffic variability reconfigurabilityMaster of Science
40
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
41
Shi, Junxiao, and Junxiao Shi. "Named Data Networking in Local Area Networks." Diss., The University of Arizona, 2017. http://hdl.handle.net/10150/625652.
Full textAbstract:
The Named Data Networking (NDN) is a new Internet architecture that changes the network semantic from packet delivery to content retrieval and promises benefits in areas such as content distribution, security, mobility support, and application development. While the basic NDN architecture applies to any network environment, local area networks (LANs) are of particular interest because of their prevalence on the Internet and the relatively low barrier to deployment.
In this dissertation, I design NDN protocols and implement NDN software, to make NDN communication in LAN robust and efficient. My contributions include: (a) a forwarding behavior specification required on every NDN node; (b) a secure and efficient self-learning strategy for switched Ethernet, which discovers available contents via occasional flooding, so that the network can operate without manual configuration, and does not require a routing protocol or a centralized controller; (c) NDN-NIC, a network interface card that performs name-based packet filtering, to reduce CPU overhead and power consumption of the main system during broadcast communication on shared media; (d) the NDN Link Protocol (NDNLP), which allows the forwarding plane to add hop-by-hop headers, and provides a fragmentation-reassembly feature so that large NDN packets can be sent directly over Ethernet with limited MTU.
42
Tsietsi, Mosiuoa Jeremia. "Prototyping a peer-to-peer session initiation protocol user agent." Thesis, Rhodes University, 2008. http://hdl.handle.net/10962/d1006603.
Full textAbstract:
The Session Initiation Protocol (SIP) has in recent years become a popular protocol for the exchange of text, voice and video over IP networks. This thesis proposes the use of a class of structured peer to peer protocols - commonly known as Distributed Hash Tables (DHTs) - to provide a SIP overlay with services such as end-point location management and message relay, in the absence of traditional, centralised resources such as SIP proxies and registrars. A peer-to-peer layer named OverCord, which allows the interaction with any specific DHT protocol via the use of appropriate plug-ins, was designed, implemented and tested. This layer was then incorporated into a SIP user agent distributed by NIST (National Institute of Standards and Technology, USA). The modified user agent is capable of reliably establishing text, audio and video communication with similarly modified agents (peers) as well as conventional, centralized SIP overlays.
43
Tönsing, Christoph Erik. "Energy -efficient MAC protocol for wireless sensor networks." Pretoria : [s.n.], 2008. http://upetd.up.ac.za/thesis/available/etd-09042008-143948/.
Full text
44
Torabkhani, Nima. "Modeling and analysis of the performance of networks in finite-buffer regime." Diss., Georgia Institute of Technology, 2014. http://hdl.handle.net/1853/51810.
Full textAbstract:
In networks, using large buffers tend to increase end-to-end packet delay and its deviations, conflicting with real-time applications such as online gaming, audio-video services, IPTV, and VoIP. Further, large buffers complicate the design of high speed routers, leading to more power consumption and board space. According to Moore's law, switching speeds double every 18 months while memory access speeds double only every 10 years. Hence, as memory requirements increasingly become a limiting aspect of router design, studying networks in finite-buffer regime seems necessary for network engineers. This work focuses on both practical and theoretical aspects of finite-buffer networks. In Chapters 1-7, we investigate the effects of finite buffer sizes on the throughput and packet delay in different networks. These performance measures are shown to be linked to the stationary distribution of an underlying irreducible Markov chain that exactly models the changes in the network. An iterative scheme is proposed to approximate the steady-state distribution of buffer occupancies by decoupling the exact chain to smaller chains. These approximate solutions are used to analytically characterize network throughput and packet delay, and are also applied to some network performance optimization problems. Further, using simulations, it is confirmed that the proposed framework yields accurate estimates of the throughput and delay performance measures and captures the vital trends and tradeoffs in these networks. In Chapters 8-10, we address the problem of modeling and analysis of the performance of finite-memory random linear network coding in erasure networks. When using random linear network coding, the content of buffers creates dependencies which cannot be captured directly using the classical queueing theoretical models. A careful derivation of the buffer occupancy states and their transition rules are presented as well as decodability conditions when random linear network coding is performed on a stream of arriving packets.
45
Ranjan, Rishi. "Generic Architecture for Power-Aware Routing in Wireless Sensor Networks." Thesis, Georgia Institute of Technology, 2004. http://hdl.handle.net/1853/5001.
Full textAbstract:
This work describes the design and implementation of a generic architecture to provide a collective solution for power-aware routing to a wide range of problems in wireless sensor network environments. Power aware-routing is integral to the proposed solutions for different problems. These solutions try to achieve power-efficient routing specific to the problem domain. This can lead to challenging technical problems and deployment barriers when attempting to integrate the solutions. This work extracts various factors to be considered for a range of problems in wireless sensor networks and provides a generic framework for efficient power-aware routing. The architecture aims to relieve researchers from considering power management in their design. We have identified coupling between sources and sinks as the main factor for different design choices for a range of problems. We developed a core-based hierarchical routing framework for efficient power-aware routing that is used to decouple the sources from sinks. The architecture uses only local interaction for scalability and stability in a dynamic network. The architecture provides core-based query forwarding and data dissemination. It uses data aggregation and query aggregation at core nodes to reduce the amount of data to be transmitted. The architecture can be easily extended to incorporate protocols to provide QoS and security to the applications. We use network simulations to evaluate the performance of cluster formation and energy efficiency of the algorithm. Our results show that energy efficiency of the algorithm is better when the transmission range is kept to a minimum for network connectivity as compared to adjustable transmission range.
46
Mehendale, Hrushikesh Sanjay. "Lifenet: a flexible ad hoc networking solution for transient environments." Thesis, Georgia Institute of Technology, 2011. http://hdl.handle.net/1853/42781.
Full textAbstract:
In the wake of major disasters, the failure of existing communications infrastructure and the subsequent lack of an effective communication solution results in increased risks, inefficiencies, damage and casualties. Currently available options such as satellite communication are expensive and have limited functionality. A robust communication solution should be affordable, easy to deploy, require little infrastructure, consume little power and facilitate Internet access. Researchers
have long proposed the use of ad hoc wireless networks for such scenarios. However such networks have so far failed to create any impact, primarily because they are unable to handle network transience and have usability constraints such as static topologies and dependence on specific platforms.
LifeNet is a WiFi-based ad hoc data communication solution designed for use in highly transient environments. After presenting the motivation, design principles and key insights from prior literature, the dissertation introduces a new
routing metric called Reachability and a new routing protocol based on it, called Flexible Routing. Roughly speaking, reachability measures the end-to-end multi-path probability that a packet transmitted by a source reaches its final
destination. Using experimental results, it is shown that even with high transience, the reachability metric - (1) accurately captures the effects of transience (2) provides a compact and eventually consistent global network view at
individual nodes, (3) is easy to calculate and maintain and (4) captures availability. Flexible Routing trades throughput for availability and fault-tolerance and ensures successful packet delivery under varying degrees of transience.
With the intent of deploying LifeNet on field we have been continuously interacting with field partners, one of which is Tata Institute of Social Sciences India. We have refined LifeNet iteratively refined base on their feedback.
I conclude the thesis with lessons learned from our field trips so far and deployment plans for the near future.
47
Hajiarabderkani, Masih. "Adaptive dissemination of network state knowledge in structured peer-to-peer networks." Thesis, University of St Andrews, 2015. http://hdl.handle.net/10023/6761.
Full textAbstract:
One of the fundamental challenges in building Peer-to-Peer (P2P) applications is to locate resources across a dynamic set of nodes without centralised servers. Structured overlay networks solve this challenge by proving a key-based routing (KBR) layer that maps keys to nodes. The performance of KBR is strongly influenced by the dynamic and unpredictable conditions of P2P environments. To cope with such conditions a node must maintain its routing state. Routing state maintenance directly influences both lookup latency and bandwidth consumption. The more vigorously that state information is disseminated between nodes, the greater the accuracy and completeness of the routing state and the lower the lookup latency, but the more bandwidth that is consumed. Existing structured P2P overlays provide a set of configuration parameters that can be used to tune the trade-off between lookup latency and bandwidth consumption. However, the scale and complexity of the configuration space makes the overlays difficult to optimise. Further, it is increasingly difficult to design adaptive overlays that can cope with the ever increasing complexity of P2P environments. This thesis is motivated by the vision that adaptive P2P systems of tomorrow, would not only optimise their own parameters, but also generate and adapt their own design. This thesis studies the effects of using an adaptive technique to automatically adapt state dissemination cost and lookup latency in structured overlays under churn. In contrast to previous adaptive approaches, this work investigates the algorithmic adaptation of the fundamental data dissemination protocol rather than tuning the parameter values of a protocol with fixed design. This work illustrates that such a technique can be used to design parameter-free structured overlays that outperform other structured overlays with fixed design such as Chord in terms of lookup latency, bandwidth consumption and lookup correctness. A large amount of experimentation was performed, more than the space allows to report. This thesis presents a set of key findings. The full set of experiments and data is available online at: http://trombone.cs.st-andrews.ac.uk/thesis/analysis.
48
Wing, Peter D. "Enhancements to the XNS authentication-by-proxy model /." Online version of thesis, 1990. http://hdl.handle.net/1850/10613.
Full text
49
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
50
Lee, Myounghwan. "Quality of service with DiffServ architecture in hybrid mesh/relay networks." Diss., Georgia Institute of Technology, 2010. http://hdl.handle.net/1853/34694.
Full textAbstract:
The objective of this research is to develop an optimized quality of service (QoS) assurance algorithm with the differentiated services (DiffServ) architecture, and a differentiated polling algorithm with efficient bandwidth allocation for QoS assurance in the hybrid multi-hop mesh/relay networks. These wide area networks (WANs), which will employ a connection-based MAC protocol, along with QoS-enabled wireless local area networks (WLANs) that use a contention-based MAC protocol, need to provide an end-to-end QoS guarantee for data communications, particularly QoS-sensitive multimedia communications.
Due to the high cost of construction and maintenance of infrastructure in wireless networks, engineers and researchers have focused their investigations on wireless mesh/relay networks with lower cost and high scalability. For current wireless multi-hop networks, an end-to-end QoS guarantee is an important functionality to add, because the demand for real-time multimedia communications has recently been increasing. For real-time multimedia communication in heterogeneous networks, hybrid multi-hop mesh/relay networks using a connection-based MAC protocol, along with QoS-enabled WLANs that use a contention-based MAC protocol can be an effective multi-hop network model , as opposed to multi-hop networks with a contention-based MAC protocol without a QoS mechanism. To provide integrated QoS support for different QoS mechanisms, the design of the cross-layer DiffServ architecture that can be applied in wireless multi-hop mesh/relay networks with WLANs is desirable.
For parameterized QoS that requires a specific set of QoS parameters in hybrid multi-hop networks, an optimized QoS assurance algorithm with the DiffServ architecture is proposed here that supports end-to-end QoS through a QoS enhanced WAN for multimedia communications.
For a QoS assurance algorithm that requires a minimum per-hop delay, the proper bandwidth to allow the per-hop delay constraint needs to be allocated. Therefore, a polling algorithm with a differentiated strategy at multi-hop routers is proposed here. The proposed polling algorithm at a router differentially computes and distributes the polling rates for routers according to the ratio of multimedia traffic to overall traffic, the number of traffic connections, and the type of polling service.
By simulating the architecture and the algorithms proposed in this thesis and by analyzing traffic with the differentiated QoS requirement, it is shown here that the architecture and the algorithms produce an excellent end-to-end QoS guarantee.