Woolard, C. C.
No description available.
Multi-level low energy adaptive clustering hierarchy (ML-LEACH) : a routing solution for periodic data sensing in large-area wireless sensor networkHuang, Bo January 2007 (has links)
Thesis (M.S.)--University of Hawaii at Manoa, 2007. / Includes bibliographical references (leaves 66-67). / viii, 67 leaves, bound ill. (some col.) 29 cm
Thesis (Ph. D.)--University of Washington, 2005. / Vita. Includes bibliographical references (leaves 141-147).
(has links) (PDF)
Thesis (Ph.D.)--Cornell University, 2002. / Adviser: Eva Tardos. Includes bibliographical references.
Yasin, M. M.
This dissertation is concerned with the management and performance issues of those register-insertion (R-I) ring type local area networks (LANs) which employ the message removal by destination node protocol. A typical example of such a network is the Distributed Loop Computer Network (DLCN). developed by Liu et al for fundamental research in the field of distributed computing. After considering the management issues of low cost R-J LANs. the research deals with performance analysis of the dynamically reconfigurable register-insertion (DRR) network. In the first part of this research. a set of management functions is identified which are desirable and can be provided economically by a low cost LAN. A unique feature of the DLCN is that messages are removed from the network by the destination node. that is. messages do not travel whole of the loop. Therefore. it is not possible for a special control node to monitor the data traffic on the network without providing support functionality in each network access unit (NAU). The minimum functionality which must be provided in each NAU is identified in the thesis. A skeleton network was implemented to verify the feasibility of the proposed scheme. A paper describing the findings of this research was published and is reproduced as appendix A. In the second part of this research. a new feature of the DLCN network is introduced. namely. that the performance of a network employing removal by destination protocol can be improved by reconfiguring the network in a particular way. A methodology to find the optimal configuration is developed and is shown. by worked examples. to lead to improved performance. The findings of this research are particularly applicable to the dynamically reconfigurable register-insertion (DRR) network. A paper dealing with the optimisation of a hypothetical fully connected DRR network has been accepted for publication. Another paper. which considers the general case of less than fully connected DRR networks. is to be published. Both papers are reproduced as append ices Band C. Finally. a performance study of the ORR network is undertaken. As there seems to be no published attempt at formal analysis or simulation of a ORR network. a survey of literature dealing with performance study of the basic OLeN is performed. A simulation model of the DRR was then developed and implemented to verify the results arrived at in the previous section. Later. a queueing model of the DRR network. based on the work of Bux and Schlatter  is developed and analysed. Both simulation and analysis support the claim that the performance of a DRR network can be improved by adopting the configuration strategy developed in this thesis.
Halse, G A, Wells, George, Terzoli, A
Many standards aimed at managing networks currently exist, and yet networks remain notoriously difficult to maintain. Template-based management systems go a long way towards solving this problem. By developing an XML based language to describe network elements, as well as the topology of a network, we can create tools that are free from vendor specific idiosyncrasies, and are capable of managing both today’s networks and those of the future.
26 March 2008
Computer networks produce tremendous amounts of event-based data that can be collected and managed to support an increasing number of new classes of pervasive applications. Examples of such applications are network monitoring and crisis management. Although the problem of distributed event-based management has been addressed in the non-pervasive settings such as the Internet, the domain of pervasive networks has its own characteristics that make these results non-applicable. Many of these applications are based on time-series data that possess the form of time-ordered series of events. Such applications also embody the need to handle large volumes of unexpected events, often modified on-the-fly, containing conflicting information, and dealing with rapidly changing contexts while producing results with low-latency. Correlating events across contextual dimensions holds the key to expanding the capabilities and improving the performance of these applications. This dissertation addresses this critical challenge. It establishes an effective scheme for complex-event semantic correlation. The scheme examines epistemic uncertainty in computer networks by fusing event synchronization concepts with belief theory. Because of the distributed nature of the event detection, time-delays are considered. Events are no longer instantaneous, but duration is associated with them. Existing algorithms for synchronizing time are split into two classes, one of which is asserted to provide a faster means for converging time and hence better suited for pervasive network management. Besides the temporal dimension, the scheme considers imprecision and uncertainty when an event is detected. A belief value is therefore associated with the semantics and the detection of composite events. This belief value is generated by a consensus among participating entities in a computer network. The scheme taps into in-network processing capabilities of pervasive computer networks and can withstand missing or conflicting information gathered from multiple participating entities. Thus, this dissertation advances knowledge in the field of network management by facilitating the full utilization of characteristics offered by pervasive, distributed and wireless technologies in contemporary and future computer networks.
No description available.
30 January 2007
It¡¦s the age of network now. More and more people use the network and network management becomes important. The ISO sets the network management model: accounting management, configuration management, performance management, fault management and security management. Network topology plays an important role of them. Network topology can help network manager to manage network devices efficiently and to handle some problems. So, topology discovery is an important technology that can help us to find out the network topology. Although there are many network management tools having topology discovery function, they are commercial secret and usually need pay. Because of network topology is important of network management and commercial network management software isn¡¦t free, we want to study topology discovery to find the suitable algorithm of topology discovery which can find out network layer topology and data link layer topology. Then we will modify the algorithm to help us to implement the system of topology discovery. This system needs minor factors and less influence on network. It can discover topology efficiently.
Barua, Chowdhury Sucharit,
Thesis (M.S.)--University of Texas at Dallas, 2007. / Includes vita. Includes bibliographical references (leaves 62-63)
Page generated in 0.0978 seconds