Thesis (Ph. D.)--University of Washington, 1997. / Vita. Includes bibliographical references (leaves [115]-117).

Thesis (Ph.D.)--University of Delaware, 2010. / Principal faculty advisor: Gonzalo Arce, Dept. of Electrical & Computer Engineering. Includes bibliographical references.

Thesis (M.S.)--West Virginia University, 2007. / Title from document title page. Document formatted into pages; contains viii, 114 p. : ill. (some col.). Includes abstract. Includes bibliographical references (p. 84).

Broadband local area network cable plant design is a time consuming work, it takes lots of computation and it depends a lot on designer's experience. In this thesis the author presents an approach to cable plant design automation, the expert system was implemented in language SCHEME, symbol manipulation was used to generate the data structure (tree) which represent the design results. Signal level simulation can be performed based on the data structure.

Satellite broadband has the potential to provide Internet connectivity to people and places that are unreachable using other wired/wireless technologies. It is therefore a critical component of any service seeking to provide universal coverage. A universal service needs to support a range of Internet applications. While there is existing work on bulk and interactive applications with a characteristic transmission rate, popular Internet applications such as web browsing, web video download or variable-rate voice result in a network traffic that varies its transmission rate. This thesis first investigates the interaction of satellite resource request mechanisms with the quality of service offered to these variable-rate applications using a satellite platform based on DVB-RCS2. It shows that a flexible QoS architecture can be achieved by a combination of resource request methods and network-layer queuing. Variable-rate traffic also poses challenges to the widely deployed Transport Control Protocol (TCP). Previous work analysed the interaction with the congestion control algorithms and proposed Congestion Window Validation (CWV) to constrain the congestion window to the amount of traffic a transport has sent. TCP JAGO studied this problem for variable-rate bursty applications and proposed new algorithms; but these were shown to have drawbacks and there were no guidance on how to implement. This thesis therefore presents, newCWV, a practical mechanism to provide an appropriate estimate of the available path capacity and corresponding congestion control behaviour. This benefits variable-rate applications with shorter transfer durations, but has a consequence of allowing larger traffic bursts into the network that can increase packet loss. Burst mitigation techniques, such as TCP pacing, are proposed to deal with this. These techniques are implemented and tested in the Linux TCP/IP stack, where newCWV improves the burst transfer time. This benefit is particularly significant for the large delay of broadband satellite systems.

Despite policy rhetoric of the importance of digital access and associated Information Communication Technologies (ICTs) for businesses, many rural businesses remain underserved by their broadband service. Next Generation Broadband, sometimes referred to as Superfast Broadband, through commercial investment, predominantly reaches those in high population density areas. The BDUK NGB programme seeks to readdress this digital divide. This publicly funded technology project seeks to upgrade existing fixed telecommunication networks with NGB technology, thus improving rural digital connectivity for community and businesses alike. The value of small and micro businesses to the rural economy goes without saying, yet many remain underserved, or digitally excluded, from modern day business due to inadequate digital access. This doctoral thesis has followed the deployment of the NGB fixed telecommunication upgrades in the North East of Scotland, seeking to observe the changes in the technology as 'it happened' and the implications for Rural Small and Micro Business practices. The case study area included areas of accessible and remote rural classifications to establish how digital inclusion was developed. The research has specifically sought to observe businesses prior to the NGB deployment, track changes over the duration of this project, and ascertain the impact post deployment on business digital capabilities. The key findings established that the NGB deployment programme, due to a post code led approach, has significant gaps in meeting the digital needs of these rural businesses. It established that being geographically remote, does not always constitute being digitally remote, and as result of the tracking of broadband capabilities in the businesses, identified five new typologies and associated scenario outcomes which describes the current rural digital landscape and the ramifications of this on these rural businesses.

So Kin Tai. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2000. / Includes bibliographical references (leaves 65-66). / Abstracts in English and Chinese. / Chapter Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- The 0-1 sorter and concentrator --- p.1 / Chapter 1.2 --- Review of literature on constructions --- p.3 / Chapter 1.2.1 --- Odd-even merging network --- p.4 / Chapter 1.2.2 --- The Fast Knockout algorithm --- p.5 / Chapter 1.2.3 --- Reverse Banyan network prepended by running sum adder --- p.10 / Chapter 1.2.4 --- Recursive construction using iterative cells --- p.14 / Chapter 1.2.5 --- Comparison of construction algorithms --- p.17 / Chapter Chapter 2 --- Compressor based on baseline-swap network --- p.22 / Chapter 2.1 --- Bit permutation induced exchange --- p.22 / Chapter 2.2 --- Compressor --- p.26 / Chapter 2.3 --- The baseline-swap network --- p.28 / Chapter 2.4 --- New algorithm for running parity initialization --- p.31 / Chapter 2.5 --- Input fairness --- p.42 / Chapter Chapter 3 --- The general architecture of 0-1 sorter --- p.46 / Chapter 3.1 --- Recursive 2X-construction --- p.46 / Chapter 3.2 --- Control a 2X-interconnection network as a cyclic 0-1 sorter --- p.50 / Chapter 3.3 --- Recursive construction of larger 0-1 sorter --- p.56 / Chapter Chapter 4 --- Epilogue --- p.59 / Chapter 4.1 --- Directions of further studies --- p.59 / Chapter 4.1.1 --- Synchronization within the same stage --- p.59 / Chapter 4.1.2 --- Layout complexity --- p.60 / Chapter 4.1.3 --- Statistical initialization of running parity --- p.62 / Chapter 4.2 --- Conclusion --- p.63 / REFERENCES --- p.65

Ngai Li. / Thesis (Ph.D.)--Chinese University of Hong Kong, 2001. / Includes bibliographical references (p. 75-[78]). / Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Mode of access: World Wide Web. / Abstracts in English and Chinese.

A structured organisation of tasks, possibly hierarchical, is necessary in a BISDN network due to the complexity of the system, its large dimension and its physical distribution in space. Feedback (possibly supplemented by feedforward) control has an essential role in the effective and efficient control of BISDN. Additionally, due to the nonstationarity of the network and its complexity, a number of different (dynamic) modelling techniques are required at each level of the hierarchy. Also, to increase the efficiency of the network and allow flexibility in the control actions (by extending the control horizon) the (dynamic) tradeoff between service-rate, buffer-space, cell-delay and cell-loss must be exploited. In this thesis we take account of the above and solve three essential control problems, required for the effective control of BISDN. These solutions are suitable for both stationary and nonstationary conditions. Also, they are suitable for implementation in a decentralised coordinated form, that can form a part of a hierarchical organisation of control tasks. Thus, the control schemes aim for global solutions, yet they are not limited by the propagation delay, which can be high in comparison to the dynamics of the controlled events. Specifically, novel control approaches to the problems of Connection Admission Control (CAC), flow control and service-rate control are developed. We make use of adaptive feedback and adaptive feedforward control methodologies to solve the combined CAC and flow control problem. Using a novel control concept, based on only two groups of traffic (the controllable and uncontrollable group) we formulate a problem aimed at high (unity) utilisation of resources while maintaining quality of service at prescribed levels. Using certain assumptions we have proven that in the long term the regulator is stable and that it converges to zero regulation error. Bounds on operating conditions are also derived, and using simulation we show that high utilisation can be achieved as suggested by the theory, together with robustness for unforeseen traffic connections and disconnections. Even with such a high efficiency and strong properties on the quality of service provided, the only traffic descriptor required from the user is that of the peak rate of the uncontrollable traffic. A novel scheme for the dynamic control of service-rate is formulated, using feedback from the network queues. We use a unified dynamic fluid flow equation to describe the virtual path (VP) and hence formulate two illustrative examples for the control of service-rate (at the VP level). One is a nonlinear optimal multilevel implementation, that features a coordinated decentralised solution. The other is a single level implementation that turns out to be computationally complex. Therefore, for the single level implementation the costate equilibrium solution is also derived. For the optimal policies derived, we discuss their implementation complexity and provide implementable solutions. Their performance is evaluated using simulation. Additionally, using an ad hoc approach we have extended previous published works on the decentralised coordinated control of large scale nonlinear systems to also deal with time-delayed systems.

ATM is based on the efforts of the ITU-T Broadband Integrated Services Digital Network (B-ISDN) standard. It was originally conceived as a high-speed transfer technology for voice, video, and data over public networks. The ATM Forum has broadened the ITU-T�s vision of ATM for extended use over public and private networks, multi-protocol support and mobile ATM. There are also some ATM applications in High Performance Computing (HPC). ATM is a packet switching technique based on a virtual circuit mechanism. Data flows are statistically multiplexed and communication resources are dynamically shared. Therefore the high performance ATM switch is essential for quality of services (QoS). This thesis introduces typical ATM switch architecture design and analyses design problems. The research objective is to propose a switch architecture design that can solve or improve those existing problems to achieve a superior performance. The research goal is an integrated ATM switch architecture that will handle both unicast and multicast packets. Unlike the usual design for the multicast ATM switch which concentrates on a cell copy network with a unicast switching network, the proposed switch architecture processes the network packets in a single switching block, and allows unicast and multicast packets to co-exist without competing. The switch design has a simple topology and operation principle and is easy to implement. Furthermore, no copy network is required. Three major components are proposed to form the core of the new switch architecture: the parallel buffering strategy for improved buffer performance, the fast table lookup algorithm for packet duplication and routing, and the relay ring controller for solving the contention problem associated with multiple packets destined for the same output port. A mathematical model is presented and its numerical results are analysed. In addition, the simulation algorithms for the proposed switching design are presented and compared against the switching design with input and output buffering strategies. The simulation results are also compared and analysed against the numerical results. A multicast traffic model is also presented. Its performance calculation for the proposed switch is achieved through simulation. Performance analysis is compared against the output buffering switch under the same multicast traffic model. The performance analysis shows that the proposed switch architecture achieves high throughput with low cell loss rate and low time delay. Its performance can be as good as the output buffering strategy or better. Therefore the proposed switch design has solved the problems associated with input and output buffering. This thesis also analyses the complexity of the proposed switch architecture and suggests a topology to build a large scale ATM switch. The suitability and feasibility for production implementation are also addressed.