Performance analysis of error recovery and congestion control in high-speed networks

In the past few years, Broadband Integrated Services Digital Network (B-ISDN) has received increasing attention as a communication architecture capable of supporting multimedia applications. Among the techniques proposed to implement B-ISDN, Asynchronous Transfer Mode (ATM) is considered to be the most promising transfer technique because of its efficiency and flexibility.In ATM networks, the performance bottleneck of the network, which was once the channel transmission speed, is shifted to the processing speed at the network switching nodes and the propagation delay of the channel. This shift is because the high-speed channel increases the ratio of processing time to packet transmission time and also the ratio of propagation delay to packet transmission time. The increased processing overhead makes it difficult to implement hop-by-hop schemes, which may impose prohibitably high processing at each switching node. The increased propagation delay overhead makes traffic control in ATM a challenge since a large number of packets can be in transit between two ATM switching nodes. Because of these fundamental changes, control schemes developed for traditional networks may not perform efficiently, and thus, new network architectures (congestion control schemes, error control schemes, etc.) are required in ATM networks.In this dissertation, we first present an extensive survey of various traffic control schemes and network protocols for ATM networks. In this survey, possible traffic control schemes are examined, and problems of those schemes and their possible solutions are presented. Next, we investigate two key research issues in ATM networks (and other types of high-speed networks): the effects of protocol-processing overhead and the efficiency of traffic control schemes.We first investigate the effects of protocol-processing overhead on the performance of error recovery schemes. Specifically, we investigate the performance trade-offs between link-by-link and edge-to-edge error recovery schemes. Our results show that for a network with high-speed/low-error-rate channels, an edge-to-edge scheme gives a smaller delay than a link-by-link scheme. We then investigate the effectiveness of a priority packet discarding scheme, a congestion control mechanism suitable for high-speed networks. We derive loss probabilities for each stream and investigate the impact of burstiness of traffic streams on the performance of individual streams

Supporting distributed computation over wide area gigabit networks

The advent of high bandwidth fibre optic links that may be used over very large distances has lead to much research and development in the field of wide area gigabit networking. One problem that needs to be addressed is how loosely coupled distributed systems may be built over these links, allowing many computers worldwide to take part in complex calculations in order to solve "Grand Challenge" problems. The research conducted as part of this PhD has looked at the practicality of implementing a communication mechanism proposed by Craig Partridge called Late-binding Remote Procedure Calls (LbRPC). LbRPC is intended to export both code and data over the network to remote machines for evaluation, as opposed to traditional RPC mechanisms that only send parameters to pre-existing remote procedures. The ability to send code as well as data means that LbRPC requests can overcome one of the biggest problems in Wide Area Distributed Computer Systems (WADCS): the fixed latency due to the speed of light. As machines get faster, the fixed multi-millisecond round trip delay equates to ever increasing numbers of CPU cycles. For a WADCS to be efficient, programs should minimise the number of network transits they incur. By allowing the application programmer to export arbitrary code to the remote machine, this may be achieved. This research has looked at the feasibility of supporting secure exportation of arbitrary code and data in heterogeneous, loosely coupled, distributed computing environments. It has investigated techniques for making placement decisions for the code in cases where there are a large number of widely dispersed remote servers that could be used. The latter has resulted in the development of a novel prototype LbRPC using multicast IP for implicit placement and a sequenced, multi-packet saturation multicast transport protocol. These prototypes show that it is possible to export code and data to multiple remote hosts, thereby removing the need to perform complex and error prone explicit process placement decisions

Reducing Internet Latency : A Survey of Techniques and their Merit

Bob Briscoe, Anna Brunstrom, Andreas Petlund, David Hayes, David Ros, Ing-Jyh Tsang, Stein Gjessing, Gorry Fairhurst, Carsten Griwodz, Michael WelzlPeer reviewedPreprin

Feasibility of wireless mesh for LTE-Advanced small cell access backhaul

Mobiilidatan määrä on muutaman viime vuoden aikana kasvanut voimakkaasti ja nykyiset ennustukset arvioivat eksponentiaalista kasvukäyrää tulevien vuosien aikana. Matkapuhelinjärjestelmät ovat kehittyneet nopeasti tämän trendin ohjaamana. Neljännen sukupolven matkapuhelinverkkostandardien myötä, uudet innovaatiot kuten heterogeeniset verkkoratkaisut tarjoavat ratkaisun nykyisiin skaalautuvuus- ja kapasiteettiongelmiin. Joitain ilmeisiä ongelmakohtiakin kuitenkin esiintyy kuten heterogeenisten verkkojen runkokytkennän toteuttaminen. Yksi lupaavimmista tavoista toteuttaa heterogeenisten verkkojen runkokytkentä on langaton ja itseorganisoituva mesh-verkko. Tämän opinnäytetyön tavoitteena on varmistaa ja testata Nokia Siemens Networksin kehittämän mesh-runkokytkentäverkkokonseptin toteutettavuutta ja toiminnallisuutta soveltuvan validointijärjestelmän avulla. Kaiken kaikkiaan validointijärjestelmä ja sen päälle toteutettu mesh-protokolla toimivat moitteettomasti koko kehitys- ja testausprosessin ajan. Konseptin eri ominaisuudet ja mekanismit todistettiin täysin toteutettaviksi ja toimiviksi. Muutamalla lisäominaisuudella ja konseptiparannuksella mesh-konsepti tarjoaa houkuttelevan ja innovatiivisen ratkaisun heterogeenisten verkkojen runkokytkentään tulevaisuudessa.Mobile traffic demands and volumes are increasing and will dramatically keep increasing in the future. Along with this, mobile networks have evolved to better match this growth. Fourth generation cellular network standard introduced a set of new innovations for mobile communications, including support for heterogeneous network deployments. Heterogeneous networking is the likely answer for future mobile data capacity shortage but also poses some challenges, the most evident being how to implement the backhauling. One of the most promising heterogeneous network backhaul solutions is a meshed radio system with self-organizing features. The main scope of this master's thesis is the verification of functionality and feasibility of a wireless mesh backhaul concept developed by Nokia Siemens Networks through a proof-of-concept system. All in all, the wireless mesh proof-of-concept system performed strongly throughout the development and testing process. The different functionalities were proven to work successfully together. With further development and enhancement, the system concept displays extreme potential for a state-of-the-art heterogeneous network backhaul technology