Dissertations / Theses on the topic 'Management Computer networks'
To see the other types of publications on this topic, follow the link: Management Computer networks.
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Management Computer networks.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
1
Wells, Daniel David. "Network management for community networks." Thesis, Rhodes University, 2010. http://hdl.handle.net/10962/d1006587.
Full textAbstract:
Community networks (in South Africa and Africa) are often serviced by limited bandwidth network backhauls. Relative to the basic needs of the community, this is an expensive ongoing concern. In many cases the Internet connection is shared among multiple sites. Community networks may also have a lack of technical personnel to maintain a network of this nature. Hence, there is a demand for a system which will monitor and manage bandwidth use, as well as network use. The proposed solution for community networks and the focus within this dissertation, is a system of two parts. A Community Access Point (CAP) is located at each site within the community network. This provides the hosts and servers at that site with access to services on the community network and the Internet, it is the site's router. The CAP provides a web based interface (CAPgui) which allows configuration of the device and viewing of simple monitoring statistics. The Access Concentrator (AC) is the default router for the CAPs and the gateway to the Internet. It provides authenticated and encrypted communication between the network sites. The AC performs several monitoring functions, both for the individual sites and for the upstream Internet connection. The AC provides a means for centrally managing and effectively allocating Internet bandwidth by using the web based interface (ACgui). Bandwidth use can be allocated per user, per host and per site. The system is maintainable, extendable and customisable for different network architectures. The system was deployed successfully to two community networks. The Centre of Excellence (CoE) testbed network is a peri-urban network deployment whereas the Siyakhula Living Lab (SLL) network is a rural deployment. The results gathered conclude that the project was successful as the deployed system is more robust and more manageable than the previous systems.
2
Sundaresan, Latha. "Simple network management protocol /." Online version of thesis, 1995. http://hdl.handle.net/1850/12254.
Full text
3
Aitken, William Theodore Carleton University Dissertation Engineering Electrical. "Network management standards from the fault management perspective." Ottawa, 1992.
Find full text
4
Hanikat, Marcus. "Centralized log management for complex computer networks." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-254292.
Full textAbstract:
In modern computer networks log messages produced on different devices throughout the network is collected and analyzed. The data from these log messages gives the network administrators an overview of the networks operation, allows them to detect problems with the network and block security breaches. In this thesis several different centralized log management systems are analyzed and evaluated to see if they match the requirements for security, performance and cost which was established. These requirements are designed to meet the stakeholder’s requirements of log management and allow for scaling along with the growth of their network. To prove that the selected system meets the requirements, a small-scale implementation of the system will be created as a “proof of concept”. The conclusion reached was that the best solution for the centralized log management system was the ELK Stack system which is based upon the three open source software Elasticsearch, Logstash and Kibana. In the small-scale implementation of the ELK Stack system it was shown that it meets all the requirements placed on the system. The goal of this thesis is to help develop a greater understanding of some well-known centralized log management systems and why the usage of them is important for computer networks. This will be done by describing, comparing and evaluating some of the functionalities of the selected centralized log management systems. This thesis will also be able to provide people and entities with guidance and recommendations for the choice and implementation of a centralized log management system.I moderna datornätverk så produceras loggar på olika enheter i nätverket för att sedan samlas in och analyseras. Den data som finns i dessa loggar hjälper nätverksadministratörerna att få en överblick av hur nätverket fungerar, tillåter dem att upptäcka problem i nätverket samt blockera säkerhetshål. I detta projekt så analyseras flertalet relevanta system för centraliserad loggning utifrån de krav för säkerhet, prestanda och kostnad som är uppsatta. Dessa krav är uppsatta för att möta intressentens krav på loghantering och även tillåta för skalning jämsides med tillväxten av deras nätverk. För att bevisa att det valda systemet även fyller de uppsatta kraven så upprättades även en småskalig implementation av det valda systemet som ett ”proof of concept”. Slutsatsen som drogs var att det bästa centraliserade loggningssystemet utifrån de krav som ställs var ELK Stack som är baserat på tre olika mjukvarusystem med öppen källkod som heter Elasticsearch, Logstash och Kibana. I den småskaliga implementationen av detta system så påvisades även att det valda loggningssystemet uppnår samtliga krav som ställdes på systemet. Målet med detta projekt är att hjälpa till att utveckla kunskapen kring några välkända system för centraliserad loggning och varför användning av dessa är av stor betydelse för datornätverk. Detta kommer att göras genom att beskriva, jämföra och utvärdera de utvalda systemen för centraliserad loggning. Projektet kan även att hjälpa personer och organisationer med vägledning och rekommendationer inför val och implementation av ett centraliserat loggningssystem.
5
Post, David L. "Network Management: Assessing Internet Network-Element Fault Status Using Neural Networks." Ohio : Ohio University, 2008. http://www.ohiolink.edu/etd/view.cgi?ohiou1220632155.
Full text
6
De, Kock Johannes Marthinus. "Optimal management of MPLS networks." Thesis, Stellenbosch : Stellenbosch University, 2002. http://hdl.handle.net/10019.1/52977.
Full textAbstract:
Thesis (MSc)--Stellenbosch University, 2002.ENGLISH ABSTRACT: Multiprotocol Label Switching (MPLS) is a routing technology which can manage Quality of Service (QoS) in scalable connectionless networks using relatively simple packet forwarding mechanisms. This thesis considers the optimisation of the QoS offered by an MPLS network. The QoS measure used is the expected packet delay which is minimised by switching packets along optimal label switched paths (LSPs). Two mathematical models of MPLS networks are presented together with appropriate algorithms for optimally dividing the network traffic into forwarding equivalence classes (FECs), finding optimal LSPs which minimise the expected packet delay and switching these FECs along the optimal LSPs. These algorithms are applied to compute optimal LSPs for several test networks. The mathematics on which these algorithms are based is also reviewed. This thesis provides the MPLS network operator with efficient packet routing algorithms for optimising the network's QoS.
AFRIKAANSE OPSOMMING: Multiprotocol Label Switching (MPLS) is 'n roeteringsmetode om die diensvlak (QoS) van 'n skaleerbare, verbindinglose netwerk te bestuur deur middel van relatief eenvoudige versendingsmeganismes. Hierdie tesis beskou die optimering van die QoS van 'n MPLS-netwerk. Die QoS-maatstaf is die verwagte vert raging van 'n netwerk-pakkie. Dit word geminimeer deur pakkies langs optimale "label switched paths" (LSPs) te stuur. Twee wiskundige modelle van MPLS-netwerke word ondersoek. Toepaslike algoritmes word verskaf vir die optimale verdeling van die netwerkverkeer in "forwarding equivalence classes" (FECs), die soektog na optimale LSPs (wat die verwagte pakkie-vertraging minimeer) en die stuur van die FECs langs die optimale LSPs. Hierdie algoritmes word ingespan om optimale LSPs vir verskeie toetsnetwerke op te stel. Die wiskundige teorie waarop hierdie algoritmes gegrond is, word ook hersien. Hierdie tesis verskaf doeltreffende roeteringsalgoritmes waarmee 'n MPLS-netwerkbestuurderj-es die netwerk se QoS kan optimeer.
7
Ayvat, Birol. "An evaluation of best effort traffic management of server and agent based active network management (SAAM) architecture." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2003. http://library.nps.navy.mil/uhtbin/hyperion-image/03Mar%5FAyvat.pdf.
Full text
8
Sullivan, Mark P. "Secure remote network administration and power management." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2004. http://library.nps.navy.mil/uhtbin/hyperion/04Jun%5FSullivan.pdf.
Full text
9
Mohan, Raj. "XML based adaptive IPsec policy management in a trust management context /." Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2002. http://library.nps.navy.mil/uhtbin/hyperion-image/02sep%5FMohan.pdf.
Full textAbstract:
Thesis (M.S. in Computer Science and M.S. in Information Technology Management)--Naval Postgraduate School, September 2002.Thesis advisor(s): Cynthia E. Irvine, Timothy E. Levin. Includes bibliographical references (p. 71-72). Also available online.
10
Lim, Kok Seng. "Analysis of network management protocols in optical networks." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2004. http://library.nps.navy.mil/uhtbin/hyperion/04Mar%5FLim%5FK.pdf.
Full text
11
Asim, Muhammad. "Self-organization and management of wireless sensor networks." Thesis, Liverpool John Moores University, 2010. http://researchonline.ljmu.ac.uk/5998/.
Full textAbstract:
Wireless sensor networks (WSNs) are a newly deployed networking technology consisting of multifunctional sensor nodes that are small in size and communicate over short distances. These sensor nodes are mainly in large numbers and are densely deployed either inside the phenomenon or very close to it. They can be used for various application areas (e.g. health, military, home). WSNs provide several advantages over traditional networks, such as large-scale deployment, highresolution sensed data, and application adaptive mechanisms. However, due to their unique characteristics (having dynamic topology, ad-hoc and unattended deployment, huge amount of data generation and traffic flow, limited bandwidth and energy), WSNs pose considerable challenges for network management and make application development nontrivial. Management of wireless sensor networks is extremely important in order to keep the whole network and application work properly and continuously. Despite the importance of sensor network management, there is no generalize solution available for managing and controlling these resource constrained WSNs. In network management of WSNs, energy-efficient network selforganization is one of the main challenging issues. Self-organization is the property which the sensor nodes must have to organize themselves to form the network. Selforganization of WSNs is challenging because of the tight constraints on the bandwidth and energy resources available in these networks. A self organized sensor network can be clustered or grouped into an easily manageable network. However, existing clustering schemes offer various limitations. For example, existing clustering schemes consume too much energy in cluster formation and re-formation. This thesis presents a novel cellular self-organizing hierarchical architecture for wireless sensor networks. The cellular architecture extends the network life time by efficiently utilizing nodes energy and support the scalability of the system. We have analyzed the performance of the architecture analytically and by simulations. The results obtained from simulation have shown that our cellular architecture is more energy efficient and achieves better energy consumption distribution. The cellular architecture is then mapped into a management framework to support the network management system for resource constraints WSNs. The management framework is self-managing and robust to changes in the network. It is application-co-operative and optimizes itself to support the unique requirements of each application. The management framework consists of three core functional areas i.e., configuration management, fault management, and mobility management. For configuration management, we have developed a re-configuration algorithm to support sensor networks to energy-efficiently re-form the network topology due to network dynamics i.e. node dying, node power on and off, new node joining the network and cells merging. In the area of fault management we have developed a new fault management mechanism to detect failing nodes and recover the connectivity in WSNs. For mobility management, we have developed a two phase sensor relocation solution: redundant mobile sensors are first identified and then relocated to the target location to deal with coverage holes. All the three functional areas have been evaluated and compared against existing solutions. Evaluation results show a significant improvement in terms of re-configuration, failure detection and recovery, and sensors relocation.
12
Wahabi, Abdoul Rassaki. "Resource management in IP networks." Thesis, Stellenbosch : Stellenbosch University, 2001. http://hdl.handle.net/10019.1/52436.
Full textAbstract:
Thesis (MSc)--University of Stellenbosch, 2001.ENGLISH ABSTRACT: lP networks offer scalability and flexibility for rapid deployment of value added lP services. However, with the increased demand and explosive growth of the Internet, carriers require a network infrastructure that is dependable, predictable, and offers consistent network performance. This thesis examines the functionality, performance and implementation aspects of the MPLS mechanisms to minimize the expected packet delay in MPLS networks. Optimal path selection and the assignment of bandwidth to those paths for minimizing the average packet delay are investigated. We present an efficient flow deviation algorithm (EFDA) which assigns a small amount of flow from a set of routes connecting each OD pair to the shortest path connecting the OD pair in the network. The flow is assigned in such a way that the network average packet delay is minimized. Bellman's algorithm is used to find the shortest routes between all OD pairs. The thesis studies the problem of determining the routes between an OD pair and assigning capacities to those routes. The EFDA algorithm iteratively determines the global minimum of the objective function. We also use the optimal flows to compute the optimal link capacities in both single and multirate networks. The algorithm has been applied to several examples and to different models of networks. The results are used to evaluate the performance of the EFDA algorithm and compare the optimal solutions obtained with different starting topologies and different techniques. They all fall within a close cost-performance range. They are all within the same range from the optimal solution as well.
AFRIKAANSE OPSOMMING: lP-netwerke voorsien die skaleerbaarheid en buigsaamheid vir die vinnige ontplooing van toegevoegde-waarde lP-dienste. Die vergrote aanvraag en eksplosiewe uitbreiding van die Internet benodig betroubare, voorspelbare en bestendige netwerkprestasie. Hierdie tesis ondersoek die funksionaliteit, prestasie en implementering van die MPLS(multiprotokoletiketskakel)- meganismes om die verwagte pakketvertraging te minimeer. Ons bespreek 'n doeltreffende algoritme vir vloei-afwyking (EFDA) wat 'n klein hoeveelheid vloei toewys uit die versameling van roetes wat elke OT(oorsprong-teiken)- paar verbind aan die kortste pad wat die OT-paar koppel. Die vloei word toegewys sodanig dat die netwerk se gemiddelde pakketvertraging geminimeer word. Bellman se algoritme word gebruik om die kortste roetes tussen alle OT-pare te bepaal. Die tesis bespreek die probleem van die bepaling van roetes tussen 'n OT-paar en die toewysing van kapasiteite aan sulke roetes. Die EFDA-algoritme bepaal die globale minimum iteratief. Ons gebruik ook optimale vloeie vir die berekening van die optimale skakelkapasiteite in beide enkel- en multikoers netwerke. Die algoritme is toegepas op verskeie voorbeelde en op verskillende netwerkmodelle. Die skakelkapasiteite word aangewend om die prestasie van die EFDAalgoritme te evalueer en dit te vergelyk met die optimale oplossings verkry met verskillende aanvangstopologieë en tegnieke. Die resultate val binne klein koste-prestasie perke wat ook na aan die optimale oplossing lê.
13
Yoon, Suyoung. "Power Management in Wireless Sensor Networks." NCSU, 2007. http://www.lib.ncsu.edu/theses/available/etd-01232007-222425/.
Full textAbstract:
One of the unique characteristics of wireless sensor networks (WSNs) is that sensor nodes have very constrained resources. Typical sensor nodes have lower computing power, communication bandwidth, and smaller memory than other wireless devices, and operate on limited capacity batteries. Hence power efficiency is very important in WSNs because power failure of some sensor nodes may lead to total network failure. In many cases the WSNs have to operate in harsh environments without human intervention for expended period time. Thus, much research on reducing or minimizing the power consumption, and thereby increasing the network lifetime, has been performed at each layer of the network layers. In this dissertation we approach three important issues related power management in WSNs: routing, time synchronization, and medium access control (MAC). We first discuss the effect of selecting routing protocols on the lifetime of the WSNs. The maximum and minimum bounds of the lifetime with respect to the routing protocols are derived. The routing protocols corresponding to the bounds are also presented. The simulation results show that the choice of the routing protocol has very little impact on the lifetime of the network and that simple routing protocols such as shortest path routing perform very close to the the maximum bound of the lifetime of the network. Next, we propose a simple and accurate time synchronization protocol that can be used a a fundamental component of other synchronization-based protocols in WSNs. Analytical bounds on the synchronization errors of proposed protocol are discussed. The implementation results on Mica2 and Telos motes show that proposed time synchronization protocol outperforms existing ones in terms of the precision and required resources. Finally, we model the power consumption of WSN MAC protocols. We derive analytically the power consumption of well known MAC protocols for WSNs, and analyze and compare their performance. We validate the models by measuring the power consumption on Mica 2 motes and comparing those measured power consumption with the analytical results.
14
Feeley, Michael Joseph. "Global memory management for workstation networks /." Thesis, Connect to this title online; UW restricted, 1996. http://hdl.handle.net/1773/6997.
Full text
15
Banerji, Pratip K. "An analysis of network management traffic and requirements in wireless networks." Thesis, Massachusetts Institute of Technology, 1997. http://hdl.handle.net/1721.1/42744.
Full text
16
Bapat, Sandip Shriram. "On reliable and scalable management of wireless sensor networks." Columbus, Ohio : Ohio State University, 2006. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=osu1164809365.
Full text
17
LU, WEN-PAI. "SECURITY OF COMMUNICATION IN COMPUTER NETWORKS (KEY MANAGEMENT, VERIFICATION)." Diss., The University of Arizona, 1986. http://hdl.handle.net/10150/183922.
Full textAbstract:
This dissertation concerns investigations on two of the most important problems in establishing communication security in computer networks: (1) developing a model which precisely describes the mechanism that enforces the security policy and requirements for a secure network, and (2) designing a key management scheme for establishing a secure session for end-to-end encryption between a pair of communicants. The security mechanism attempts to ensure secure flow of information between entities assigned to different security classes in different computer systems attached to a computer communication network. The mechanism also controls the accesses to the network devices by the subjects (users and processes executed on behalf of the users). The communication security problem is formulated by using a mathematical model which precisely describes the security requirements for the network. The model integrates the notions of access control and information flow control to provide a Trusted Network Base (TNB) for the network. The demonstration of security of the network when the security mechanism is designed following the present model is given by using mathematical induction techniques. The problem of designing key management schemes for establishing end-to-end encrypted sessions between source-destination pairs when the source and the destination are on different networks interconnected via Gateways and intermediate networks is examined. In such an internet environment, the key management problem attains a high degree of complexity due to the differences in the key distribution mechanisms used in the constituent networks and the infeasibility of effecting extensive hardware and software changes to the existing networks. A hierarchical approach for key management is presented which utilizes the existing network specific protocols at the lower levels and protocols between Authentication Servers and/or Control Centers of different networks at the higher levels. Details of this approach are discussed for specific illustrative scenarios to demonstrate the implementational simplicity. A formal verification of the security of the resulting system is also conducted by an axiomatic procedure utilizing certain combinatory logic principles. This approach is general and can be used for verifying the security of any existing key management scheme.
18
Li, Xiaoming Biaz Saad. "Performance evaluation of biased queue management." Auburn, Ala., 2006. http://repo.lib.auburn.edu/2006%20Summer/Theses/LI_XIAOMING_37.pdf.
Full text
19
Irwin, Barry Vivian William. "Bandwidth management and monitoring for IP network traffic : an investigation." Thesis, Rhodes University, 2001. http://hdl.handle.net/10962/d1006492.
Full textAbstract:
Bandwidth management is a topic which is often discussed, but on which relatively little work has been done with regard to compiling a comprehensive set of techniques and methods for managing traffic on a network. What work has been done has concentrated on higher end networks, rather than the low bandwidth links which are commonly available in South Africa and other areas outside the United States. With more organisations increasingly making use of the Internet on a daily basis, the demand for bandwidth is outstripping the ability of providers to upgrade their infrastructure. This resource is therefore in need of management. In addition, for Internet access to become economically viable for widespread use by schools, NGOs and other academic institutions, the associated costs need to be controlled. Bandwidth management not only impacts on direct cost control, but encompasses the process of engineering a network and network resources in order to ensure the provision of as optimal a service as possible. Included in this is the provision of user education. Software has been developed for the implementation of traffic quotas, dynamic firewalling and visualisation. The research investigates various methods for monitoring and management of IP traffic with particular applicability to low bandwidth links. Several forms of visualisation for the analysis of historical and near-realtime traffic data are also discussed, including the use of three-dimensional landscapes. A number of bandwidth management practices are proposed, and the advantages of their combination, and complementary use are highlighted. By implementing these suggested policies, a holistic approach can be taken to the issue of bandwidth management on Internet links.
20
Duff, Kevin Craig. "Network-layer reservation TDM for ad-hoc 802.11 networks." Thesis, Rhodes University, 2008. http://eprints.ru.ac.za/1146/.
Full text
21
Martin, Todd. "Network configuration and change management software selection for Company XYZ." Menomonie, WI : University of Wisconsin--Stout, 2006. http://www.uwstout.edu/lib/thesis/2006/2006martint.pdf.
Full text
22
Dobrydney, John F. "IPv6 tactical network management." Thesis, Monterey, California : Naval Postgraduate School, 2009. http://edocs.nps.edu/npspubs/scholarly/theses/2009/Sep/09Sep_Dobrydney.pdf.
Full textAbstract:
Thesis (M.S. in Information Technology Management)--Naval Postgraduate School, September 2009.Thesis Advisor(s): Bordetsky, Alex. "September 2009." Description based on title screen as viewed on November 9, 2009. Author(s) subject terms: IP, tactical sensor network, TNT, Internet Protocol Version 6, network management, quality of service, DiffServ, information management. Includes bibliographical references (p. 197-202). Also available in print.
23
Modiri, Nasser. "Monitoring and management of OSI networks." Thesis, University of Sussex, 1989. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.292776.
Full text
24
Becker, Jennifer A. "Impression management in computer-mediated communication : an exploratory qualitative analysis." Virtual Press, 1999. http://liblink.bsu.edu/uhtbin/catkey/1136716.
Full textAbstract:
This study investigates the phenomenon of impression management in computer-mediated communication (CMC), particularly chat rooms. Past research has overlooked the occurrence of this phenomenon; however, connections can be drawn from the body of research on impression management in face-to-face communication as well as the body of research on CMC. Indeed, impression management is an integral part of chat room interaction.A screening survey was administered to 382 college students to identify those students who interacted in chat rooms regularly and admitted to engaging in impression management and misrepresenting their identities. Ten such students were interviewed. Their accounts were recorded, transcribed, and analyzed using the grounded theory methodology. The analysis revealed that a set of antecedent conditions influence the phenomenon of impression management, which is managed by two action/interactional strategies and results in an outcome.Department of Speech Communication
25
Kadri, Mohandas Brijesh. "Congestion management in vehicular ad-hoc networks." Thesis, University of Ottawa (Canada), 2009. http://hdl.handle.net/10393/28264.
Full textAbstract:
We study the performance of the adaptive PI (Proportional Integral) rate controller [HoYa07] to deal with the problem of vehicle traffic congestion and data traffic congestion in vehicular ad-hoc networks. Derived from classical control theory, the adaptive PI rate controller performs active queue management by controlling the source rate based on the instantaneous queue length of the congested node. Using simulations we have demonstrated the capability of the adaptive PI rate controller to deal with vehicle traffic and data traffic congestion in vehicular ad-hoc networks. For data traffic congestion management, we have evaluated the performance of the algorithm in both static and mobile network scenarios. The controller dominated the combined performance of TCP NEWRENO and RED (Random Early Detection) queue with a positive influence on source throughput. For vehicle traffic management we have studied the congestion condition that arises when vehicle traffic volume exceeds the capacity of the road. The adaptive PI rate algorithm controlled the traffic volume in the road segment of interest to a preconfigured target threshold additionally improving the vehicle speed. Various other performance measures have been evaluated.
26
Kim, Min Y. "Configuration and management of wireless sensor networks." Thesis, Monterey, California. Naval Postgraduate School, 2005. http://hdl.handle.net/10945/1763.
Full textAbstract:
Wireless sensor networks (WSNs) are expected to play an essential role in the upcoming age of pervasive computing. As a new research area, there are several open problems that need to be investigated. One such problem is configuration and management of WSNs. To deploy sensors efficiently in a wide area, we need to consider coverage, purpose and geographic situation. By considering these elements, we can make general deployment strategies. Another issue is management of various sensors in wide area. To handle these issues, we need approaches from different view, management levels, WSN functionalities, and management functional areas. In this thesis, I describe some of the key configuration and management problems in WSNs. Then, I present a newly developed application to address these problems.
27
Zhao, Wenrui. "Routing and Network Design in Delay Tolerant Networks." Diss., Georgia Institute of Technology, 2006. http://hdl.handle.net/1853/14085.
Full textAbstract:
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.
28
Saple, Avdhoot Kishore Yilmaz Levent. "Agent-based simulation of behavioral anticipation in computer networks a comparative study of anticipatory fault management /." Auburn, Ala., 2006. http://repo.lib.auburn.edu/2006%20Spring/master's/SAPLE_AVDHOOTKISHORE_37.pdf.
Full text
29
Alfoudi, A. S. D. "Slicing-based resource allocation and mobility management for emerging wireless networks." Thesis, Liverpool John Moores University, 2018. http://researchonline.ljmu.ac.uk/9587/.
Full textAbstract:
The proliferation of smart mobile devices and user applications has continued to contribute to the tremendous volume of data traffic in cellular networks. Moreover, with the feature of heterogeneous connectivity interfaces of these smart devices, it becomes more complex for managing the traffic volume in the context of mobility. To surmount this challenge, service and resource providers are looking for alternative mechanisms that can successfully facilitate managing network resources and mobility in a more dynamic, predictive and distributed manner. New concepts of network architectures such as Software-Defined Network (SDN) and Network Function Virtualization (NFV) have paved the way to move from static to flexible networks. They make networks more flexible (i.e., network providers capable of on-demand provisioning), easily customizable and cost effective. In this regard, network slicing is emerging as a new technology built on the concepts of SDN and NFV. It splits a network infrastructure into isolated virtual networks and allows them to manage network resources based on their requirements and characteristics. Most of the existing solutions for network slicing are facing challenges in terms of resource and mobility management. Regarding resource management, it creates challenges in terms of provisioning network throughput, end-to-end delay, and fairness resources allocation for each slice, whereas, in the case of mobility management, due to the rapid change of user mobility the network slice operator would like to hold the mobility controlling over its clients across different access networks, rather than the network operator, to ensure better services and user experience. In this thesis, we propose two novel architectural solutions to solve the challenges identified above. The first proposed solution introduces a Network Slicing Resource Management (NSRM) mechanism that assigns the required resources for each slice, taking into consideration resource isolation between different slices. The second proposed v solution provides a Mobility Management architecture-based Network Slicing (MMNS) where each slice manages its users across heterogeneous radio access technologies such as WiFi, LTE and 5G networks. In MMNS architecture, each slice has different mobility demands (e.g,. latency, speed and interference) and these demands are governed by a network slice configuration and service characteristics. In addition, NSRM ensures isolating, customizing and fair sharing of distributed bandwidths between various network slices and users belonging to the same slice depending on different requirements of each one. Whereas, MMNS is a logical platform that unifies different Radio Access Technologies (RATs) and allows all slices to share them in order to satisfy different slice mobility demands. We considered two software simulations, namely OPNET Modeler and OMNET++, to validate the performance evaluation of the thesis contributions. The simulation results for both proposed architectures show that, in case of NSRM, the resource blocking is approximately 35% less compared to the legacy LTE network, which it allows to accommodate more users. The NSRM also successfully maintains the isolation for both the inter and intra network slices. Moreover, the results show that the NSRM is able to run different scheduling mechanisms where each network slice guarantee perform its own scheduling mechanism and simultaneously with other slices. Regarding the MMNS, the results show the advantages of the proposed architecture that are the reduction of the tunnelling overhead and the minimization of the handover latency. The MMNS results show the packets delivery cost is optimal by reducing the number of hops that the packets transit between a source node and destination. Additionally, seamless session continues of a user IP-flow between different access networks interfaces has been successfully achieved.
30
White, Kyle John Sinclair. "Increasing service visibility for future, softwarised air traffic management data networks." Thesis, University of Glasgow, 2017. http://theses.gla.ac.uk/8536/.
Full textAbstract:
Air Traffic Management (ATM) is at an exciting frontier. The volume of air traffic is reaching the safe limits of current infrastructure. Yet, demand for more air traffic continues. To meet capacity demands, ATM data networks are increasing in complexity with: greater infrastructure integration, higher availability and precision of services; and the introduction of unmanned systems. Official recommendations into previous disruptive outages have high-lighted the need for operators to have richer monitoring capabilities and operational systems visibility, on-demand, in response to challenges. The work presented in this thesis, helps ATM operators better understand and increase visibility into the behaviour of their services and infrastructure, with the primary aim to inform decision-making to reduce service disruption. This is achieved by combining a container-based NFV framework with Software- Defined Networking (SDN). The application of SDN+NFV in this work allows lightweight, chain-able monitoring and anomaly detection functions to be deployed on-demand, and the appropriate (sub)set of network traffic routed through these virtual network functions to provide timely, context-specific information. This container-based function deployment architecture, allows for punctual in-network processing through the instantiation of custom functionality, at appropriate locations. When accidents do occur, such as the crash of a UAV, the lessons learnt should be integrated into future systems. For one such incident, the accident investigation identified a telemetry precursor an hour prior. The function deployment architecture allows operators to extend and adapt their network infrastructure, to incorporate the latest monitoring recommendations. Furthermore, this work has examined relationships in application-level information and network layer data representing individual examples of a wide range of generalisable cases including: between the cyber and physical components of surveillance data, the rate of change in telemetry to determine abnormal aircraft surface movements, and the emerging behaviour of network flooding. Each of these examples provide valuable context-specific benefits to operators and a generalised basis from which further tools can be developed to enhance their understanding of their networks.
31
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.
Full textAbstract:
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.
32
Kulkarni, Shrinivas Bhalachandra. "The simulation studies on a behaviour based trust routing protocol for ad hoc networks." Diss., Online access via UMI:, 2006.
Find full text
33
Gao, Zhuomin. "Conflict handling in policy-based security management." [Gainesville, Fla.] : University of Florida, 2002. http://purl.fcla.edu/fcla/etd/UFE1000124.
Full textAbstract:
Thesis (M.S.)--University of Florida, 2002.Title from title page of source document. Document formatted into pages; contains v, 52 p.; also contains graphics. Includes vita. Includes bibliographical references.
34
Lee, Myung Sub 1953. "PC-based design of network management package for broadband network." Thesis, The University of Arizona, 1988. http://hdl.handle.net/10150/276772.
Full textAbstract:
The description of a Network Management Package (NMP) for Packet Communications Units (PCUs) in a Local Area Network (LAN) is presented. The LAN consists of a Sytek LocalNet 20, a Sytek System 2000, a Sytek System 6000, and a Concord Data Systems Token/Net. The NMP accesses and controls the local and remote PCUs on the networks. The communication interface software module is responsible for opening and closing the session between the PC and PCU ports. The NMP supports a set of operations used by a network manager to control and manage the network PCUs. The user uses the NMP to integrate each PCU and check and set its attributes. The NMP was developed to run in the Computer Engineering Research Laboratory and in the University of Arizona broadband cable plant. The NMP allows different PCUs (local or remote) to check and modify PCU's attributes while users work on their own PCUs. (Abstract shortened with permission of author.)
35
Draai, Kevin. "A model for assessing and reporting network performance measurement in SANReN." Thesis, Nelson Mandela Metropolitan University, 2017. http://hdl.handle.net/10948/16131.
Full textAbstract:
The performance measurement of a service provider network is an important activity. It is required for the smooth operation of the network as well as for reporting and planning. SANReN is a service provider tasked with serving the research and education network of South Africa. It currently has no structure or process for determining network performance metrics to measure the performance of its network. The objective of this study is to determine, through a process or structure, which metrics are best suited to the SANReN environment. This study is conducted in 3 phases in order to discover and verify the solution to this problem. The phases are "Contextualisation", "Design",and "Verification". The "Contextualisation" phase includes the literature review. This provides the context for the problem area but also serves as a search function for the solution. This study adopts the design science research paradigm which requires the creation of an artefact. The "Design" phase involves the creation of the conceptual network performance measurement model. This is the artefact and a generalised model for determining the network performance metrics for an NREN. To prove the utility of the model it is implemented in the SANReN environment. This is done in the "Verification" phase. The network performance measurement model proposes a process to determine network performance metrics. This process includes getting NREN requirements and goals, defining the NRENs network design goals through these requirements, define network performance metrics from these goals, evaluating the NRENs monitoring capability, and measuring what is possible. This model provides a starting point for NRENs to determine network performance metrics tailored to its environment. This is done in the SANReN environment as a proof of concept. The utility of the model is shown through the implementation in the SANReN environment thus it can be said that it is generic.The tools that monitor the performance of the SANReN network are used to retrieve network performance data from. Through understanding the requirements, determining network design goals and performance metrics, and determining the gap the retrieving of results took place. These results are analysed and finally aggregated to provide information that feeds into SANReN reporting and planning processes. A template is provided to do the aggregation of metric results. This template provides the structure to enable metrics results aggregation but leaves the categories or labels for the reporting and planning sections blank. These categories are specific to each NREN. At this point SANReN has the aggregated information to use for planning and reporting. The model is verified and thus the study’s main research objective is satisfied.
36
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.
Full text
37
Arabo, Abdullahi. "User-centred and context-aware identity management in mobile ad-hoc networks." Thesis, Liverpool John Moores University, 2011. http://researchonline.ljmu.ac.uk/6103/.
Full textAbstract:
The emergent notion of ubiquitous computing makes it possible for mobile devices to communicate and provide services via networks connected in an ad-hoc manner. These have resulted in the proliferation of wireless technologies such as Mobile Ad-hoc Networks (MANets), which offer attractive solutions for services that need flexible setup as well as dynamic and low cost wireless connectivity. However, the growing trend outlined above also raises serious concerns over Identity Management (IM) due to a dramatic increase in identity theft. The problem is even greater in service-oriented architectures, where partial identities are sprinkled across many services and users have no control over such identities. In this thesis, we review some issues of contextual computing, its implications and usage within pervasive environments. To tackle the above problems, it is essential to allow users to have control over their own identities in MANet environments. So far, the development of such identity control remains a significant challenge for the research community. The main focus of this thesis is on the area of identity management in MANets and emergency situations by using context-awareness and user-centricity together with its security issues and implications. Context- awareness allows us to make use of partial identities as a way of user identity protection and node identification. User-centricity is aimed at putting users in control of their partial identities, policies and rules for privacy protection. These principles help us to propose an innovative, easy-to-use identity management framework for MANets. The framework makes the flow of partial identities explicit; gives users control over such identities based on their respective situations and contexts, and creates a balance between convenience and privacy. The thesis presents our proposed framework, its development and lab results/evaluations, and outlines possible future work to improve the framework.
38
Nkhumeleni, Thizwilondi Moses. "Correlation and comparative analysis of traffic across five network telescopes." Thesis, Rhodes University, 2014. http://hdl.handle.net/10962/d1011668.
Full textAbstract:
Monitoring unused IP address space by using network telescopes provides a favourable environment for researchers to study and detect malware, worms, denial of service and scanning activities. Research in the field of network telescopes has progressed over the past decade resulting in the development of an increased number of overlapping datasets. Rhodes University's network of telescope sensors has continued to grow with additional network telescopes being brought online. At the time of writing, Rhodes University has a distributed network of five relatively small /24 network telescopes. With five network telescope sensors, this research focuses on comparative and correlation analysis of traffic activity across the network of telescope sensors. To aid summarisation and visualisation techniques, time series' representing time-based traffic activity, are constructed. By employing an iterative experimental process of captured traffic, two natural categories of the five network telescopes are presented. Using the cross- and auto-correlation methods of time series analysis, moderate correlation of traffic activity was achieved between telescope sensors in each category. Weak to moderate correlation was calculated when comparing category A and category B network telescopes' datasets. Results were significantly improved by studying TCP traffic separately. Moderate to strong correlation coefficients in each category were calculated when using TCP traffic only. UDP traffic analysis showed weaker correlation between sensors, however the uniformity of ICMP traffic showed correlation of traffic activity across all sensors. The results confirmed the visual observation of traffic relativity in telescope sensors within the same category and quantitatively analysed the correlation of network telescopes' traffic activity.
39
Vega, Juan Carlos. "Computer network operations methodology." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2004. http://library.nps.navy.mil/uhtbin/hyperion/04Mar%5FVega.pdf.
Full text
40
Suryadevara, Usha. "Buffer management in tone allocated multiple access protocol." [Gainesville, Fla.] : University of Florida, 2001. http://purl.fcla.edu/fcla/etd/UFE0000357.
Full textAbstract:
Thesis (M.S.)--University of Florida, 2001.Title from title page of source document. Document formatted into pages; contains vi, 78 p.; also contains graphics. Includes vita. Includes bibliographical references.
41
Yao, Danfeng. "Privacy-aware authentication and authorization in trust management." View abstract/electronic edition; access limited to Brown University users, 2008. http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqdiss&rft_dat=xri:pqdiss:3318375.
Full text
42
Tran, Bao. "An investigation of network management methods." Thesis, Edith Cowan University, Research Online, Perth, Western Australia, 2007. https://ro.ecu.edu.au/theses/263.
Full textAbstract:
Networks are populations of interconnected devices. Disruptions to connectivity even for a short time, can potentially affect a large number of users. Network Management (NM) is concerned with minimising problems and down time. There are a number of NM tools and models with the primary objective of managing networks. However, experts agree that many of these tools lack functionality. Furthermore, the models used are out of date. A new model that may assist in managing the network and may also used to train network administrators is the State Model Diagram (SMD). SMDs extract and diagrammatically integrate the output from different Command Line Interfaces (a complex and commonly used hierarchical text based tool for NM) and hence succinctly describe protocol operation. In addition, SMDs may be use to describe different network devices such as firewalls, wireless access points, routers, switches, etc. SMDs also provide top down decomposition thereby enabling a large complex network to be partition into independent units of an emendable size. This new model may provide functionality not currently offered by current NM tools. Furthermore, using SMDs it is possible to obtain increasing levels of detail whilst still maintaining links and interfaces between different levels, thereby supporting student learning both at introductory and advanced level. SMDs were evaluated as a NM tool and as a tool to teach NM. The positive responses from the four extensive experiments among 75 participants have clearly demonstrated that SMD's were found to be as useful as the CLI for all aspects of NM, and, significantly, students learning based on SMDs have gained a richer conceptual understanding strongly aligned with that of an expert. However, further work is required.
43
Yan, Wei. "Synchronization, buffer management, and multicast routing in multimedia networks." Diss., Georgia Institute of Technology, 1997. http://hdl.handle.net/1853/13426.
Full text
44
Mao, Zhoujia. "Approximation Algorithms Design for Resource Management in Communication Networks." The Ohio State University, 2013. http://rave.ohiolink.edu/etdc/view?acc_num=osu1373966693.
Full text
45
Pirmoradian, Mahdi. "Radio resource management for cognitive radio networks." Thesis, Kingston University, 2012. http://eprints.kingston.ac.uk/23723/.
Full textAbstract:
Cognitive radio concept is a promising technology to cope with the spectrum scarcity issue in the emerging wireless technology. Practical cognitive radio as an intelligent radio is on the horizon, in which the system is able to observe radio environment, understanding its situation, and adapt its transceiver parameters without disruption to the licensed service. The main given functionality of the cognitive radio is dynamic spectrum management using underlay or overlay spectrum-sharing mechanisms. This thesis studies several objectives in cognitive radio networks namely; cumulative interference in multi-user overlay networks, effective capacity optimisation in time varying imperfect fading channels, and diverse spectrum decision schemes (i.e. Maximum Entropy Channel Access, MECA, and Adaptive Spectrum Opportunity Access, ASOA, schemes) in overlay networks. Also Green Cognitive Radio concept is introduced for enhancing energy efficiency in overlay networks. The cumulative interference at a cell-edge active primary receiver is estimated based on the two scenarios, the broadcast of receiver beacon signal and the broadcast of licensed transmitter beacon signal. In the proposed system topology, the cognitive users are distributed within and outside of the licensed coverage area with constant density. The results indicate that cumulative interference significantly gets low level through the broadcast of receiver beacon signal scenario in comparison with the licensed transmitter scenario. Additionally, optimising effective capacity of a secondary user subject to the interference constraint and transmission power constraint factors, in imperfect fading channels is studied. In this case, cross channel state information is a key factor in adapting transmission power and channel capacity accordingly. The numerical results show that effective capacity is influenced upon increasing cross channel error (secondary transmitter-primary receiver link), and QoS delay items. Moreover, the study is completed by proposing power control policy upon minimising interference level at the licensed receiver subject to the desired effective capacity level and transmission power constraint. Hence, performance of the proposed spectrum decision schemes (MECA, ASOA) is examined and explained by comparison with Random Channel Access (RCA), Minimum Channel Rate (MCR), and First Opportunity Channel Access (FOCA) schemes in the period of simulation time. MECA scheme uses weighted entropy function to assess usefulness of the remaining available idle channels, and so selects appropriate spectrum opportunity for secondary data delivery. The performance reveals that MECA and ASOA can potentially be considered as viable approaches in spectrum selection schemes. Additionally, in the case of GCR aspect an opportunistic power control policy using the remaining idle channel lifetime is proposed to mitigate interference power at the primary receiver. Overall, we develop and propose a unique technique in decreasing total interference in overlay networks; effective capacity optimisation in underlay networks, feasible spectrum selection schemes, and also green cognitive radio concept in the field of dynamic spectrum access networks.
46
Ghaffari, Mohsen. "Bounds on contention management in radio networks." Thesis, Massachusetts Institute of Technology, 2013. http://hdl.handle.net/1721.1/79227.
Full textAbstract:
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2013.Cataloged from PDF version of thesis.
Includes bibliographical references (p. 79-82).
In this thesis, we study the local broadcast problem in two well-studied wireless network models. The local broadcast problem is a theoretical approach for capturing the contention management issue in wireless networks; it assumes that processes are provided messages, one by one, that must be delivered to their neighbors. We study this problem in two theoretical models of wireless networks, the classical radio network model and its more recent generalization, the dual graph model which includes the possibility of unreliable time-changing links. Both these models are synchronous; the execution proceeds in lock-step rounds and in each round, each node either transmits a message or listens. In each round of the dual graph model, each unreliable link might be active or inactive, whereas in the classical model, all the links are always active. In each round, each node receives a message if and only if it is listening and exactly one of its neighbors, with respect to the the active links of that round, transmits. The time complexity of the local broadcast algorithms is measured by two bounds, the acknowledgment bound and the progress bound. Roughly speaking, the former bounds the time it takes each broadcasting node to deliver its message to all its neighbors and the latter bounds the time it takes a node to receive at least one message, assuming it has a broadcasting neighbor. Typically these bounds depend on the maximum contention and the network size. The standard local broadcast strategy is the Decay protocol introduced by Bar-Yehuda et al. [19] in 1987. During the 25-years period in which this strategy has been used, it has remained an open question whether it is optimal. In this paper, we resolve this long-standing question. We present lower bounds on progress and acknowledgment bounds in both the classical and the dual graph model and we show that, with a slight optimization, the Decay protocol matches these lower bounds in both models. However, the tight progress bound of the dual graph model is exponentially larger than the progress bound in the classical model, in its dependence on the maximum contention. This establishes a separation between the two models, proving that progress in the dual graph model is strictly and exponentially harder than its classical predecessor. Combined, our results provide an essentially complete characterization of the local broadcast problem in these two important models.
by Mohsen Ghaffari.
S.M.
47
Chitedze, Zimani. "Mobility management for Wi-Fi infrastructure and mesh networks." University of the Western Cape, 2012. http://hdl.handle.net/11394/2960.
Full textAbstract:
Magister Scientiae - MScThis 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
48
Liu, Xiaoshan. "Mobility and radio resource management in heterogeneous wireless networks." Click to view the E-thesis via HKUTO, 2006. http://sunzi.lib.hku.hk/hkuto/record/B38233873.
Full text
49
Al-Mousa, Yamin Samir. "MAC/routing design for under water sensor networks /." Online version of thesis, 2007. http://hdl.handle.net/1850/4496.
Full text
50
Gupta, Nishant. "Resource Management in Ad Hoc Networks." University of Cincinnati / OhioLINK, 2001. http://rave.ohiolink.edu/etdc/view?acc_num=ucin992877546.
Full text