Zaloguj się

Gotowe bibliografie tematyczne / Routing (Computer network management) / Rozprawy doktorskie

Rozprawy doktorskie na temat „Routing (Computer network management)”

Kliknij ten link, aby zobaczyć inne rodzaje publikacji na ten temat: Routing (Computer network management).

Autor: Grafiati

Data publikacji: 4 czerwca 2021

Data aktualizacji: 20 lipca 2024

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Sprawdź 50 najlepszych rozpraw doktorskich naukowych na temat „Routing (Computer network management)”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Przeglądaj rozprawy doktorskie z różnych dziedzin i twórz odpowiednie bibliografie.

1

Zhao, Wenrui. "Routing and Network Design in Delay Tolerant Networks". Diss., Georgia Institute of Technology, 2006. http://hdl.handle.net/1853/14085.

Pełny tekst źródła

Streszczenie:

Delay tolerant networks (DTNs) are a class of emerging networks that exhibit significantly different characteristics from today's Internet, such as intermittent connectivity, large delay, and high loss rates. DTNs have important applications in disaster relief, military, rural Internet access, environmental sensing and surveillance, interplanetary communication, underwater sensing, and vehicular communication. While not the common case for networking, DTNs represent some of the most critical cases, where the ability to communicate can make a huge difference for human lives. Supporting effective communication in DTNs, however, is challenging. First, with intermittent connectivity, DTNs are often extremely limited in capacity. Second, given resource limitations and uncertainty in DTNs, it is critical to deliver data efficiently and robustly. The situation is especially acute for multicast which sends data to multiple destinations. This thesis seeks to address these two issues. To enhance network capacity in DTNs, we propose a message ferrying scheme that exploits the use of special mobile nodes (called message ferries) and controlled device mobility to deliver data. Message ferries are utilized to transport data via mobility between sources and destinations. We develop a foundation for the control of the mobility of message ferries, and nodes if possible, to cooperatively deliver data under a variety of conditions. We also study another approach which deploys new nodes called throwboxes to enhance capacity. Throwboxes are small and inexpensive wireless devices. By relaying data between mobile nodes, throwboxes are able to create data transfer opportunities that otherwise would not exist. We systematically investigate the issues of deployment and routing, and develop algorithms for various deployment and routing approaches. Based on extensive evaluation, we obtain several findings to guide the design and operation of throwbox-augmented DTNs. To address the issue of efficient and robust data delivery, we focus on DTN multicasting. Given the unique characteristics of DTNs, traditional solutions such as IP multicast can not be simply ported to DTNs. We identify the limitations of IP multicast semantics in DTNs and define new semantic models for DTN multicast. Based on these semantic models, we develop and evaluate several multicast routing algorithms with different routing strategies.

Style APA, Harvard, Vancouver, ISO itp.

2

Roughgarden, Tim. "Selfish routing". online access from Digital Dissertation Consortium access full-text, 2002. http://libweb.cityu.edu.hk/cgi-bin/er/db/ddcdiss.pl?3050436.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

3

Yan, Wei. "Synchronization, buffer management, and multicast routing in multimedia networks". Diss., Georgia Institute of Technology, 1997. http://hdl.handle.net/1853/13426.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

4

Al-Mousa, Yamin Samir. "MAC/routing design for under water sensor networks /". Online version of thesis, 2007. http://hdl.handle.net/1850/4496.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

5

Al-Amoudi, Ahmed. "Evaluation of virtual routing appliances as routers in a virtual environment /". Online version of thesis, 2008. http://hdl.handle.net/1850/7544.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

6

Jain, Sushant. "Routing in delay tolerant networks /". Thesis, Connect to this title online; UW restricted, 2005. http://hdl.handle.net/1773/6922.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

7

Kulkarni, Shrinivas Bhalachandra. "The simulation studies on a behaviour based trust routing protocol for ad hoc networks". Diss., Online access via UMI:, 2006.

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

8

Praveenkumar, Ramesh. "Investigation of routing protocols in a sensor network". Birmingham, Ala. : University of Alabama at Birmingham, 2006. http://www.mhsl.uab.edu/dt/2006m/praveenkumar.pdf.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

9

Kim, Tae Hyun Sun Min-Te. "Bandwidth-aware routing tree (BART) for underwater 3-D geographic routing". Auburn, Ala, 2008. http://hdl.handle.net/10415/1548.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

10

Zhao, Li. "Enhance communication security in wireless ad hoc networks through multipath routing". Online access for everyone, 2007. http://www.dissertations.wsu.edu/Dissertations/Summer2007/L_Zhao_072407.pdf.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

11

Qi, Bing Biaz Saad. "Routing metrics for multi-hop wireless MESH networks". Auburn, Ala., 2009. http://hdl.handle.net/10415/1705.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

12

Zhu, Yong. "Routing, Resource Allocation and Network Design for Overlay Networks". Diss., Georgia Institute of Technology, 2006. http://hdl.handle.net/1853/14017.

Pełny tekst źródła

Streszczenie:

Overlay networks have been the subject of significant research and practical interest recently in addressing the inefficiency and ossification of the current Internet. In this thesis, we cover various aspects of overlay network design, including overlay routing algorithms, overlay network assignment and multihomed overlay networks. We also examine the behavior of overlay networks under a wide range of network settings and identify several key factors that affect the performance of overlay networks. Based on these findings, practical design guidelines are also given. Specifically, this thesis addresses the following problems: 1) Dynamic overlay routing: We perform an extensive simulation study to investigate the performance of available bandwidth-based dynamic overlay routing from three important aspects: efficiency, stability, and safety margin. Based on the findings, we propose a hybrid routing scheme that achieves good performance in all three aspects. We also examine the effects of several factors on overlay routing performance, including network load, traffic variability, link-state staleness, number of overlay hops, measurement errors, and native sharing effects. 2) Virtual network assignment: We investigate the virtual network (VN) assignment problem in the scenario of network virtualization. Specifically, we develop a basic VN assignment scheme without reconfiguration and use it as the building block for all other advanced algorithms. Subdividing heuristics and adaptive optimization strategies are presented to further improve the performance. We also develop a selective VN reconfiguration scheme that prioritizes the reconfiguration for the most critical VNs. 3) Overlay network configuration tool for PlanetLab: We develop NetFinder, an automatic overlay network configuration tool to efficiently allocate PlanetLab resources to individual overlays. NetFinder continuously monitors the resource utilization of PlanetLab and accepts a user-defined overlay topology as input and selects the set of PlanetLab nodes and their interconnection for the user overlay. 4) Multihomed overlay network: We examine the effectiveness of combining multihoming and overlay routing from the perspective of an overlay service provider (OSP). We focus on the corresponding design problem and examine, with realistic network performance and pricing data, whether the OSP can provide a network service that is profitable, better (in terms of round-trip time), and less expensive than the competing native ISPs.

Style APA, Harvard, Vancouver, ISO itp.

13

Irava, Venkata Srinivas. "Low-cost delay-constrained multicast routing heuristics and their evaluation". Online access for everyone, 2006. http://www.dissertations.wsu.edu/Dissertations/Summer2006/v%5Firava%5F072106.pdf.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

14

Kadiyala, Priyanka Akl Robert G. "Non-uniform grid-based coordinated routing in wireless sensor networks". [Denton, Tex.] : University of North Texas, 2008. http://digital.library.unt.edu/permalink/meta-dc-9078.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

15

Lee, Sang Joon Sun Min-Te. "Practical stateless geographical routing (PSGR) - 3-D stateless geographic routing for underwater acoustic sensor networks". Auburn, Ala, 2008. http://hdl.handle.net/10415/1514.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

16

Wu, Tao. "Off-network control processing for scalable routing in very large sensor networks". Diss., Connect to online resource - MSU authorized users, 2008.

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

17

Mahajan, Ratul. "Practical and efficient internet routing with competing interests /". Thesis, Connect to this title online; UW restricted, 2005. http://hdl.handle.net/1773/6960.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

18

Mazandu, Gaston Kuzamunu. "Traffic Engineering using Multipath Routing Approaches". Thesis, Link to the online version, 2007. http://hdl.handle.net/10019/679.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

19

Du, Plessis Johan. "ACODV ant colony optimisation distance vectoring routing in Ad hoc networks /". Pretoria : [s.n.], 2005. http://upetd.up.ac.za/thesis/available/etd-04112007-184512.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

20

Kothapalli, Hindu. "Localization of nodes in wired and wireless networks". Diss., Rolla, Mo. : Missouri University of Science and Technology, 2009. http://scholarsmine.mst.edu/thesis/pdf/Kothapalli_09007dcc806b7c59.pdf.

Pełny tekst źródła

Streszczenie:

Thesis (M.S.)--Missouri University of Science and Technology, 2009.
Vita. The entire thesis text is included in file. Title from title screen of thesis/dissertation PDF file (viewed August 25, 2009) Includes bibliographical references.

Style APA, Harvard, Vancouver, ISO itp.

21

Chitedze, Zimani. "Mobility management for Wi-Fi infrastructure and mesh networks". University of the Western Cape, 2012. http://hdl.handle.net/11394/2960.

Pełny tekst źródła

Streszczenie:

Magister Scientiae - MSc
This thesis shows that mobility management protocols for infrastructure Internet may be used in a wireless mesh network environment. In this research Mobile IPv6 and Fast Handover for Hierarchical Mobile IPv6 are successfully implemented in a wireless mesh network environment. Two experiments were carried out: vertical and horizontal handover simulations. Vertical handover simulation involved a heterogeneous wireless environment comprising both wireless local area and wireless mesh networks. An OPNET Mobile IPv6 model was used to simulate the vertical handover experiment. Horizontal handover simulation involved Mobile IPv6 and Fast Handover for Hierarchical Mobile IPv6 applied in ns2 wireless mesh network. The vertical handover results show that MIPv6 is able to manage vertical handover between wireless local area and wireless mesh network. The horizontal handover results illustrate that in mesh networks, Fast Handover for Hierarchical Mobile IPv6's performance is superior to Mobile IPv6. Fast Handover for Hierarchical Mobile IPv6 generates more throughput and less delay than Mobile IPv6. Furthermore, Fast Handover for Hierarchical Mobile IPv6 drops less data packets than Mobile IPv6. The simulations indicate that even though there are multi-hop communications in wireless mesh networks, the performance of the multi-hop routing may not play a big role in the handover performance. This is so because the mesh routers are mostly static and the multi-hop routes are readily available. Thus, the total handover delay is not affected too much by the WMN hops in the paths for signaling message transmission.
South Africa

Style APA, Harvard, Vancouver, ISO itp.

22

Eshaftri, Mohamed. "Adaptive energy management mechanisms for cluster based routing wireless sensor networks". Thesis, Edinburgh Napier University, 2017. http://researchrepository.napier.ac.uk/Output/1032654.

Pełny tekst źródła

Streszczenie:

Wireless Sensor Network (WSN) technology has been one of the major avenues of Internet of Things (IoT) due to their potential role in digitising smart physical environments. WSNs are typically composed of a vast number of low-power, low–cost and multifunctional sensor nodes within an area that automatically cooperate to complete the application task. This emerging technology has already contributed to the advancement of a broad range of applications. Nevertheless, the development of WSNs is a challenging issue due to significant concerns, which need to be resolved to take full benefit of this remarkable technology. One of the main challenges of WSNs is how to reduce the energy consumption of a single node, in order to extend the network lifetime and improves the quality of service. For that reason, a newly design energy efficient communication protocol is required to tackle the issue. The clustering protocols designed for communication are alleged to be one of the most efficient solutions that can contribute to network scalability and energy consumption in WSNs. While different clustering protocols have been proposed to tackle the aforementioned issue, those solutions are either not scalable or do not provide the mechanisms to avoid a heavy loaded area. This thesis presents new adaptive energy management mechanisms, through which the limited critical energy source can be wisely managed so that the WSN application can achieve its intended design goals. Three protocols are introduced to manage the energy use. The first protocol presents an intra-cluster CH rotation approach that reduces the need for the execution of a periodical clustering process. The second protocol relates to load balancing in terms of the intra and inter-cluster communication patterns of clusters of unequal sizes. This proposed approach involves computing a threshold value that, when reached, triggers overall network re-clustering, with the condition that the network will be reconfigured into unequal cluster size. The third protocol proposes new performance factors in relation to CH selection. Based on these factors, the aggregated weight of each node is calculated, and the most suitable CH is selected. A comparison with existing communication protocols reveals that the proposed approaches balance effectively the energy consumption among all sensor nodes and significantly increase the network lifetime.

Style APA, Harvard, Vancouver, ISO itp.

23

Motiwala, Murtaza. "An architecture for network path selection". Diss., Georgia Institute of Technology, 2012. http://hdl.handle.net/1853/43576.

Pełny tekst źródła

Streszczenie:

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 beneﬁt from network protocols that allow trafﬁc to be sent over multiple routes en route to a destination. This ability, also called multipath routing, has other signiﬁcant beneﬁts over single-path routing, such as more efﬁciently 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 trafﬁc to end systems. Because most networks are also business entities, and are sensitive to the cost of routing trafﬁc 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 trafﬁc 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 efﬁcient 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 ﬂexible and leads to efﬁcient 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 conﬂicting goals, where the network operators are concerned with saving cost and reducing trafﬁc 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 trafﬁc in a network to enable network operators to reason about "what-if " scenarios and routing trafﬁc on their network.

Style APA, Harvard, Vancouver, ISO itp.

24

Prudich, Philip. "Dynamic Routing using an Overlay Network of Relays". Ohio University / OhioLINK, 2005. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1128723813.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

25

Parashar, Neha. "Design Space Analysis and a Novel Routing Agorithm for Unstructured Networks-on-Chip". PDXScholar, 2010. https://pdxscholar.library.pdx.edu/open_access_etds/89.

Pełny tekst źródła

Streszczenie:

Traditionally, on-chip network communication was achieved with shared medium networks where devices shared the transmission medium with only one device driving the network at a time. To avoid performance losses, it required a fast bus arbitration logic. However, a single shared bus has serious limitations with the heterogeneous and multi-core communication requirements of today's chip designs. Point-to-point or direct networks solved some of the scalability issues, but the use of routers and of rather complex algorithms to connect nodes during each cycle caused new bottlenecks. As technology scales, the on-chip physical interconnect presents an increasingly limiting factor for performance and energy consumption. Network-on-chip, an emerging interconnect paradigm, provide solutions to these interconnect and communication challenges. Motivated by future bottom-up self-assembled fabrication techniques, which are believed to produce largely unstructured interconnect fabrics in a very inexpensive way, the goal of this thesis is to explore the design trade-offs of such irregular, heterogeneous, and unreliable networks. The important measures we care about for our complex on-chip network models are the information transfer, congestion avoidance, throughput, and latency. We use two control parameters and a network model inspired by Watts and Strogatz's small-world network model to generate a large class of different networks. We then evaluate their cost and performance and introduce a function which allows us to systematically explore the trade-offs between cost and performance depending on the designer's requirement. We further evaluate these networks under different traffic conditions and introduce an adaptive and topology-agnostic ant routing algorithm that does not require any global control and avoids network congestion.

Style APA, Harvard, Vancouver, ISO itp.

26

Pirzada, Asad Amir. "Trust-based routing in pure ad-hoc wireless networks". University of Western Australia. School of Computer Science and Software Engineering, 2007. http://theses.library.uwa.edu.au/adt-WU2007.0193.

Pełny tekst źródła

Streszczenie:

[Truncated abstract] An ad-hoc network of wireless nodes is a temporarily formed network, created, operated and managed by the nodes themselves. Due to its peculiar establishment and operational properties it is also often termed an infrastructure-less, self-organised, or spontaneous network. In order to extend the communication range of the nodes, beyond a single hop, specially configured routing protocols are used. The unique feature of these protocols is their ability to form routes in spite of a dynamic topology. For effective functioning of the network it is essential that the network nodes execute the routing protocols in a truthful manner regardless of their contemporary commitments and workload. In real life, this is more than often extremely difficult to realise, and so we often find malicious nodes also present in the same network. These nodes can either join externally or may originate internally by compromis- ing an existing benevolent node in the network. These malicious nodes can carry out an array of attacks against the routing protocols leading to route severing, unavailability of service or deception. A number of secure routing protocols, which make use of cryptographic algorithms to secure the routes, have recently been proposed. ... In order to sustain the improvised nature of ad-hoc networks, in this thesis, we have moved from the common mechanism of achieving trust via security to enforcing dependability through collaboration. We desist from the customary strategy of employing cryptography and instead use a trust model that is influ- enced by the human behavioural model. All nodes in the network independently execute this trust model and maintain their own assessment concerning other nodes in the network. Each node, based upon its individual experiences, rewards collabo- rating nodes for their benevolent behaviour and penalises malicious nodes for their malevolent conduct. To highlight the efficacy of this unique approach, we apply the trust model to three contemporary reactive routing protocols in a pure ad-hoc network. These trust reinforced routing protocols locate dependable routes in the network by observing the sincerity in participation of other nodes using a set of trust categories. The routes worked out in this way are neither protected in terms of security nor minimal in terms of hops. However, these routes traverse nodes, which have been identified as more trustworthy than others and for this reason are more dependable in extemporised circumstances. Through the help of extensive simulations, we have demonstrated that the usage of these protocols significantly improves the overall performance of the network even in the presence of a high percentage of malicious nodes. These protocols, being independent of a trust infrastructure, also enable rapid deployment and improved operation with dynamic adaptation to the current scenario. The prime advantage being gained is the ability to seamlessly integrate ad-hoc wireless networks belonging to dissimilar organisations.

Style APA, Harvard, Vancouver, ISO itp.

27

James, Ingrimar. "A cisco-based proposal for ARNe core routing infrastructure". [Denver, Colo.] : Regis University, 2009. http://adr.coalliance.org/codr/fez/view/codr:145.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

28

Kolar, Vinay. "Routing and traffic-engineering in multi-hop wireless networks an optimization based approach /". Diss., Online access via UMI:, 2007.

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

29

Kadiyala, Priyanka. "Non-Uniform Grid-Based Coordinated Routing in Wireless Sensor Networks". Thesis, University of North Texas, 2008. https://digital.library.unt.edu/ark:/67531/metadc9078/.

Pełny tekst źródła

Streszczenie:

Wireless sensor networks are ad hoc networks of tiny battery powered sensor nodes that can organize themselves to form self-organized networks and collect information regarding temperature, light, and pressure in an area. Though the applications of sensor networks are very promising, sensor nodes are limited in their capability due to many factors. The main limitation of these battery powered nodes is energy. Sensor networks are expected to work for long periods of time once deployed and it becomes important to conserve the battery life of the nodes to extend network lifetime. This work examines non-uniform grid-based routing protocol as an effort to minimize energy consumption in the network and extend network lifetime. The entire test area is divided into non-uniformly shaped grids. Fixed source and sink nodes with unlimited energy are placed in the network. Sensor nodes with full battery life are deployed uniformly and randomly in the field. The source node floods the network with only the coordinator node active in each grid and the other nodes sleeping. The sink node traces the same route back to the source node through the same coordinators. This process continues till a coordinator node runs out of energy, when new coordinator nodes are elected to participate in routing. Thus the network stays alive till the link between the source and sink nodes is lost, i.e., the network is partitioned. This work explores the efficiency of the non-uniform grid-based routing protocol for different node densities and the non-uniform grid structure that best extends network lifetime.

Style APA, Harvard, Vancouver, ISO itp.

30

Barragan, Dante E. "Optimal placement of sensors for network lifetime extension in wireless sensor networks with dynamic routing". To access this resource online via ProQuest Dissertations and Theses @ UTEP, 2008. http://0-proquest.umi.com.lib.utep.edu/login?COPT=REJTPTU0YmImSU5UPTAmVkVSPTI=&clientId=2515.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

31

Zhang, Xin. "Network Formation and Routing for Multi-hop Wireless Ad-Hoc Networks". Diss., Georgia Institute of Technology, 2006. http://hdl.handle.net/1853/11470.

Pełny tekst źródła

Streszczenie:

An energy-aware on-demand Bluetooth scatternet formation and routing protocol taking into account network architecture and traffic pattern is proposed. The scatternet formation protocol is able to cope with multiple sources initiating traffic simultaneously as well as prolong network lifetime. A modified Inquiry scheme using extended ID packet is introduced for fast device discovery and power efficient propagation of route request messages with low delay. A mechanism employing POLL packets in Page processes is proposed to transfer scatternet formation and route reply information without extra overhead. In addition, the energy aware forwarding nodes selection scheme is based on local information and results in more uniform network resource utilization and improved network lifetime. Simulation results show that this protocol can provide scatternet formation with reasonable delay and with good load balance which results in prolonged network lifetime for Bluetooth-based wireless sensor networks. In this research, a metric-based scatternet formation algorithm for the Bluetooth-based sensor motes is presented. It optimizes the Bluetooth network formation from the hop distance and link quality perspectives. In addition, a smart repair mechanism is proposed to deal with link/node failure and recover the network connectivity promptly with low overhead. The experiments with the Intel Mote platform demonstrate the effectiveness of the optimizations. This research also investigates the scalability of ad hoc routing protocols in very large-scale wireless ad hoc networks. A comprehensive simulation study is conducted of the performance of an on-demand routing protocol on a very large-scale, with as many as 50,000 nodes in the network. The scalability analysis is addressed based on various network sizes, node density, traffic load, and mobility. The reasons for packet loss are analyzed and categorized at each network layer. Based on the observations, we observe the effect of the parameter selection and try to exhaust the scalability boundary of the on-demand routing protocol for wireless ad hoc networks.

Style APA, Harvard, Vancouver, ISO itp.

32

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.

Pełny tekst źródła

Streszczenie:

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.

Style APA, Harvard, Vancouver, ISO itp.

33

Srinivasan, Sridhar. "Design and Use of Managed Overlay Networks". Diss., Georgia Institute of Technology, 2007. http://hdl.handle.net/1853/14501.

Pełny tekst źródła

Streszczenie:

As the role of the Internet has been steadily gaining in importance, overlays are increasingly being used to provide new services and to deploy older ones. Some of the services for which overlays have been proposed include multicast, quality of service (QoS), search, and resilient networks. The use of overlays, in turn, has led to more interest in improving their performance. The performance of an overlay network depends significantly on how the network is structured, i.e., the placement of the nodes in the underlying network topology, the links between the overlay nodes and the access links of these nodes. This thesis focuses on algorithms for improving the performance of

Style APA, Harvard, Vancouver, ISO itp.

34

Paturu, Raghunatha Rao Nityananda Suresh. "Path Planning under Failures in Wireless Sensor Networks". Thesis, North Dakota State University, 2013. http://hdl.handle.net/10365/22971.

Pełny tekst źródła

Streszczenie:

This paper explores how an all pair shortest path can be obtained in a wireless sensor network when sensors fail. Sensors are randomly deployed in a predefined geographical area, simulating the deployment of sensors from an airplane, and finding shortest path between all the sensors deployed based on distance. A major problem to address in wireless sensor networks is the impact of sensor failures on existing shortest paths in the network. An application is developed to simulate a network and find shortest paths affected by a sensor failure and find alternative shortest path. When a sensor fails, all the shortest paths and all the remaining sensors in the network are checked to see if the sensor failure has any impact on the network. Alternative shortest path is calculated for those paths affected by sensor failures.

Style APA, Harvard, Vancouver, ISO itp.

35

Guo, Ruirui. "High performance cache architectures for IP routing : replacement, compaction and sampling schemes". Online access for everyone, 2007. http://www.dissertations.wsu.edu/Dissertations/Summer2007/r_guo_072307.pdf.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

36

Tsang, Cheuk-man Mark, i 曾卓敏. "Multicast techniques for bandwidth-demanding applications in overlay networks". Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2008. http://hub.hku.hk/bib/B40687508.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

37

Tsang, Cheuk-man Mark. "Multicast techniques for bandwidth-demanding applications in overlay networks". Click to view the E-thesis via HKUTO, 2008. http://sunzi.lib.hku.hk/hkuto/record/B40687508.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

38

Seetharaman, Srinivasan. "Analyzing Cross-layer Interaction in Overlay Networks". Diss., Georgia Institute of Technology, 2007. http://hdl.handle.net/1853/19806.

Pełny tekst źródła

Streszczenie:

Overlay networks have recently gained popularity as a viable alternative to overcome functionality limitations of the Internet (e.g., lack of QoS, multicast routing). They offer enhanced functionality to end-users by forming an independent and customizable virtual network over the native network. Typically, the routing at the overlay layer operates independent of that at the underlying native layer. There are several potential problems with this approach because overlay networks are selfish entities that are chiefly concerned with achieving the routing objective of their own users. This leads to complex cross-layer interactions between the native and overlay layers, and often tends to degrade the achieved performance for both layers. As overlay applications proliferate and the amount of selfish overlay traffic surges, there is a clear need for understanding the complex interactions and for strategies to manage them appropriately. Our work addresses these issues in the context of "service overlay networks", which represent virtual networks formed of persistent nodes that collaborate to offer improved services to actual end-systems. Typically, service overlays alter the route between the overlay nodes in a dynamic manner in order to satisfy a selfish objective. The objective of this thesis is to improve the stability and performance of overlay routing in this multi-layer environment.

We investigate the common problems of functionality overlap, lack of cross-layer awareness, mismatch or misalignment in routing objectives and the contention for native resources between the two layers. These problems often lead to deterioration in performance for the end-users. This thesis presents an analysis of the cross-layer interaction during fault recovery, inter-domain policy enforcement and traffic engineering in the multi-layer context. Based on our characterization of the interaction, we propose effective strategies that improve overall routing performance, with minimal side-effects on other traffic. These strategies typically 1) increase the layer-awareness (awareness of information about the other layer) at each layer, 2) introduce better control over routing dynamics and 3) offer improved overlay node placement options. Our results demonstrate how applying these strategies lead to better management of the cross-layer interaction, which in turn leads to improved routing performance for end-users.

Style APA, Harvard, Vancouver, ISO itp.

39

Cappetto, Peter Michael. "History-based route selection for reactive ad hoc routing protocols". Online access for everyone, 2007. http://www.dissertations.wsu.edu/Thesis/Spring2007/p_cappetto_042207.pdf.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

40

Balamuru, Vinay Gopal. "The Role of Intelligent Mobile Agents in Network Management and Routing". Thesis, University of North Texas, 2000. https://digital.library.unt.edu/ark:/67531/metadc2736/.

Pełny tekst źródła

Streszczenie:

In this research, the application of intelligent mobile agents to the management of distributed network environments is investigated. Intelligent mobile agents are programs which can move about network systems in a deterministic manner in carrying their execution state. These agents can be considered an application of distributed artificial intelligence where the (usually small) agent code is moved to the data and executed locally. The mobile agent paradigm offers potential advantages over many conventional mechanisms which move (often large) data to the code, thereby wasting available network bandwidth. The performance of agents in network routing and knowledge acquisition has been investigated and simulated. A working mobile agent system has also been designed and implemented in JDK 1.2.

Style APA, Harvard, Vancouver, ISO itp.

41

Rakotoarivelo, Thierry Electrical Engineering &amp Telecommunications Faculty of Engineering UNSW. "Distributed discovery and management of alternate internet paths with enhanced quality of service". Awarded by:University of New South Wales. School of Electrical Engineering and Telecommunications, 2006. http://handle.unsw.edu.au/1959.4/27316.

Pełny tekst źródła

Streszczenie:

The convergence of recent technology advances opens the way to new ubiquitous environments, where network-enabled devices collectively form invisible pervasive computing and networking environments around the users. These users increasingly require extensive applications and capabilities from these devices. Recent approaches propose that cooperating service providers, at the edge of the network, offer these required capabilities (i.e services), instead of having them directly provided by the devices. Thus, the network evolves from a plain communication medium into an endless source of services. Such a service, namely an overlay application, is composed of multiple distributed application elements, which cooperate via a dynamic communication mesh, namely an overlay association. The Quality of Service (QoS) perceived by the users of an overlay application greatly depends on the QoS on the communication paths of the corresponding overlay association. This thesis asserts and shows that it is possible to provide QoS to an overlay application by using alternate Internet paths resulting from the compositions of independent consecutive paths. Moreover, this thesis also demonstrates that it is possible to discover, select and compose these independent paths in a distributed manner within an community comprising a limited large number of autonomous cooperating peers, such as the fore-mentioned service providers. Thus, the main contributions of this thesis are i) a comprehensive description and QoS characteristic analysis of these composite alternate paths, and ii) an original architecture, termed SPAD (Super-Peer based Alternate path Discovery), which allows the discovery and selection of these alternate paths in a distributed manner. SPAD is a fully distributed system with no single point of failure, which can be easily and incrementally deployed on the current Internet. It empowers the end-users at the edge of the network, allowing them to directly discover and utilize alternate paths.

Style APA, Harvard, Vancouver, ISO itp.

42

Li, Yingjie. "Information dissemination and routing in communication networks". Columbus, Ohio : Ohio State University, 2005. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=osu1132767756.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

43

Paudel, Bandana. "On the effects of small-scale fading and mobility in mobile wireless communication network". Diss., Rolla, Mo. : Missouri University of Science and Technology, 2009. http://scholarsmine.mst.edu/thesis/pdf/Paudel_09007dcc806c00f9.pdf.

Pełny tekst źródła

Streszczenie:

Thesis (M.S.)--Missouri University of Science and Technology, 2009.
Vita. The entire thesis text is included in file. Title from title screen of thesis/dissertation PDF file (viewed August 25, 2009) Includes bibliographical references (p. 71-73).

Style APA, Harvard, Vancouver, ISO itp.

44

Shao, Wenjian. "Quality of service support in mobile Ad Hoc networks". Click to view the E-thesis via HKUTO, 2006. http://sunzi.lib.hku.hk/hkuto/record/B37042154.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

45

Shao, Wenjian, i 邵文簡. "Quality of service support in mobile Ad Hoc networks". Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2006. http://hub.hku.hk/bib/B37042154.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

46

James, Andrew Michael. "A link-quality-aware graph model for cognitive radio network routing topology management /". Online version of thesis, 2007. http://hdl.handle.net/1850/5209.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

47

Liu, Chao. "Efficient Publish/Subscribe System over Mobile Ad-Hoc Network". Thesis, North Dakota State University, 2012. https://hdl.handle.net/10365/26485.

Pełny tekst źródła

Streszczenie:

Information dissemination is an important issue for mobile ad-hoc communities. This issue is very challenging due to the dynamic and fragile nature of the mobile ad-hoc networks, in which participants have limited computing resources and battery, intermittent network connections, and mobile tasks. To address the aforementioned issue, this thesis proposes an efficient semantics-based publish/subscribe strategy. In our proposed publish/subscribe system, distributed mobile participants are organized into clusters based on their location proximity. A compact semantics-based indexing scheme is provided to guide information flow. Intra- and inter- cluster routings are proposed to assist efficient propagation of event notifications. A comprehensive set of simulation experiments prove the effectiveness of the proposed scheme.

Style APA, Harvard, Vancouver, ISO itp.

48

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.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

49

Tipper, David Warren. "Adaptive routing, flow control, and buffer management in computer communication networks". Diss., The University of Arizona, 1988. http://hdl.handle.net/10150/184526.

Pełny tekst źródła

Streszczenie:

Adaptive routing and flow control methods are necessary in computer networks due to the nonstationary conditions that exist in such networks. In this dissertation three distinct yet complementary approaches to modeling computer networks for performance evaluation and control under nonstationary conditions are presented namely: queueing theory, discrete event simulation, and state variable modeling. The application of these techniques to the design and performance evaluation of adaptive routing and flow control methods is demonstrated with the development of a new two-level hierarchical adaptive buffer management scheme and a dynamic virtual circuit routing policy.

Style APA, Harvard, Vancouver, ISO itp.

50

Chen, Lei Lee Chung-wei. "On secure media streaming with path diversity in MANETs". Auburn, Ala., 2007. http://repo.lib.auburn.edu/Send%2002-04-08/CHEN_LEI_20.pdf.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!