To see the other types of publications on this topic, follow the link: SNA (Computer network architecture).
Dissertations / Theses on the topic 'SNA (Computer network architecture)'
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 'SNA (Computer network architecture).'
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
Katti, Sachin Rajsekhar. "Network coded wireless architecture." Thesis, Massachusetts Institute of Technology, 2008. http://hdl.handle.net/1721.1/45885.
Full textAbstract:
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2008.Includes bibliographical references (p. 183-197).
Wireless mesh networks promise cheap Internet access, easy deployment, and extended range. In their current form, however, these networks suffer from both limited throughput and low reliability; hence they cannot meet the demands of applications such as file sharing, high definition video, and gaming. Motivated by these problems, we explore an alternative design that addresses these challenges. This dissertation presents a network coded architecture that significantly improves throughput and reliability. It makes a simple yet fundamental switch in network design: instead of routers just storing and forwarding received packets, they mix (or code) packets' content before forwarding. We show through practical systems how routers can exploit this new functionality to harness the intrinsic characteristics of the wireless medium to improve performance. We develop three systems; each reveals a different benefit of our network coded design. COPE observes that wireless broadcast naturally creates an overlap in packets received across routers, and develops a new network coding algorithm to exploit this overlap to deliver the same data in fewer transmissions, thereby improving throughput. ANC pushes network coding to the signal level, showing how to exploit strategic interference to correctly deliver data from concurrent senders, further increasing throughput. Finally, MIXIT presents a symbol-level network code that exploits wireless spatial diversity, forwarding correct symbols even if they are contained in corrupted packets to provide high throughput reliable transfers. The contributions of this dissertation are multifold. First, it builds a strong connection between the theory of network coding and wireless system design. Specifically, the systems presented in this dissertation were the first to show that network coding can be cleanly integrated into the wireless network stack to deliver practical and measurable gains. The work also presents novel algorithms that enrich the theory of network coding, extending it to operate over multiple unicast flows, analog signals, and soft-information.
(cont.) Second, we present prototype implementations and testbed evaluations of our systems. Our results show that network coding delivers large performance gains ranging from a few percent to several-fold depending on the traffic mix and the topology. Finally, this work makes a clear departure from conventional network design. Research in wireless networks has largely proceeded in isolation, with the electrical engineers focusing on the physical and lower layers, while the computer scientists worked up from the network layer, with the packet being the only interface. This dissertation pokes a hole in this contract, disposing of artificial abstractions such as indivisible packets and point-to-point links in favor of a more natural abstraction that allows the network and the lower layers to collaborate on the common objectives of improving throughput and reliability using network coding as the building block. At the same time, the design maintains desirable properties such as being distributed, low-complexity, implementable, and integrable with the rest of the network stack.
by Sachin Rajsekhar Katti.
Ph.D.
3
Beverly, Robert E. 1975. "Statistical learning in network architecture." Thesis, Massachusetts Institute of Technology, 2008. http://hdl.handle.net/1721.1/44210.
Full textAbstract:
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2008.This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Includes bibliographical references (p. 167-[177]).
The Internet has become a ubiquitous substrate for communication in all parts of society. However, many original assumptions underlying its design are changing. Amid problems of scale, complexity, trust and security, the modern Internet accommodates increasingly critical services. Operators face a security arms race while balancing policy constraints, network demands and commercial relationships. This thesis espouses learning to embrace the Internet's inherent complexity, address diverse problems and provide a component of the network's continued evolution. Malicious nodes, cooperative competition and lack of instrumentation on the Internet imply an environment with partial information. Learning is thus an attractive and principled means to ensure generality and reconcile noisy, missing or conflicting data. We use learning to capitalize on under-utilized information and infer behavior more reliably, and on faster time-scales, than humans with only local perspective. Yet the intrinsic dynamic and distributed nature of networks presents interesting challenges to learning. In pursuit of viable solutions to several real-world Internet performance and security problems, we apply statistical learning methods as well as develop new, network-specific algorithms as a step toward overcoming these challenges. Throughout, we reconcile including intelligence at different points in the network with the end-to-end arguments. We first consider learning as an end-node optimization for efficient peer-to-peer overlay neighbor selection and agent-centric latency prediction. We then turn to security and use learning to exploit fundamental weaknesses in malicious traffic streams. Our method is both adaptable and not easily subvertible. Next, we show that certain security and optimization problems require collaboration, global scope and broad views.
(cont.) We employ ensembles of weak classifiers within the network core to mitigate IP source address forgery attacks, thereby removing incentive and coordination issues surrounding existing practice. Finally, we argue for learning within the routing plane as a means to directly optimize and balance provider and user objectives. This thesis thus serves first to validate the potential for using learning methods to address several distinct problems on the Internet and second to illuminate design principles in building such intelligent systems in network architecture.
by Robert Edward Beverly, IV.
Ph.D.
4
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.
5
Artz, Michael Lyle 1979. "NetSPA : a Network Security Planning Architecture." Thesis, Massachusetts Institute of Technology, 2002. http://hdl.handle.net/1721.1/29899.
Full textAbstract:
Thesis (M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2002.Includes bibliographical references (leaves 93-96).
Attack scenario graphs provide a concise way of displaying all possible sequences of attacks a malicious user can execute to obtain a desired goal, such as remotely achieving root undetected on a critical host machine. NETSPA, the Network Security Planning Architecture, is a C++ system that quickly generates worst-case attack graphs using a forward-chaining depth-first search of the possible attack space using actions modeled with REM, a simple attack description language. NETSPA accepts network configuration information from a database that includes host and network software types and versions, intrusion detection system placement and types, network connectivity, and firewall rulesets. It is controlled by command line inputs that determine a critical goal state, trust relationships between hosts, and maximum recursive depth. NETSPA was shown to efficiently provide easily understood attack graphs that revealed non-obvious security problems against a realistic sample network of 17 representative hosts using 23 REM defined actions. The largest useful graph was generated within 1.5 minutes of execution. NETSPA-executes faster and handles larger networks than any existing graph generation system. This allows NETSPA to be practically used in combination with other security components to develop and analyze secure networks.
by Michael Lyle Artz.
M.Eng.
6
Lefelhocz, Christopher James. "Investigation of a preemptive network architecture." Thesis, Massachusetts Institute of Technology, 1994. http://hdl.handle.net/1721.1/36457.
Full textAbstract:
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1994.Includes bibliographical references (p. 81-82).
by Christopher Jame Lefelhcz.
M.S.
7
Umeh, 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.
Full textAbstract:
Thesis (M.S.)--University of Missouri--Rolla, 2007.Vita. 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).
8
Iqneibi, Sami M. Carleton University Dissertation Engineering Electrical. "A blackboard architecture to support network fault diagnosis." Ottawa, 1992.
Find full text
9
Zheng, Xijia Ph D. Massachusetts Institute of Technology. "Cognitive optical network architecture in dynamic environments." Thesis, Massachusetts Institute of Technology, 2020. https://hdl.handle.net/1721.1/126997.
Full textAbstract:
Thesis: Ph. D. in Computer Science and Engineering, Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, May, 2020Cataloged from the official PDF of thesis.
Includes bibliographical references (pages 149-154).
Emerging network traffic requires a more agile network management and control system to deal with the dynamic network environments than today's networks use. The bursty and large data transactions introduced by new technological applications can cause both high costs and extreme congestion in networks. The prohibitive cost of massive over-provisioning will manifest as huge congestions during peak demand periods. The network management and control system must be able to sense the traffic changes and reconfigure in a timely manner (in tens of milliseconds instead of minutes or hours) to use network resources efficiently. We propose the use of cognitive techniques for fast and adaptive network management and control of future optical networks. The goal of this work is to provide timely network reconfigurations in response to dynamic traffic environments and prevent congestion from building up.
We make a simplified model of the expected traffic arrival rate changes as a multistate Markov process based on the characteristics of the dynamic, bursty, and high granularity traffic. The traffic is categorized into different network traffic environments by the length of the network coherence time, which is the time that the traffic is unvarying. The tunneled network architecture is adopted due to its supremacy in reducing the control complexity when the traffic volume is at least one wavelength. In the long coherence time regime where traffic changes very slowly, the traffic detection performances of two Bayesian estimators and a stopping-trial (sequential) estimator are examined, based on the transient behaviors of networks. The stopping trial estimator has the fastest response time to the changes of traffic arrival statistics. We propose a wavelength reconfiguration algorithm with continuous assessment where the system reconfigures whenever it deems necessary.
The reconfiguration can involve addition or subtraction of multiple wavelengths. Using the fastest detection and reconfiguration algorithm can reduce queueing delays during traffic surges without over-provisioning and thus can reduce network capital expenditure and prevent wasting resources on erroneous decisions when surges occur. For traffic with moderate coherence time (where traffic changes at a moderate rate) and the short coherence time (where traffic changes quickly), the stopping-trial estimator still responds to the traffic changes with a short detection time. As long as the inter-arrival times of traffic transactions are independent, the algorithm is still optimum. The algorithm provides no prejudice on the exact network traffic distribution, avoiding having to sense and estimate detailed arrival traffic statistics.
To deal with fast-changing traffic, we model the transient convergent behaviors of network traffic drift as a result of traffic transition rate changes and validate the feasibility and utility of the traffic prediction. In a simple example when the network traffic rate changes monotonically in a linear model, the sequential maximum likelihood estimator will capture the traffic trend with a small number of arrivals. The traffic trend prediction can help to provide fast reconfiguration, which is very important for maintaining quality of service during large traffic shifts. We further investigate the design of an efficient rerouting algorithm to maintain users' quality of service when the incremental traffic cannot be accommodated on the primary path. The algorithm includes the fast reconfiguration of wavelengths in the existing lit and spatially routed fibers, and the setting up and lighting of new fibers.
Rerouting is necessary to maintain users' quality of service when the queueing delay on the primary path (determined by shortest path routing) exceeds the requirement. Our algorithm triggers reconfiguration when a queueing delay threshold is crossed on the primary path. The triggering by a threshold on the queueing delay is used due to its simplicity, and it is directly measurable by the exact traffic transaction sizes and the queue size, which reflect both the current network traffic environment and the network configurations. A dynamic rerouting algorithm implemented with a shortest path algorithm is proposed to find the secondary paths for rerouting. We make the conjecture that it is desirable that the alternate paths for rerouting have small numbers of hops and are disjoint with other busy paths when the hops on the path are independent. In addition, the conjecture suggests that a good candidate network topology should have high edge-connectivity.
Wavelength reservation for rerouted traffic does not maximize wavelength utilization. We make the conjecture that traffic with different sizes should be broken up into multi-classes with dedicated partitioned resources and the queueing delay should be normalized by the transmission time for rerouting triggering to realize better network utilization.
by Xijia Zheng.
Ph. D. in Computer Science and Engineering
Ph.D.inComputerScienceandEngineering Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science
10
Wiedenhoeft, Paul Eric. "Analysis of the Naval Postgraduate School computer network architecture." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 1994. http://handle.dtic.mil/100.2/ADA289749.
Full textAbstract:
Thesis (M.S. in Information Technology Management) Naval Postgraduate School, September 1994.Thesis advisor(s): A. Schoenstadt, James C. Emery. "September 1994." Bibliography: p. 153-161. Also available online.
11
SILVA, Adenilton José da. "Artificial neural network architecture selection in a quantum computer." UNIVERSIDADE FEDERAL DE PERNAMBUCO, 2015. https://repositorio.ufpe.br/handle/123456789/15011.
Full textAbstract:
Submitted by Isaac Francisco de Souza Dias (isaac.souzadias@ufpe.br) on 2016-01-27T17:25:47Z
No. of bitstreams: 2
license_rdf: 1232 bytes, checksum: 66e71c371cc565284e70f40736c94386 (MD5)
tese Adenilton José da Silva.pdf: 4885126 bytes, checksum: d2bade12d15d6626962f244aebd5678d (MD5)Made available in DSpace on 2016-01-27T17:25:47Z (GMT). No. of bitstreams: 2 license_rdf: 1232 bytes, checksum: 66e71c371cc565284e70f40736c94386 (MD5) tese Adenilton José da Silva.pdf: 4885126 bytes, checksum: d2bade12d15d6626962f244aebd5678d (MD5) Previous issue date: 2015-06-26
CNPq
Miniaturisation of computers components is taking us from classical to quantum physics domain. Further reduction in computer components size eventually will lead to the development of computer systems whose components will be on such a small scale that quantum physics intrinsic properties must be taken into account. The expression quantum computation and a first formal model of a quantum computer were first employed in the eighties. With the discovery of a quantum algorithm for factoring exponentially faster than any known classical algorithm in 1997, quantum computing began to attract industry investments for the development of a quantum computer and the design of novel quantum algorithms. For instance, the development of learning algorithms for neural networks. Some artificial neural networks models can simulate an universal Turing machine, and together with learning capabilities have numerous applications in real life problems. One limitation of artificial neural networks is the lack of an efficient algorithm to determine its optimal architecture. The main objective of this work is to verify whether we can obtain some advantage with the use of quantum computation techniques in a neural network learning and architecture selection procedure. We propose a quantum neural network, named quantum perceptron over a field (QPF). QPF is a direct generalisation of a classical perceptron which addresses some drawbacks found in previous models for quantum perceptrons. We also present a learning algorithm named Superposition based Architecture Learning algorithm (SAL) that optimises the neural network weights and architectures. SAL searches for the best architecture in a finite set of neural network architectures and neural networks parameters in linear time over the number of examples in the training set. SAL is the first quantum learning algorithm to determine neural network architectures in linear time. This speedup is obtained by the use of quantum parallelism and a non linear quantum operator.
A miniaturização dos componentes dos computadores está nos levando dos domínios da física clássica aos domínios da física quântica. Futuras reduções nos componentes dos computadores eventualmente levará ao desenvolvimento de computadores cujos componentes estarão em uma escala em que efeitos intrínsecos da física quântica deverão ser considerados. O termo computação quântica e um primeiro modelo formal de computação quântica foram definidos na década de 80. Com a descoberta no ano de 1997 de um algoritmo quântico para fatoração exponencialmente mais rápido do que qualquer algoritmo clássico conhecido a computação quântica passou a atrair investimentos de diversas empresas para a construção de um computador quântico e para o desenvolvimento de algoritmos quânticos. Por exemplo, o desenvolvimento de algoritmos de aprendizado para redes neurais. Alguns modelos de Redes Neurais Artificiais podem ser utilizados para simular uma máquina de Turing universal. Devido a sua capacidade de aprendizado, existem aplicações de redes neurais artificiais nas mais diversas áreas do conhecimento. Uma das limitações das redes neurais artificiais é a inexistência de um algoritmo com custo polinomial para determinar a melhor arquitetura de uma rede neural. Este trabalho tem como objetivo principal verificar se é possível obter alguma vantagem no uso da computação quântica no processo de seleção de arquiteturas de uma rede neural. Um modelo de rede neural quântica denominado perceptron quântico sobre um corpo foi proposto. O perceptron quântico sobre um corpo é uma generalização direta de um perceptron clássico que resolve algumas das limitações em modelos de redes neurais quânticas previamente propostos. Um algoritmo de aprendizado denominado algoritmo de aprendizado de arquitetura baseado no princípio da superposição que otimiza pesos e arquitetura de uma rede neural simultaneamente é apresentado. O algoritmo proposto possui custo linear e determina a melhor arquitetura em um conjunto finito de arquiteturas e os parâmetros da rede neural. O algoritmo de aprendizado proposto é o primeiro algoritmo quântico para determinar a arquitetura de uma rede neural com custo linear. O custo linear é obtido pelo uso do paralelismo quântico e de um operador quântico não linear.
12
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.
13
Pattabiraman, Aishwariya. "Heterogeneous Cache Architecture in Network-on-Chips." University of Cincinnati / OhioLINK, 2011. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1321371508.
Full text
14
Chakravorty, Sham. "An optimization analysis of frame architecture in selected protocols." Master's thesis, This resource online, 1993. http://scholar.lib.vt.edu/theses/available/etd-04272010-020044/.
Full text
15
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.
16
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
17
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.
18
Zhang, Lixia. "A new architecture for packet switching network protocols." Thesis, Massachusetts Institute of Technology, 1989. http://hdl.handle.net/1721.1/14184.
Full textAbstract:
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1989.GRSN 409705
Includes bibliographical references (leaves 131-135).
by Lixia Zhang.
Ph.D.
19
Seah, Peng Leong Chung Wai Kong. "Architectures for device aware network /." Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2005. http://library.nps.navy.mil/uhtbin/hyperion/05Mar%5FSeah.pdf.
Full text
20
Christensen, Jacob Holt. "Space Plug-and-Play Architecture Networking: A Self-Configuring Heterogeneous Network Architecture." DigitalCommons@USU, 2012. https://digitalcommons.usu.edu/etd/1422.
Full textAbstract:
The Space Plug-and-Play Architecture (SPA) networking approach outlined in this dissertation is an improvement over the previous approach used by the Satellite Data Model(SDM). The first improvement is the introduction of a SPA network model based on the Open Systems Interconnection (OSI) model. Second, a new addressing and routing scheme is presented, which places the burden of routing on the network infrastructure instead of the network endpoints. These improvements have been implemented in a software infrastructure called the SPA Services Manager (SSM). The SSM was developed under an International Organization for Standardization (ISO) 9001 certified development process, the details of which are presented. A collection of network timing graphs that measure latency and jitter of the SPA network is contained in this dissertation, as well as a runtime memory footprint. The maturity of the development process and these initial performance measurements demonstrate that the SSM is qualified for spaceflight.
21
Köhler, Fredrik. "Network Virtualization in Multi-hop Heterogeneous Architecture." Thesis, Mälardalens högskola, Akademin för innovation, design och teknik, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-38696.
Full textAbstract:
Software Defined Networking is a technology that introduces modular and programmable networks that uses separated control- and data-planes. Traditional networks use mostly proprietary protocols and devices that needs to communicate with each other and share information about routes and paths in the network. SDN on the other hand uses a controller that communicates with devices through an open source protocol called OpenFlow. The routing rules of flows can be inserted into the networking devices by the controller. This technology is still new and it requires more research to provide evidence that it can perform better, or at least as good as, the conventional networks. By doing some experiments on different topologies, this thesis aims at discovering how delays of flows are affected by having OpenFlow in the network, and identifying overhead of using such technology. The results show that, the overhead can be to large for time and noise sensitive applications and average delay is comparable to conventional networks.
22
Gold, Richard. "An Indirection Architecture for the Internet." Doctoral thesis, Uppsala : Acta Universitatis Upsaliensis : Univ.-bibl. [distributör], 2005. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-6199.
Full text
23
Chung, Wai Kong. "Architectures for device aware network." Thesis, Monterey, California. Naval Postgraduate School, 2005. http://hdl.handle.net/10945/2306.
Full textAbstract:
In today's heterogeneous computing environment, a wide variety of computing devices with varying capabilities need to access information in the network. Existing network is not able to differentiate the different device capabilities, and indiscriminatingly send information to the end-devices, without regard to the ability of the end-devices to use the information. The goal of a device-aware network is to match the capability of the end-devices to the information delivered, thereby optimizing the network resource usage. In the battlefield, all resources - including time, network bandwidth and battery capacity - are very limited. A device-aware network avoids the waste that happens in current, device-ignorant networks. By eliminating unusable traffic, a device-aware network reduces the time the end-devices spend receiving extraneous information, and thus saves time and conserves battery-life. In this thesis, we evaluated two potential DAN architectures, Proxy-based and Router-based approaches, based on the key requirements we identified. To demonstrate the viability of DAN, we built a prototype using a hybrid of the two architectures. The key elements of our prototype include a DAN browser, a DAN Lookup Server and DAN Processing Unit (DPU). We have demonstrated how our architecture can enhance the overall network utility by ensuring that only appropriate content is delivered to the end-devices.
24
Kumar, Mohan J. "Architecture, Performance and Applications of a Hierarchial Network of Hypercubes." Thesis, Indian Institute of Science, 1992. http://hdl.handle.net/2005/53.
Full textAbstract:
This thesis, presents a multiprocessor topology, the hierarchical network of hyper-cubes, which has a low diameter, low degree of connectivity and yet exhibits hypercube like versatile characteristics. The hierarchical network of hyper-cubes consists of k-cubes interconnected in two or more hierarchical levels. The network has a hierarchical, expansive, recursive structure with a constant pre-defined building block. The basic building block of the hierarchical network of hyper-cubes comprises of a k-cube of processor elements and a network controller. The hierarchical network of hyper-cubes retains the positive features of the k-cube at different levels of hierarchy and has been found to perform better than the binary hypercube in executing a variety of application problems. The ASCEND/DESCEND class of algorithms can be executed in O(log2 N) parallel steps (N is the number of data elements) on a hierarchical network of hypercubes with N processor elements. A description of the topology of the hierarchical network of hypercubes is presented and its architectural potential in terms of fault-tolerant message routing, executing a class of highly parallel algorithms, and in simulating artificial neural networks is analyzed. Further, the proposed topology is found to be very efficient in executing multinode broadcast and total exchange algorithms. We subsequently, propose an improvisation of the network to counter faults, and explore implementation of artificial neural networks to demonstrate efficient implementation of application problems on the network. The fault-tolerant capabilities of the hierarchical network of hypercubes with two network controllers per k-cube of processor elements are comparable to those of the hypercube and the folded hypercube.
We also discuss various issues related to the suitability of multiprocessor architectures for simulating neural networks. Performance analysis of ring, hypercube, mesh and hierarchical network of hypercubes for simulating artificial neural networks is presented. Our studies reveal that the performance of the hierarchical network of hypercubes is better than those of ring, mesh, hypernet and hypercube topologies in implementing artificial neural networks.
Design and implementation aspects of hierarchical network of hypercubes based on two schemes, viz., dual-ported RAM communication, and transputers are also presented. Results of simulation studies for robotic applications using neural network paradigms on the transputer-based hierarchical network of hypercubes reveal that the proposed network can produce fast response times of the order of hundred microseconds.
25
Huang, Henna Priscilla. "Hybrid flow data center network architecture design and analysis." Thesis, Massachusetts Institute of Technology, 2017. http://hdl.handle.net/1721.1/108998.
Full textAbstract:
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2017.Cataloged from PDF version of thesis.
Includes bibliographical references (pages 127-132).
In this thesis, we propose a hybrid flow network architecture for future data center. The hybrid flow architecture has its origins in the early 1990s with studies on all-optical networks and fiber-optical computer networks. Research in optical flow switching has spanned over two decades. Our contribution to the study of all-optical networks is on the performance of hybrid flow data center networks. We compare the delay performance of hybrid flow architectures and traditional packet switched networks in future data center. We present a simplified data center traffic model, where data center traffic is categorized into mice traffic and elephant flows. The electronic packet switched architecture allows for low overhead and complexity for small transactions. However, mice traffic suffers as the size, fraction, and arrival rates of elephant flows increase. In the hybrid flow architecture, elephant flows are transmitted on an all-optical flow-switched data plane, where wavelength channels are reserved for the duration of a flow. In addition, the hybrid flow architecture allows for the dynamic allocation of optical wavelengths. In electronic packet switched networks, wavelength assignments are static, where traditional networking protocols do not consider the optical domain in routing decisions. We show that the hybrid flow architecture allows for superior delay performance compared to the electronic packet switched architecture as data rates and data volume increase in future data center networks.
by Henna Huang.
Ph. D.
26
Morrison, Joseph Derek. "A scalable multiprocessor architecture using Cartesian Network-Relative Addressing." Thesis, Massachusetts Institute of Technology, 1989. http://hdl.handle.net/1721.1/14200.
Full textAbstract:
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1989.Includes bibliographical references (leaves 101-102).
by Joseph Derek Morrison.
M.S.
27
Zheng, Xijia Ph D. Massachusetts Institute of Technology. "Metropolitan Area Network architecture design for Optical Flow switching." Thesis, Massachusetts Institute of Technology, 2015. http://hdl.handle.net/1721.1/99798.
Full textAbstract:
Thesis: S.M., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2015.Cataloged from PDF version of thesis.
Includes bibliographical references (pages 85-86).
Optical Flow switching (OFS) is a key enabler of future scalable all-optical networks for the large traffic flows. In this thesis, we provide design concepts of efficient physical topology and routing architectures for an all-optical Metropolitan Area Network (MAN) that supports OFS. We use all-to-one stochastic flows to model inter-MAN traffic demands and adopt Moore Graphs and Generalized Moore Graphs as the physical topology. We found good MAN architectures are coupled intimately with media access control protocol designs and must be optimized jointly. Two routing architectures that represent extreme cases were proposed and examined: Quasi-Static Architecture (QSA) and Dynamic Per Flow Routing Architecture (DPFRA). The performance and costs are compared to provide an economical architecture building strategy. We find for the MAN, DPFRA always has the lower queueing delay and lower blocking probability than that of QSA at the expense of more complexity in scheduling, switching, and network management and control. Our analysis based on Moore Graphs and Generalized Moore Graphs indicates that QSA becomes cheaper when the product of the average offered load per node and the normalized delay are equal to or larger than ~ 2 units of wavelengths, with both architectures essentially meeting the same delay or blocking probability requirements. Also, the cost boundary shows that DPFRA with shortest-queue node first routing strategy (sq-first strategy) is preferred only when the delay requirement is stringent and the offered load is low, while QSA is much more suitable for the all-optical MAN to accommodate modest to heavy network traffic. Since OFS is only going to be used in heavy load situations brought on by elephants in the traffic, QSA is the preferred architecture. We have shown the hybrid architecture of QSA and DPFRA is impractical and thus it should be avoided.
by Xijia Zheng.
S.M.
28
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.
29
Alrashoud, Eiman. "CHILDREN’S SOCIAL NETWORK: KIDS CLUB." CSUSB ScholarWorks, 2017. https://scholarworks.lib.csusb.edu/etd/451.
Full textAbstract:
Young children often have a profound interest that if nurtured, would develop to great social cues and skills thereby improving their social aspects of life. Parents can conveniently benefit from a swift data sharing in the collaborative scrutiny of their kid's participation, in public activities facilitated through the internet digital technology. To facilitate the involvement of shared activities among children, an interactive website is essential. The aim of my project is to develop a website that is intended to be an interactive platform for a variety of events selection. Additionally, the website will aid parents in the creation, discovery and reach for organized local events that fit their kid's interests in description and age. A variety of events will be availed at the website for scrutiny in finding friends, sharing and learning new activities. Similarly, it will be used for fun engagement. The website is implemented by using Microsoft Visual Studio 2012 Professional, C# programming language, and SQL Server Management Studio 2012 to handle the data.
30
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
31
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
32
Wu, Huaping. "An Express Network-on-Chip (ExNoC) Cache Architecture for Large Caches." University of Cincinnati / OhioLINK, 2011. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1307323725.
Full text
33
Wang, Baoyu. "An architecture for domain based distributed systems management." Thesis, Lancaster University, 1989. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.277397.
Full text
34
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
35
Ades, S. "An architecture for integrated services on the local area network." Thesis, University of Cambridge, 1987. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.377199.
Full text
36
Sheldon, Mark A. (Mark Alan). "Content routing : a scalable architecture for network-based information discovery." Thesis, Massachusetts Institute of Technology, 1995. http://hdl.handle.net/1721.1/40583.
Full textAbstract:
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1996.Includes bibliographical references (p. 134-141).
by Mark A. Sheldon.
Ph.D.
37
Norman, David. "The value proposition of service-oriented architecture." [Denver, Colo.] : Regis University, 2008. http://165.236.235.140/lib/DNorman2008.pdf.
Full text
38
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
39
Arulampalam, Ganesh. "A generalised feedforward neural network architecture and its applications to classification and regression." Thesis, Edith Cowan University, Research Online, Perth, Western Australia, 2004. https://ro.ecu.edu.au/theses/789.
Full textAbstract:
Shunting inhibition is a powerful computational mechanism that plays an important role in sensory neural information processing systems. It has been extensively used to model some important visual and cognitive functions. It equips neurons with a gain control mechanism that allows them to operate as adaptive non-linear filters. Shunting Inhibitory Artificial Neural Networks (SIANNs) are biologically inspired networks where the basic synaptic computations are based on shunting inhibition. SIANNs were designed to solve difficult machine learning problems by exploiting the inherent non-linearity mediated by shunting inhibition. The aim was to develop powerful, trainable networks, with non-linear decision surfaces, for classification and non-linear regression tasks. This work enhances and extends the original SIANN architecture to a more general form called the Generalised Feedforward Neural Network (GFNN) architecture, which contains as subsets both SIANN and the conventional Multilayer Perceptron (MLP) architectures. The original SIANN structure has the number of shunting neurons in the hidden layers equal to the number of inputs, due to the neuron model that is used having a single direct excitatory input. This was found to be too restrictive, often resulting in inadequately small or inordinately large network structures.
40
Huang, Shufeng. "A HyperNet Architecture." UKnowledge, 2014. http://uknowledge.uky.edu/cs_etds/18.
Full textAbstract:
Network virtualization is becoming a fundamental building block of future Internet architectures. By adding networking resources into the “cloud”, it is possible for users to rent virtual routers from the underlying network infrastructure, connect them with virtual channels to form a virtual network, and tailor the virtual network (e.g., load application-specific networking protocols, libraries and software stacks on to the virtual routers) to carry out a specific task. In addition, network virtualization technology allows such special-purpose virtual networks to co-exist on the same set of network infrastructure without interfering with each other.
Although the underlying network resources needed to support virtualized networks are rapidly becoming available, constructing a virtual network from the ground up and using the network is a challenging and labor-intensive task, one best left to experts.
To tackle this problem, we introduce the concept of a HyperNet, a pre-built, pre-configured network package that a user can easily deploy or access a virtual network to carry out a specific task (e.g., multicast video conferencing). HyperNets package together the network topology configuration, software, and network services needed to create and deploy a custom virtual network. Users download HyperNets from HyperNet repositories and then “run” them on virtualized network infrastructure much like users download and run virtual appliances on a virtual machine. To support the HyperNet abstraction, we created a Network Hypervisor service that provides a set of APIs that can be called to create a virtual network with certain characteristics.
To evaluate the HyperNet architecture, we implemented several example Hyper-Nets and ran them on our prototype implementation of the Network Hypervisor. Our experiments show that the Hypervisor API can be used to compose almost any special-purpose network – networks capable of carrying out functions that the current Internet does not provide. Moreover, the design of our HyperNet architecture is highly extensible, enabling developers to write high-level libraries (using the Network Hypervisor APIs) to achieve complicated tasks.
41
Akhtar, Kareem A. H. 1977. "Dynamic markup language conversion for improved WAP network architecture and performance." Thesis, Massachusetts Institute of Technology, 2000. http://hdl.handle.net/1721.1/8943.
Full textAbstract:
Thesis (M.Eng. and S.B.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, February 2001.Includes bibliographical references (leaf 57).
The wireless web introduces new flexibility for World Wide Web users and service providers. Users can browse the web with a WAP (Wireless Application Protocol) enabled device such as a cellular phone or a PDA (Personal Digital Assistant)., while service providers can make their services available anytime and anywhere by exploiting the wireless features of the protocol. Moreover, service providers can also make their services available at all times with the proliferation of the internet enabled handheld devices. However, although WAP promises to provide anytime, anywhere flexibility, there are fundamental problems with the new technology facing service providers and users. One significant issue is the transition to the wireless web. For the user, WAP is too slow and browsing is not efficient. Moreover, for the service provider and internet businesses, transitioning their websites to the wireless domain is not very efficient either, for WAP introduces a new markup language, and has various limitations. In this thesis, develop various applications for improving the wireless experience for service providers and users. I introduce a solution for dynamic, on-the-fly conversion of a website for improved network performance, a tool for converting and managing a complete website to the wireless domain, and finally, a method to exploit caching of developed wireless sites also for improved network performance.
by Kareem A.H. Akhtar.
M.Eng.and S.B.
42
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.
43
Pearce, Richard Sargon. "Some aspects of a code division multiple access local area network." Thesis, Durham University, 1987. http://etheses.dur.ac.uk/6810/.
Full text
44
Zhuang, Shixin. "Stochastic modeling and performance analysis of differentiated service architecture in the Internet /." View Abstract or Full-Text, 2002. http://library.ust.hk/cgi/db/thesis.pl?ELEC%202002%20ZHUANG.
Full textAbstract:
Thesis (M. Phil.)--Hong Kong University of Science and Technology, 2002.Includes bibliographical references (leaves 67-69). Also available in electronic version. Access restricted to campus users.
45
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
46
Gan, Ge. "CDP a multithreaded implementation of a network communication protocol on the Cyclops-64 multithreaded architecture /." Access to citation, abstract and download form provided by ProQuest Information and Learning Company; downloadable PDF file, 58 p, 2007. http://proquest.umi.com/pqdweb?did=1253511001&sid=1&Fmt=2&clientId=8331&RQT=309&VName=PQD.
Full text
47
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
48
Tsai, Shang-Yuan. "Device profiling analysis in Device-Aware Network." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2004. http://library.nps.navy.mil/uhtbin/hyperion/04Dec%5FTsai.pdf.
Full textAbstract:
Thesis (M.S. in Systems Engineering)--Naval Postgraduate School, December 2004.Thesis advisor(s): Singh Gurminder, John Gibson. Includes bibliographical references (p. 65-66). Also available online.
49
Feng, Yu Hamerly Gregory James. "PG-means : learning the number of clusters in data /." Waco, Tex. : Baylor University, 2006. http://hdl.handle.net/2104/5021.
Full text
50
Pavlou, Georgios. "Telecommunications management network : a novel approach for its architecture through software platforms." Thesis, University College London (University of London), 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.300448.
Full text