Self-organizing overlay networks have emerged as a powerful paradigm for providing network services. While most approaches assume that overlay networks are built over a single substrate network, generally, the Internet, this thesis addresses the construction of overlay networks over multiple substrate networks. We present the design, implementation and evaluation of Cross-Substrate Advertisement (CSA) mechanisms for overlay networks over multiple heterogeneous substrate networks. A key difficulty arises from the more complex address bindings, since a single logical identifier is bound to multiple substrate addresses. We present mechanisms for exchanging information on address bindings and evaluate their effectiveness. The CSA mechanisms have been implemented in the HyperCast overlay protocol architecture, and have been evaluated in measurement experiments on an Emulab testbed. The experiments show that our CSA methods are effective in disseminating address information in large networks and are robust in the presence of network disruptions.

Modern datacenters require a network with high cross-section bandwidth, fine-grained security, support for virtualization, and simple management that can scale to hundreds of thousands of hosts at low cost. This thesis first presents the firmware for Rain Man, a novel datacenter network architecture that meets these requirements, and then performs a general scalability study of the design space. The firmware for Rain Man, a scalable Software-Defined Networking architecture, employs novel algorithms and uses previously unused forwarding hardware. This allows Rain Man to scale at high performance to networks of forty thousand hosts on arbitrary network topologies. In the general scalability study of the design space of SDN architectures, this thesis identifies three different architectural dimensions common among the networks: source versus hop-by-hop routing, the granularity at which flows are routed, and arbitrary versus restrictive routing and finds that a source-routed, host-pair granularity network with arbitrary routes is the most scalable.

Advances in micro-sensor and wireless technology enable small but smart sensors to be developed for wide range environment-monitor applications. Since Sensor nodes only have limited power capacity and are difficult to recharge, how to prolong network lifetime is an important issue in wireless sensor networks design. Several topology control algorithms have been proposed to maintain the connectivity of wireless sensor network and reduce the energy consumption. Multi-hop Infrastructure Network Architecture (MINA) is a kind of Multi-layer Architecture for WSN topology, which utilizes hundred of sensors to transmit data to a sink. This architecture partitions sensor nodes into layers based on their distances (calculated by hop count) to BS. In this way, the node connected to more nodes will relay more data for other nodes. This make the node exhaust its battery power quickly and thus reduces the network lifetime. This study proposes an Efficient Energy Time-Slot Allocation (EETA) scheme which distributes time slots in accordance with the energy of neighbor nodes and the number of neighbor nodes. In addition, this work also devises an adaptive time slot size to reduce data packet drop in case when the node buffer is full. The simulation results show that the EETA performs better than the MINA in terms of network lifetime.

<p>The focus of this dissertation is on large-scale and long-running networked real-time multiplayer games. In this type of games, each player controls one or many entities, which interact in a shared virtual environment. Three attributes - scalability, security, and fault tolerance - are considered essential for this type of games. The normal approaches for building this type of games, using a client/server or peer-to-peer architecture, fail in achieving all three attributes. We propose a server-network architecture that supports these attributes. In this architecture, a cluster of servers collectively manage the game state and each server manages a separate region of the virtual environment. We discuss how the architecture can be extended using proxies, and we compare it to other similar architectures. Further, we investigate how a distributed database management system can support the proposed architecture. Since efficiency is very important in this type of games, some properties of traditional database systems must be relaxed. We also show how methods for increasing scalability, such as interest management and dead reckoning, can be implemented in a database system. Finally, we suggest how the proposed architecture can be validated using a simulation of a large-scale game.</p>

With the growth of Internet, the underlying protocols are increasingly challenged by new technologies and applications. The original Internet protocols were, however, not designed for wireless communication, mobility, long disconnection times, and varying bandwidths. In this thesis, we study challenged networking, and how well old and new protocols operate under such constraints. Our study is experimental. We build network testbeds and measure the performance of alternative protocols and architectures. We develop novel methodologies for repeatable experiments that combine emulations, simulations and real world experiments. Based on our results we suggest modifications to existing protocols, and we also develop a new network architecture that matches the constraints of a challenged network, in our case, an opportunistic network. One of our most important contributions is an Ad hoc Protocol Evaluation (APE) testbed. It has been successfully used worldwide. The key to its success is that it significantly lowers the barrier to repeatable experiments involving wireless and mobile computing devices. Using APE, we present side-by-side performance comparisons of IETF MANET routing protocols. A somewhat surprising result is that some ad hoc routing protocols perform a factor 10 worse in the testbed than predicted by a common simulation tool (ns-2). We find that this discrepancy is mainly related to the protocols’ sensing abilities, e.g., how accurately they can infer their neighborhood in a real radio environment. We propose and implement improvements to these protocols based on the results. Our novel network architecture Haggle is another important contribution. It is based on content addressing and searching. Mobile devices in opportunistic networks exchange content whenever they detect each other. We suggest that the exchange should be based on interests and searches, rather than on destination names and addresses. We argue that content binding should be done late in challenged networks, something which our search approach supports well.

Objetivos generales: - Investigar los aspectos vinculados a la obtención de servicios de streaming, el modelado de redes de datos y la caracterización del tráfico allí cursado. - Determinar un mecanismo que permita establecer un orden entre los nodos que brindan un determinado servicio o recurso deseado en una red "best effort" como es Internet Objetivos específicos: - Armar una taxonomía de los servicios que se pueden brindar en redes IP. - Analizar diferentes formas de modelizar redes de datos, de manera tal que resulte lo más fiel posible a la realidad de una red como Internet, en cuanto a topología, velocidad de enlaces, agregación y caracterización del tráfico, congestión, etc. - Diagramar y ejecutar simulaciones, en un modelo de red, que permitan cuantificar parámetros de comunicación (bandwidth, delay, jitter, packet loss) en diferentes tipos de servicios que se pueden brindar en dicha red. - Establecer un criterio que permita ordenar los nodos que ofrecen el servicio deseado considerando los resultados de las simulaciones abordadas.

El presente trabajo pretende analizar las distintas alternativas que ofrece el mercado y analizar los accesos a las redes. A esto se asocian diversos productos y tecnologías, y los estándares no están aun definidos en un mercado que es extremadamente difícil de entender. Esta confusión lleva a ideas confusas, mucha gente toma pedazos de información que oyen y forman juicios incorrectos de qué pueden hacer los productos y qué amenazas tratan realmente.

In the last 15 years, the adoption of enterprise level data networks had increased dramatically. This is mainly due to reasons, such as better use of IT resources, and even better coordination between departments and business units. These great demands have fuelled the push for better and faster connectivity to and from these networks, and even within the networks. We have moved from the slow 10Mbps to 1Gbps connectivity for end-point connections and moved from copper-based ISDN to fibre-linked connections for enterprise connections to the Internet. We now even include wireless network technologies in the mix, because of the greater convenience it offers. Such rapid progress is accompanied by ramifications, especially if not all aspects of networking technologies are improved linearly. Since the 1960s and 1970s, the only form of security had been along the line of authentication and authorisation. This is because of the widely used mainframes in that era. When the Internet and, ultimately, the wide-spread use of the Internet influxed in the 1980s, network security was born, and it was not until the late 1980s that saw the first Internet Worm that caused damage to information and systems on the Internet. Fast forward to today, and we see that although we have come a long way in terms of connectivity (connect to anywhere, and anytime, from anywhere else), the proposed use of network security and network security methods have not improved very much. Microsoft Windows XP recently switched from using their own authentication method, to the use of Kerberos, which was last revised 10 years ago. This thesis describes the many problems we face in the world of network security today, and proposes several new methods for future implementation, and to a certain extend, modification to current standards to encompass future developments. Discussion will include a proposed overview of what a secure network architecture should include, and this will lead into several aspects that can be improved on. All problems identified in this thesis have proposed solutions, except for one. The critical flaw found in the standard IEEE802.11 wireless technology was discovered during the course of this research. This flaw is explained and covered in great detail, and also, an explanation is given as to why this critical flaw is not fixable.

Thesis (M.S.)--Rochester Institute of Technology, 1990. / Spine title: Authentication models. Bibliography. p. [167-175].

Αντικείμενο της διπλωματικής εργασίας είναι η μελέτη των παρεχόμενων υπηρεσιών στα Δίκτυα Νέας Γενιάς. Στο πρώτο μέρος της εργασίας, γίνεται μια σύντομη περιγραφή στην έννοια των Δικτύων Νέας Γενιάς. Περιγράφονται συνοπτικά οι παράγοντες που οδηγούν στην ανάπτυξή τους, τα βασικά τους χαρακτηριστικά, οι υποδομές που απαιτούνται για να γίνει πραγματικότητα η μετάβαση από το υπάρχον δίκτυο σε ένα δίκτυο Νέας Γενιάς, καθώς και οι προκλήσεις και οι περιορισμοί που παρουσιάζονται κατά την ανάπτυξή τους. Στο δεύτερο μέρος της εργασίας περιγράφονται αναλυτικά οι Υπηρεσίες και οι Εφαρμογές που θα υποστηρίζει ένα τέτοιο δίκτυο, καθώς και η Αρχιτεκτονική του. Ακόμα, γίνεται αναφορά στον τρόπο με τον οποίο θα εξελιχθούν οι ήδη υπάρχουσες υπηρεσίες και τεχνολογίες των Ευφυών Δικτύων. Στο τρίτο και τελευταίο μέρος, περιγράφεται το στάδιο στο οποίο βρίσκεται η εξέλιξη των Δικτύων Νέας Γενιάς σήμερα, καθώς και τα προβλήματα της ασφάλειας που παρουσιάζονται. / This project studies the next generation's networks services.