Network management and control of large broadband local area networks, where the number of nodes ranges from several hundred to a few thousand, is a very important concern for today's network manager. This primarily involves tuning the network to ensure load balance over the broadband subchannels, and the capability to monitor specific nodes for accounting, performance and security purposes. This thesis presents the design considerations for a session level passive hardware monitor on a broadband local area network having a bus/tree topology. A methodology for session monitoring is presented based on the issues discussed. The session service provided is packet switched with point to point virtual circuit connection. Current technology and economics dictate the use of broadband transmission media for large local area networks spread out over a radius of around ten kilometers. This medium provides adequate throughput for a large number of devices by supporting frequency division multiplexing and a multiple access medium access control protocol. The design considerations include both hardware and software aspects and are justified based on the characteristics of the transmission medium and communication protocol architecture used in this study. The local area network used for the development of this project is a sixteen hundred node campus network at Virginia Tech (™LocalNet 20) supplied by SYTEK, Inc. / M.S.

by Kit-man Chan. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1994. / Includes bibliographical references (leaves 82-86). / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Overview of Integrated Service Digital Networks --- p.1 / Chapter 1.2 --- Multirate Loss Networks --- p.5 / Chapter 1.3 --- Previous Work --- p.7 / Chapter 1.4 --- Organization --- p.11 / Chapter 1.5 --- Publications --- p.12 / Chapter 2 --- Call Admission in Multirate Loss Networks --- p.13 / Chapter 2.1 --- Introduction --- p.13 / Chapter 2.2 --- Two Adaptive Routing Rules --- p.15 / Chapter 2.3 --- Call Admission Policies --- p.17 / Chapter 2.4 --- Analysis of Call Admission Policies --- p.25 / Chapter 2.4.1 --- "The CS, LO, GB and the EB Policies" --- p.25 / Chapter 2.4.2 --- The DP Policy --- p.29 / Chapter 2.5 --- Performance Comparisons --- p.32 / Chapter 2.6 --- Concluding Remarks --- p.35 / Chapter 3 --- Least Congestion Routing in Multirate Loss Networks --- p.41 / Chapter 3.1 --- Introduction --- p.41 / Chapter 3.2 --- The M2 and MTB Routings --- p.42 / Chapter 3.2.1 --- M2 Routing --- p.43 / Chapter 3.2.2 --- MTB Routing --- p.43 / Chapter 3.3 --- Bandwidth Sharing Policies and State Aggregation --- p.45 / Chapter 3.4 --- Analysis of M2 Routing --- p.47 / Chapter 3.5 --- Analysis of MTB Routing --- p.50 / Chapter 3.6 --- Numerical Results and Discussions --- p.53 / Chapter 3.7 --- Concluding Remarks --- p.56 / Chapter 4 --- The Least Congestion Routing in WDM Lightwave Networks --- p.60 / Chapter 4.1 --- Introduction --- p.60 / Chapter 4.2 --- Architecture and Some Design Issues --- p.62 / Chapter 4.3 --- The Routing Rule --- p.66 / Chapter 4.4 --- Analysis of the LC Routing Rule --- p.67 / Chapter 4.4.1 --- Fixed Point Model --- p.67 / Chapter 4.4.2 --- Without Direct-link Priority --- p.68 / Chapter 4.4.3 --- With Direct-link Priority --- p.72 / Chapter 4.5 --- Performance Comparisons --- p.73 / Chapter 4.6 --- Concluding Remarks --- p.75 / Chapter 5 --- Conclusions and Future Work --- p.79 / Chapter 5.1 --- Future Work --- p.80

Hua Cunqing. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2002. / Includes bibliographical references (leaves 53-56). / Abstracts in English and Chinese. / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Congestion Control in the IP Network --- p.1 / Chapter 1.2 --- Quality of Service in the IP network --- p.2 / Chapter 1.3 --- Structure of Thesis --- p.3 / Chapter 2 --- Background --- p.4 / Chapter 2.1 --- TCP and Congestion Control --- p.4 / Chapter 2.1.1 --- Slow Start --- p.4 / Chapter 2.1.2 --- Congestion Avoidance --- p.5 / Chapter 2.1.3 --- "Fast Retransmit, Fast Recovery and Timeout" --- p.5 / Chapter 2.2 --- Active Queue Management --- p.7 / Chapter 2.3 --- Integrated Services and Differentiated Services --- p.8 / Chapter 3 --- The Fairness of TCP Vegas in Networks with Multiple Congested Gate- ways --- p.10 / Chapter 3.1 --- Introduction --- p.10 / Chapter 3.2 --- TCP Vegas and related works --- p.11 / Chapter 3.3 --- Analysis --- p.13 / Chapter 3.4 --- Simulation Results --- p.15 / Chapter 3.4.1 --- Throughput for different number of active cross connections --- p.16 / Chapter 3.4.2 --- Throughput for different number of flows in each connection --- p.17 / Chapter 3.4.3 --- Multiple congestion vs Single congestion --- p.17 / Chapter 3.5 --- Summary --- p.19 / Chapter 4 --- The Joint Congestion Control for TCP/IP Networks --- p.21 / Chapter 4.1 --- Background --- p.21 / Chapter 4.2 --- The Joint Congestion Control --- p.23 / Chapter 4.2.1 --- Path Load Reduction Factor --- p.23 / Chapter 4.2.2 --- The Congestion Control Algorithm --- p.24 / Chapter 4.2.3 --- Probing Interval --- p.26 / Chapter 4.2.4 --- Parameter Setting --- p.26 / Chapter 4.2.5 --- Encoding of R --- p.27 / Chapter 4.3 --- Simulation Results --- p.28 / Chapter 4.3.1 --- Congestion Window Behavior --- p.28 / Chapter 4.3.2 --- Throughput Stability --- p.31 / Chapter 4.3.3 --- Packet Loss Ratio --- p.31 / Chapter 4.3.4 --- Fairness Index --- p.32 / Chapter 4.3.5 --- Fairness in Multiple-hop Network --- p.32 / Chapter 4.3.6 --- Parameter Sensitivity --- p.33 / Chapter 4.3.7 --- Interaction between JCC and Reno flows --- p.35 / Chapter 4.4 --- Summary --- p.35 / Chapter 5 --- S-WTP : Shifted Waiting Time Priority Scheduling for Delay Differ- entiated Services --- p.37 / Chapter 5.1 --- Introduction --- p.37 / Chapter 5.2 --- Scheduling Algorithms for Delay Differentiated Services --- p.38 / Chapter 5.3 --- Shifted Waiting Time Priority Scheduling --- p.41 / Chapter 5.3.1 --- Local Update --- p.42 / Chapter 5.3.2 --- Global Update --- p.42 / Chapter 5.3.3 --- Computational overhead --- p.42 / Chapter 5.4 --- Simulation Results --- p.43 / Chapter 5.4.1 --- Microscopic View of Individual Packet Delay of S-WTP and WTP --- p.43 / Chapter 5.4.2 --- Delay Ratios in Different Timescales --- p.44 / Chapter 5.4.3 --- Effects of aggregate traffic and class load distribution on delay ratio --- p.44 / Chapter 5.4.4 --- Delay Ratios with More Classes --- p.48 / Chapter 5.5 --- Summary --- p.48 / Chapter 6 --- Conclusions --- p.50 / Chapter 6.1 --- Congestion Control --- p.50 / Chapter 6.2 --- Quality of Service Provision --- p.51 / Chapter 6.3 --- Final Remarks --- p.51

In last few years there has been significant growth in the area of wireless communication. Quality of Service (QoS) has become an important consideration for supporting variety of applications that utilize the network resources. These applications include voice over IP, multimedia services, like, video streaming, video conferencing etc. IEEE 802.16/WiMAX is a new network which is designed with quality of service in mind. This thesis focuses on analysis of quality of service as implemented by the WiMAX networks. First, it presents the details of the quality of service architecture in WiMAX network. In the analysis, a WiMAX module developed based on popular network simulator ns-2, is used. Various real life scenarios like voice call, video streaming are setup in the simulation environment. Parameters that indicate quality of service, such as, throughput, packet loss, average jitter and average delay, are analyzed for different types of service flows as defined in WiMAX. Results indicate that better quality of service is achieved by using service flows designed for specific applications. / by Rohit Talwalkar. / Thesis (M.S.)--Florida Atlantic University, 2008. / Includes bibliography. / Electronic reproduction. Boca Raton, FL : 2008 Mode of access: World Wide Web.

Feng, Guosen. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2011. / Includes bibliographical references (p. 56-60). / Abstracts in English and Chinese. / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Background for Network Content Providers' Peering --- p.1 / Chapter 1.2 --- Literature Review --- p.5 / Chapter 2 --- A Static Baseline Model --- p.12 / Chapter 2.1 --- Content Qualities and Subscribing Fees --- p.12 / Chapter 2.2 --- Users' Utilities --- p.13 / Chapter 2.3 --- Providers' Coverages and Revenues --- p.14 / Chapter 2.4 --- Content Procurement Strategies --- p.16 / Chapter 2.5 --- The Peering and Bargaining of Providers --- p.16 / Chapter 2.5.1 --- Peering Agreement --- p.16 / Chapter 2.5.2 --- Change of Coverage --- p.17 / Chapter 2.5.3 --- Providers' Revenues --- p.18 / Chapter 2.5.4 --- Nash Bargaining Problem --- p.18 / Chapter 3 --- Impact of Dynamic Content --- p.23 / Chapter 3.1 --- Additional Investment for Dynamic Content --- p.24 / Chapter 3.1.1 --- Content Change --- p.24 / Chapter 3.1.2 --- Change of Coverage --- p.24 / Chapter 3.1.3 --- Providers' Revenue --- p.30 / Chapter 3.2 --- Finite Budget for Dynamic Content --- p.30 / Chapter 3.2.1 --- Content Change --- p.30 / Chapter 3.2.2 --- Change of Coverage --- p.30 / Chapter 3.2.3 --- Providers' Revenue --- p.35 / Chapter 4 --- Peeing in Dynamic Model --- p.36 / Chapter 4.1 --- Peering over T Time Slots --- p.37 / Chapter 4.1.1 --- "Content Change, Advertisement Sharing, and Payment ." --- p.37 / Chapter 4.1.2 --- Change of Coverage --- p.37 / Chapter 4.1.3 --- Providers' Revenue --- p.38 / Chapter 4.1.4 --- Nash Bargaining Problem --- p.38 / Chapter 4.2 --- Peering over One Time Slot --- p.45 / Chapter 4.2.1 --- "Content Change, Advertisement Sharing, and Payment ." --- p.45 / Chapter 4.2.2 --- Change of Coverage --- p.46 / Chapter 4.2.3 --- Providers' Revenue --- p.48 / Chapter 4.2.4 --- Nash Bargaining Problem --- p.49 / Chapter 5 --- Summary and Future Work --- p.53 / Bibliography --- p.56 / Chapter A --- Proof of Optimal Peering Strategy --- p.61 / Chapter A.1 --- Proof of Static Optimal Peering Strategy --- p.61 / Chapter A.2 --- Proof of Strategy for Peering over T Time Slot --- p.65 / Chapter A.3 --- Proof of Strategy for Peering over One Time Slot --- p.66

An analytical framework is developed for distributed management of large networks where each node makes locally its decisions. Two issues remain open. One is whether a distributed algorithm would result in a near-optimal management. The other is the complexity, i.e., whether a distributed algorithm would scale gracefully with a network size. We study these issues through modeling, approximation, and randomized distributed algorithms. For near-optimality issue, we first derive a global probabilistic model of network management variables which characterizes the complex spatial dependence of the variables. The spatial dependence results from externally imposed management constraints and internal properties of communication environments. We then apply probabilistic graphical models in machine learning to show when and whether the global model can be approximated by a local model. This study results in a sufficient condition for distributed management to be nearly optimal. We then show how to obtain a near-optimal configuration through decentralized adaptation of local configurations. We next derive a near-optimal distributed inference algorithm based on the derived local model. We characterize the trade-off between near-optimality and complexity of distributed and statistical management. We validate our formulation and theory through simulations.

M. Tech. Professional Practice in Information Technology. Tshwane University of Technology, 2008. / The application of Information and Communication Technology (ICT) in business environment (profit-making and non-profit-making organisations, and public administration) has given business the power to provide its services faster, smoother, and at extended time than ordinary day working hours especially in the banking industry where the service delivery is expected to be 24 hours a day for seven days a week. Many organisations in today’s’ networked economy, mostly banking organisations, rely on ICT infrastructure to operate. The key to success with technology is not the technology per se, but the ability to manage it well. In sustaining business operations, ICT infrastructure needs to be effectively managed, with the application of tested and proven best practices such as ICT management frameworks for the organisation to benefit from it. This research explores the usage of ICT management frameworks in managing ICT infrastructure in the South African banking industry, where there is a complexity of systems because of combination of different components, some built in-house, and others procured from third-party suppliers. This research study is exploratory, applying the qualitative research approach as research strategy. It applies structured interviews as a tool for collection of primary data from participants, and uses reviews of previous publications on ICT management frameworks for secondary data collection. After a review of collected data, it has been found that: - It is important to ensure effective management of ICT infrastructure by applying best-practices as it is needed in supporting the organisation to achieve its objectives; - Though the use of ICT management frameworks is different from one bank to another, all banking organisations refer to the practices of ICT frameworks to manage their infrastructures and related processes; - Though there is not much difference in the management of ICT infrastructure in banking industry and others industries that rely on ICT for management and service delivery, banking organisations pay more attention to security, continual service delivery, and fast service delivery. Looking at the complexity of ICT infrastructures in major commercial banks investigated, it has been recommended that banks should not only concentrate on the collection of best practices in different frameworks, but also direct their efforts in creating one single framework that addresses business vision, strategies and the managerial system with more concentration on ICT infrastructure for the support of its operations, information management and sharing.

No description available.

Thesis (M.C.S.) - Carleton University, 2006. / Includes bibliographical references (p. 93-97). Also available in electronic format on the Internet.

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.