The token ring has several advantages over other networks, especially under a heavy load. However, Bux and Grillo showed that all desirable characteristics of IEEE 802.2 and 802.5 protocols for a single token ring are severely degraded in an interconnected token ring network. In order to address the problem, Bux and Grillo suggested a method of dynamically adjusting the size of windows depending on the traffic of a network. In this thesis, a different method of addressing the problem was proposed. The proposed method is to add a secondary transmission link to the backbone ring of a network to form a double linked backbone ring network. Simulation results show that the most influential element contributing to the degradation of performance is congestion at the bridges in a network. The processing speed of bridges for the proposed double linked backbone ring network is essentially double that of the original network. The increased processing speed of the bridges enhances the performance of the network. Experimental results for the utilization, throughput and response time of the original network and the proposed double linked backbone ring are presented: / Master of Science

Ring networks are appropriate for the full range of network levels, including multiprocessor systems, local area computer networks and high speed backbones. The most well known and widely implemented examples are the IBM token ring and FDDI networks. Ring networks have the advantages of high channel utilisation and bounded delay if an n-limited service policy is used. The packet transfer delay, defined as the average time a packet spends in the network from the time it is generated until the time it is received at its destination node, improves with the number of rings on which a node is connected. However, many ring connections are not economically feasible since the cost of the ring interface increases with the number of rings. There has been an abundance of previous work on single token ring networks. A number of papers on slotted rings, register insertion rings and more complex ring architectures have also been published. However, there is very little existing literature on multiple ring networks as well as ring networks in clustered traffic environments, i.e. where nodes from the same cluster tend to communicate more with each other than with other nodes in the network. This thesis focuses on two network topologies that make use of multiple rings and are well suited to clustered traffic environments: the two-connected multiple ring (2-MR) and the destination removal double ring (DRDR). For the 2-MR network, three different practical token-based protocols are investigated in an attempt to optimise performance. It is further shown that significant performance improvements can be achieved by employing a slotted ring protocol rather than the token ring protocol. The DRDR network is also examined and its performance compared to the aforementioned architectures. For each of the six cases, both random and clustered traffic patterns are considered and compared. Analytical results are derived which are verified by results obtained from computer simulations. Furthermore, we look at exact methods of analysing ring networks. A mean value analysis of a single token ring network with a I-limited service discipline is performed, which clearly shows the complexity exact methods introduce. Finally, although it has been stated in the literature that an exact analysis of a multiple symmetrical token ring network is intractable, we present a novel Markov chain approach that gives exact results for near zero loads. / Thesis (M.Sc.-Electronic Engineering)-University of Natal, 1998.

Thesis (M. App. Sc.)--Carleton University, 2005. / Includes bibliographical references (p. 71-76). Also available in electronic format on the Internet.

Thesis (MTech(Electrical Engineering))--Cape Peninsula University of Technology, 2011 / In a situation, where there is a shortage of power generation or the power stations are operating with a very low reserve margin, as is typically the current position in South Africa, there is a need to operate distribution network at the highest possible efficiency by utilising network power loss reduction techniques. Such techniques are especially important when contingencies occur as they tend to increase loss, reduce efficiencies and cause power supplies to such networks to increase. This increase can cause the network or multiples of such networks to be load shed as the power stations do not have the reserve margins to meet this increased demand. The ideal situation would thus be to minimise network loss and in so doing decrease the amount of power needed and possibly avoid load shedding. Thus, there is a need to study efficiency, network loss reduction under contingency conditions and this is the focus of the research. Most large urban distribution networks are operated as ring main networks. Ring networks are considered to have less power loss. However, a major component in a ring network can cause the loss to substantially increase; resulting in power shortage in the network. There is an urgency to eliminate high network loss. An efficiency plan was developed for a large ring network that reduces the loss so that its input power can be decreased. In this way, the available power existing due to the contingency can be more evenly spread, and the number of ring main networks to be load shed could be reduced.

In classical network information theory, information packets are treated as commodities, and the nodes of the network are only allowed to duplicate and forward the packets. The new paradigm of network coding, which was introduced by Ahlswede et al., states that if the nodes are permitted to combine the information packets and forward a function of them, the throughput of the network can dramatically increase. In this dissertation we focused on the design and analysis of low complexity network coding schemes for different topologies of wired and wireless networks. In the first part we studied the routing capacity of wired networks. We provided a description of the routing capacity region in terms of a finite set of linear inequalities. We next used this result to study the routing capacity region of undirected ring networks for two multimessage scenarios. Finally, we used new network coding bounds to prove the optimality of routing schemes in these two scenarios. In the second part, we studied node-constrained line and star networks. We derived the multiple multicast capacity region of node-constrained line networks based on a low complexity binary linear coding scheme. For star networks, we examined the multiple unicast problem and offered a linear coding scheme. Then we made a connection between the network coding in a node-constrained star network and the problem of index coding with side information. In the third part, we studied the linear deterministic model of relay networks (LDRN). We focused on a unicast session and derived a simple capacity-achieving transmission scheme. We obtained our scheme by a connection to the submodular flow problem through the application of tools from matroid theory and submodular optimization theory. We also offered polynomial-time algorithms for calculating the capacity of the network and the optimal coding scheme. In the final part, we considered the multicasting problem in an LDRN and proposed a new way to construct a coding scheme. Our construction is based on the notion of flow for a unicast session in the third part of this dissertation. We presented randomized and deterministic polynomial-time versions of our algorithm.

Thesis (M.App.Sc.) - Carleton University, 2002. / Includes bibliographical references (p. 59-63). Also available in electronic format on the Internet.

Orientadores: Nelson Luis Saldanha da Fonseca, Marcos Rogerio Salvador / Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Computação / Made available in DSpace on 2018-08-08T22:05:51Z (GMT). No. of bitstreams: 1 Uesono_MarceloMitsutoshi_M.pdf: 1126012 bytes, checksum: de8cfd74039d54886967b1fc3c6176d4 (MD5) Previous issue date: 2005 / Resumo: Em redes ópticas em anel com slotting, slots de tamanhos fixos circulam continuamente pelo anel transportando pacotes de dados entre os nós. Em tais redes, um slot, ocupado com pacotes de um nó, tem seu conteúdo removido somente pelo próprio nó de origem. Entretanto, é possível remover o conteúdo do slot no nó de destino, técnica conhecida como remoção no destino, o que permite que um slot seja utilizado mais de uma vez em cada ciclo, o que é conhecido como reutilização espacial. Esta prática aumenta consideravelmente a vazão do anel. Entretanto, se o acesso aos slots não for controlado, injustiças podem ocorrer devido a oportunidades desbalanceadas de acesso ao meio oferecido aos nós. Para previnir um acesso injusto ao meio, a ocupação dos slots é controlada pelos protocolos de controle de acesso ao meio (MAC), que distribuem os slots entre os nós, oferecendo oportunidades justas do acesso ao meio. Os protocolos MAC seguem políticas de justiça, que são regras que determinam a divisão justa dos recursos do anel. Os protocolos MAC que oferecem justiça entre nós são comuns na literatura, entretanto, estes protocolos ignoram a justiça entre conexões TCP (Transmission Control Protocol)o Nesta dissertação, três novos protocolos são apresentados: LCR-SD, TCP-Fair e RVQ. O protocolo LCR-SD distribui a largura de banda baseada na política de justiça entre pares origem-destino, o protocolo RVQ oferece justiça entre conexões TCP e o protocolo de TCP -Fair oferece a justiça entre as conexões TCP mantendo a justiça entre nós. Os protocolos são comparados através de simulações realizadas no Network Simulator (NS-2). Resultados indicam que os protocolos LCR-SD, TCP-Fair e RVQ oferecem uma vazão superior ao protocolo Metaring. Além disso, apresenta-se um estudo sobre o impacto do tamanho dos slots no transporte de tráfego da Internet / Abstract: In slotted ring networks, slots of fixed size continuously circulate the ring transferring data packets between nodes. In such networks, a slot occupied by packets from one node, has its content removed only by the source node. However, it is possible to remove the packet content in the destination node, technique known as destination removal, which allows a slot to be used more than once in each cycle, leading to spatial reuse, which increases considerably the throughput. However, if the access to the slots is not regulated, unfairness may occur due to unbalanced medium access opportunities offered to the nodes. To prevent unfair access to the medium, the occupation of the slots is regulated by a Medium Access Control protocol (MAC), which distributes the slots among the nodes, offering fair access opportunities to the medium. MAC protocols comply with fairness policies, which are rules that determine the fair distribution of the ring resources. MAC protocols that offer fairness among nodes are common in the literature, however, these protocols ignore the fairness among TCP (Transmission Control Protocol) connections. In this dissertation, three new protocols are presented: LCR-SD, TCP-Fair and RVQ. The LCR-SD protocol distributes the bandwidth based on the source-destination node fairness policy, the RVQ protocol offers fairness among TCP connections and the TCP-Fair protocol offers fairness among TCP connections and maintains fairness among nodes. The protocols are compared through simulations using the Network Simulator (NS- 2). Results indicate that the protocols LCR-SD, TCP-Fair and RVQ offer a superior throughput compared to the Metaring protocol. Moreover, a study on the impact of the slot size on the transport of Internet traffic is presented. / Mestrado / Redes de Computadores / Mestre em Ciência da Computação

L'industrie des télécommunications sans fil fait actuellement face à une croissance considérable pour des débits toujours plus hauts, stimulée par le développement des services mobiles de données. Ce développement rend le spectre disponible de plus en plus rare et nécessite des solutions afin d'optimiser l'usage de ses ressources limitées.Le principal défi auquel les réseaux sans fils font face est de maximiser la disponibilité, la résilience et la qualité de service, tout en minimisant les coûts et en assurant entre les utilisateurs une allocation de ressources équitable. Cette thèse tente de présenter des solutions à ces problèmes et se focalise sur trois thèmes.Sur le premier thème, le but est de trouver la topologie en anneau qui optimise la disponibilité. Il est montré que les algorithmes développés dans le cadre de la théorie des graphes peuvent être utilisés de manière efficace pour définir en temps polynomial la topologie en anneau optimale si les anneaux sont petits (deux nœuds en plus du nœud d'agrégation). Pour les anneaux plus grands, le problème est NP-hard.Le deuxième thème concerne la polarisation. Nous proposons une solution innovante qui peut améliorer efficacité spectrale jusqu'à 50% par comparaison avec l'état de l'art. Le paradigme proposé introduit de nouvelles perspectives au sujet de l'optimisation de la topologie et de l'allocation de canal.Le troisième thème concerne l'allocation de ressources. Nous remettons en question l'approche présente, basée sur l'optimisation de l'efficacité du réseau. Nous montrons que cette approche est similaire au modèle d'utilité espérée de Bernoulli, qui a été réfuté par les paradoxes d'Allais. C'est pourquoi nous introduisons le concept d'aversion au manque d'équité et considérons la question d'allocation de ressources comme un compromis entre efficacité du réseau et équité. / The wireless telecommunication sector is presently facing a tremendous growth of demand for higher data rates, driven by the development of mobile data services. This development makes the available spectrum scarcer and scarcer and requires solutions in order to optimize the use of its limited resources.The main challenge wireless networks are facing is to maximize availability, resiliency and Quality of Service, while minimizing costs and ensuring fair resource allocation among users.The present thesis will try to present solutions to these issues and will focus on three topics.On the first topic, the purpose is to find the ring-based topology which optimizes availability. It will be shown that algorithms which have been developed in the field of graph theory can be used efficiently to define in polynomial time the optimal ring network topology if the rings are small (two nodes in addition to the aggregation node). For bigger rings, the problem will be NP-hard. The second topic deals with polarization. We propose an innovative solution which can improve spectral efficiency in wireless ring networks by up to 50% in comparison with the state of the art. The proposed paradigm brings new perspectives regarding topology optimization and channel allocation.The third topic deals with resource allocation. We question the present approach based on optimization of network effciency. We show that this approach is similar to Bernoulli's expected utility model, which has been disproved by Allais' paradoxes. For this reason, we introduce the concept of unfairness aversion and consider the question of resource allocation as a trade-off between network efficiency and fairness.