Spelling suggestions: "subject:"anetwork 1topology"" "subject:"anetwork cotopology""
41 |
Ad Hoc Networks Measurement Model and Methods Based on Network TomographyYao, Ye 08 July 2011 (has links) (PDF)
The measurability of Mobile ad hoc network (MANET) is the precondition of itsmanagement, performance optimization and network resources re-allocations. However, MANET is an infrastructure-free, multi-hop, andself-organized temporary network, comprised of a group of mobile nodes with wirelesscommunication devices. Not only does its topology structure vary with time going by, butalso the communication protocol used in its network layer or data link layer is diverse andnon-standard.In order to solve the problem of interior links performance (such as packet loss rate anddelay) measurement in MANET, this thesis has adopted an external measurement basedon network tomography (NT). To the best of our knowledge, NT technique is adaptable for Ad Hoc networkmeasurement.This thesis has deeply studied MANET measurement technique based on NT. The maincontributions are:(1) An analysis technique on MANET topology dynamic characteristic based onmobility model was proposed. At first, an Ad Hoc network mobility model formalizationis described. Then a MANET topology snapshots capturing method was proposed to findand verify that MANET topology varies in steady and non-steady state in turnperiodically. At the same time, it was proved that it was practicable in theory to introduceNT technique into Ad Hoc network measurement. The fitness hypothesis verification wasadopted to obtain the rule of Ad Hoc network topology dynamic characteristic parameters,and the Markov stochastic process was adopted to analyze MANET topology dynamiccharacteristic. The simulation results show that the method above not only is valid andgenerable to be used for all mobility models in NS-2 Tool, but also could obtain thetopology state keeping experimental formula and topology state varying probabilityformula.IV(2) An analysis technique for MANET topology dynamic characteristic based onmeasurement sample was proposed. When the scenario file of mobile models could notbe obtained beforehand, End-to-End measurement was used in MANET to obtain thepath delay time. Then topology steady period of MANET is inferred by judging whetherpath delay dithering is close to zero. At the same time, the MANET topology wasidentified by using hierarchical clustering method based on measurement sample of pathperformance during topology steady period in order to support the link performanceinference. The simulation result verified that the method above could not only detect themeasurement window time of MANET effectively, but also identify the MANETtopology architecture during measurement window time correctly.(3) A MANET link performance inference algorithm based on linear analysis modelwas proposed. The relation of inequality between link and path performance, such as lossrate of MANET, was deduced according to a linear model. The phenomena thatcommunication characteristic of packets, such as delay and loss rate, is more similarwhen the sub-paths has longer shared links was proved in the document. When the rankof the routing matrix is equal to that of its augmentation matrix, the linear model wasused to describe the Ad Hoc network link performance inference method. The simulationresults show that the algorithm not only is effective, but also has short computing time.(4) A Link performance inference algorithm based on multi-objectives optimizationwas proposed. When the rank of the routing matrix is not equal to that of its augmentationmatrix, the link performance inference was changed into multi-objectives optimizationand genetic algorithm is used to infer link performance. The probability distribution oflink performance in certain time t was obtained by performing more measurements andstatistically analyzing the hypo-solutions. Through the simulation, it can be safelyconcluded that the internal link performance, such as, link loss ratio and link delay, can beinferred correctly when the rank of the routing matrix is not equal to that of itsaugmentation matrix.
|
42 |
The Use of Demand-wise Shared Protection in Creating Topology Optimized High Availability NetworksTodd, Brody Unknown Date
No description available.
|
43 |
Computer-aided topological analysis of active networksTofigh, Farshid. January 1982 (has links)
Thesis (M.S.)--Ohio University, March, 1982. / Title from PDF t.p.
|
44 |
Ranch a dynamic network topology /Li, Xiaozhou, Plaxton, C. Greg, January 2004 (has links) (PDF)
Thesis (Ph. D.)--University of Texas at Austin, 2004. / Supervisor: Greg Plaxton. Vita. Includes bibliographical references. Also available from UMI.
|
45 |
Material transport system design in manufacturingWan, Yen-Tai. January 2006 (has links)
Thesis (Ph. D.)--Industrial and Systems Engineering, Georgia Institute of Technology, 2006. / Dr. Yih-Long Chang, Committee Member ; Dr. Martin Savelsbergh, Committee Member ; Dr. Leon McGinnis, Committee Co-Chair ; Dr. Gunter Sharp, Committee Chair ; Dr. Doug Bodner, Committee Member ; Dr. Joel Sokol, Committee Member.
|
46 |
A Fast and Efficient Method for Power Distribution Network ReconfigurationEkstrand, Aaron Jordan 01 May 2017 (has links)
We have proposed a method by which the topology of a network might be discovered through an algorithm like the distributed Bellman-Ford algorithm. We have explored the inner workings of two methods to automate power distribution network reconfiguration, the ILP Solver and the Heuristic Solver. We have seen how networks of different shapes can be translated into a flattened topology, which is necessary preprocessing to find a power assignment solution for a network. We have also seen some experimental results comparing the performance of the ILP Solver and the Heuristic Solver. The Heuristic Solver is a very fast, efficient algorithm to reconfigure power distribution, which is important in the case of an emergency. It performs consistently with near perfect results at a speed that is orders of magnitude quicker than the ILP Solver in almost all cases. In an application where a network is small and time is not an important constraint, the ILP Solver could possibly be preferable, but in any context where time is sensitive and near-perfect results are as acceptable as perfect results, the Heuristic Solver is much preferable. There is always room for improvement. Future tests should perhaps allow for non-integer capacity units, or loads that require other values than unit capacity. Optimizing each algorithm by rewriting them in C could give more optimized tests, though this may not be necessary to make judgments about implementing one or the other. There may be some ways to improve the Heuristic Solver, such as arranging the ordered_links in some way that could be more optimal. The algorithm could also be improved by taking advantage of the fact that once there are no more sources with capacity to provide any loads, the process of trying to assign loads to them for power supply can cease. Perhaps this method could be combined with other methods that do not presently account for load priorities or place as much value on fast execution.
|
47 |
A Simulation Framework for Efficient Search in P2P Networks with 8-Point HyperCirclesAbbas, Syed Muhammad, Henricsson, Christopher January 2008 (has links)
This report concerns the implementation of a simulation framework to evaluate an emerging peer-to-peer network topology scheme using 8-point hypercircles, entitled HyperCircle. This topology was proposed in order to alleviate some of the drawbacks of current P2P systems evolving in an uncontrolled manner, such as scalability issues, network overload and long search times. The framework is supposed to be used to evaluate the advantages of this new topology. The framework has been built on top of an existing simulator software solution, the selection of which was an important part of the development. Weighing different variables such as scalability and API usability, the selection fell on OverSim, an open-source discreet-event simulator based on OMNET++. After formalizing the protocol for easier implementation, as well as extending it for better performance, implementation followed using C++ with OverSim’s API and simulation library. Implemented as a module (alongside other stock modules providing their own protocols such as Chord and Kademlia), it can be used in OverSim to simulate a user-defined network using one of the simulation routine applications provided (or using a custom application written by the user). For the purposes of this thesis, the standard application KBRTestApp was used; an application sending test messages between randomly selected nodes, while adding and removing nodes at specific time intervals. The adding and removing of nodes can be configured with probability parameters. Tentative testing shows that this implementation of the HyperCircle protocol has a certain performance gain over the OverSim implementations of the Chord and Kademlia protocols, measurable in the time it takes a message to get from sender to recipient. Further testing is outside the scope of this thesis.
|
48 |
Link layer topology discovery in an uncooperative ethernet environmentDelport, Johannes Petrus 27 August 2008 (has links)
Knowledge of a network’s entities and the physical connections between them, a network’s physical topology, can be useful in a variety of network scenarios and applications. Administrators can use topology information for fault- finding, inventorying and network planning. Topology information can also be used during protocol and routing algorithm development, for performance prediction and as a basis for accurate network simulations. Specifically, from a network security perspective, threat detection, network monitoring, network access control and forensic investigations can benefit from accurate network topology information. The dynamic nature of large networks has led to the development of various automatic topology discovery techniques, but these techniques have mainly focused on cooperative network environments where network elements can be queried for topology related information. The primary objective of this study is to develop techniques for discovering the physical topology of an Ethernet network without the assistance of the network’s elements. This dissertation describes the experiments performed and the techniques developed in order to identify network nodes and the connections between these nodes. The product of the investigation was the formulation of an algorithm and heuristic that, in combination with measurement techniques, can be used for inferring the physical topology of a target network. / Dissertation (MSc)--University of Pretoria, 2008. / Computer Science / unrestricted
|
49 |
Context-Aware P2P Network ConstructionKalousek, Jiří January 2017 (has links)
With growing number of devices connected to the network, there is a greater need for use of Peer-to-Peer (P2P) networks and distributed P2P protocols.Devices participating in the P2P network do not usually need to use any central server that links up connections. It has many advantages but it needs to use so-called overlay network that consists of protocols used for traffic routing and decision making. Protocols used in today’s P2P networks are mostly not considerate of particular participating nodes and all the nodes in the network are usually equal. This can have negative impacts on network performance. In order to avoid or reduce some unwanted negative impacts, it would be advantageous if the overlay network could route traffic and make decisions according to context information like battery levels or connection speeds. This work reviews a few popular P2P overlay networks and based on that it introduces an improvement of one of them – Chord. The structure of the improved version of the Chord protocol called Context-Aware Chord is described. Then results of the evaluation are presented. With a use of the improved protocol, nodes can participate longer in the network and throughput of lookup messages is improved.
|
50 |
Indoor mobility modelling for MANETs: an activity approachSumbwanyambe, Mbuyu 15 March 2010 (has links)
M.Ing. / Mobile adhoc networks (MANETs) are multihop wireless topologies that have rapidly changing node structure and limited connectivity. Since MANETs are not deployed on a wide scale, the research community still depends on the simulators such as the network simulator (Ns2) to evaluate MANET protocols. The topic of how to accurately model an indoor environment in the MANET research community is explored in this dissertation. We take an empirical and simulative approach to model our mobility pattern. Our mobility model is based on activity patterns drawn from the transport science. A comparison with the random way point is made in order to understand the weighty discrepancy between the two models. Our contribution in this research is three fold: 1. We argue that mobility modelling should be based on activities other than stochastic process that have got no realistic backing; 2. We model our network using by putting up an algorithm and take an empirical approach to model the radio frequency propagation. To show the difference of the two mobility models, the behaviour of the signal strength on the two mobility models is drawn; and 3. Finally an implementation of our mobility pattern and RF measurements in ns2 is done.
|
Page generated in 0.0335 seconds