Parallelism can use existing technology in computer communications network design to provide higher data rates and a greater degree of flexibility than monolithic systems. This research investigates the design of a high-speed Parallel Local Area Network (PLAN) interface. It defines the goals of a PLAN interface as low data latency, high data throughput, scalability, and low cost. Three fundamental PLAN interface categories are proposed to meet these goals. These categories are single-bus, dual-bus, and bus-free adaptors. The relative merits of each category are discussed in terms of suitability to several adaptor applications. Each category is further explored by developing a VHDL model of a representative system. The latency, throughput, and component utilization of each model is measured. For medium to large data sets, the dual-bus design provides slightly greater throughput when transmitting encoded data. When transmitting medium to large unencoded data sets, the bus-free design yields marginally higher throughput. In nearly all cases the bus-free design has a greater latency than either of the bus-based design options. Other insights gained from the models regarding physical construction of each adaptor type are also presented. / Master of Science

Thesis (MScEng (Electrical and Electronic Engineering))--University of Stellenbosch, 2009. / ENGLISH ABSTRACT: This thesis discusses the steps that should be taken when conceptualising, designing and implementing a South African national research and education network. It looks at all aspects of specifying transmission mediums and technology, choosing hardware and interfaces and detailing node layout and optic fibre network architecture. It examines the design of a national transport backbone, as well as a metropolitan optic fibre network. It considers ways in which the network may be made future-proof, both in terms of capacity and technology, and suggests ways to integrate the incumbent tertiary and education network into a fully-fledged, world-class network. Finally it benchmarks the network against similar networks in other countries, most notably the United States of America. / AFRIKAANSE OPSOMMING: Hierdie tesis bespreek die stappe wat geneem behoort te word wanneer 'n Suid Afrikaanse nasionale navorsings en tersiêre opvoedings netwerk gekonseptualiseer, ontwerp en geïmplementeer word. Dit beskou al die aspekte rondom die spesifiseering van transmissie mediums en -tegnologie, die keuse van hardeware en koppelvlakke en die detailering van nodus uitlegte en optiese vesel netwerk argitektuur. Dit ondersoek die ontwerp van 'n nasionale transmissie ruggraat netwerk, sowel as 'n metropolitaanse optiese vesel netwerk. Dit oorweeg maniere waarmee 'n netwerk toekomsproef gemaak kan word, beide in terme van kapasiteit sowel as tegnologie, en stel maniere voor waarmee die huidige tersiêre opvoeding en navorsingsnetwerk geïntegreer kan word na 'n volwaardige, wêreldklas netwerk. Uiteindelik word die netwerk ontwerp vergelyk met soortgelyke netwerke in ander lande, spesifiek in die Verenigde State van Amerika.

Multi-hop broadcast is one of the main approaches to disseminate data in VANET. Therefore, it is important to design a reliable multi-hop broadcast protocol, which satis es both reachability and bandwidth consumption requirements. In a dense network, where vehicles are very close to each other, the number of vehicles needed to rebroadcast the message should be small enough to avoid a broad- cast storm, but large enough to meet the reachability requirement. If the network is sparse, a higher number of vehicles is needed to retransmit to provide a higher reachability level. So, it is obvious that there is a tradeo between reachability and bandwidth consumption. In this work, considering the above mentioned challenges, we design a number of smart broadcast protocols and evaluate their performance in various network den- sity scenarios. We use fuzzy logic technique to determine the quali cation of vehicles to be forwarders, resulting in reachability enhancement. Then we design a band- width e cient fuzzy logic-assisted broadcast protocol which aggressively suppresses the number of retransmissions. We also propose an intelligent hybrid protocol adapts to local network density. In order to avoid packet collisions and enhance reachability, we design a cross layer statistical broadcast protocol, in which the contention window size is adjusted based on the local density information. We look into the multi-hop broadcast problem with an environment based on game theory. In this scenario, vehicles are players and their strategy is either to volunteer and rebroadcast the received message or defect and wait for others to rebroadcast. We introduce a volunteer dilemma game inspired broadcast scheme to estimate the probability of forwarding for the set of potential forwarding vehicles. In this scheme we also introduce a fuzzy logic-based contention window size adjustment system. Finally, based on the estimated spatial distribution of vehicles, we design a transmission range adaptive scheme with a fuzzy logic-assisted contention window size system, in which a bloom lter method is used to mitigate overhead. Extensive experimental work is obtained using simulation tools to evaluate the performance of the proposed schemes. The results con rm the relative advantages of the proposed protocols for di erent density scenarios. / Includes bibliography. / Dissertation (Ph.D.)--Florida Atlantic University, 2017. / FAU Electronic Theses and Dissertations Collection

Dans cette thèse, nous étudions différents modèles, déterministes et stochastiques, pour les problèmes de dimensionnement de réseaux. Nous examinons également le problème du sac-à-dos stochastique ainsi que, plus généralement, les contraintes de capacité en probabilité.<p>\ / Doctorat en Sciences / info:eu-repo/semantics/nonPublished

This work presents the development of the Statistical Location-Assisted Broadcast (SLAB) protocol, a multi-hop wireless broadcast protocol designed for vehicular ad-hoc networking (VANET). Vehicular networking is an important emerging application of wireless communications. Data dissemination applications using VANET promote the ability for vehicles to share information with each other and the wide-area network with the goal of improving navigation, fuel consumption, public safety, and entertainment. A critical component of these data dissemination schemes is the multi-hop wireless broadcast protocol. Multi-hop broadcast protocols for these schemes must reliably deliver broadcast packets to vehicles in a geographically bounded region while consuming as little wireless bandwidth as possible. This work contains substantial research results related to development of multi-hop broadcast protocols for VANET, culminating in the design of SLAB. Many preliminary research and development efforts have been required to arrive at SLAB. First, a high-level wireless broadcast simulation tool called WiBDAT is developed. Next, a manual optimization procedure is proposed to create efficient threshold functions for statistical broadcast protocols. This procedure is then employed to design the Distribution-Adaptive Distance with Channel Quality (DADCQ) broadcast protocol, a preliminary cousin of SLAB. DADCQ is highly adaptive to node density, node spatial distribution pattern, and wireless channel quality in realistic VANET scenarios. However, the manual design process used to create DADCQ has a few deficiencies. In response to these problems, an automated design procedure is created that uses a black-box global optimization algorithm to search for efficient threshold functions that are evaluated using WiBDAT. SLAB is finally designed using this procedure. / Expansive simulation results are presented comparing the performance of SLAB to two well-published VANET broadcast protocols, p -persistence and Advanced Adaptive Gossip (AAG), and to DADCQ. The four protocols are evaluated under varying node density and speed on five different road topologies with varying wireless channel fading conditions. The results demonstrate that unlike p-persistence and AAG, SLAB performs well across a very broad range of environmental conditions. Compared to its cousin protocol DADCQ, SLAB achieves similar reachability while using around 30% less wireless bandwidth, highlighting the improvement in the automated design methodology over the manual design. / by Michael J. Slavik. / Thesis (Ph.D.)--Florida Atlantic University, 2011. / Includes bibliography. / Electronic reproduction. Boca Raton, Fla., 200?. Mode of access: World Wide Web.

A Vehicular Ad-hoc Network (VANET) is a wireless ad-hoc network that provides communications among vehicles with on-board units and between vehicles and nearby roadside units. The success of a VANET relies on the ability of a routing protocol to ful ll the throughput and delivery requirements of any applications operating on the network. Currently, most of the proposed VANET routing protocols focus on urban or highway environments. This dissertation addresses the need for an adaptive routing protocol in VANETs which is able to tolerate low and high-density network tra c with little throughput and delay variation. This dissertation proposes three Geographic Ad-hoc On-Demand Distance Vector (GEOADV) protocols. These three GEOADV routing protocols are designed to address the lack of exibility and adaptability in current VANET routing protocols. The rst protocol, GEOADV, is a hybrid geographic routing protocol. The second protocol, GEOADV-P, enhances GEOADV by introducing predictive features. The third protocol, GEOADV-PF improves optimal route selection by utilizing fuzzy logic in addition to GEOADV-P's predictive capabilities. To prove that GEOADV and GEOADV-P are adaptive their performance is demonstrated by both urban and highway simulations. When compared to existing routing protocols, GEOADV and GEOADV-P lead to less average delay and a higher average delivery ratio in various scenarios. These advantages allow GEOADV- P to outperform other routing protocols in low-density networks and prove itself to be an adaptive routing protocol in a VANET environment. GEOADV-PF is introduced to improve GEOADV and GEOADV-P performance in sparser networks. The introduction of fuzzy systems can help with the intrinsic demands for exibility and adaptability necessary for VANETs. An investigation into the impact adaptive beaconing has on the GEOADV protocol is conducted. GEOADV enhanced with an adaptive beacon method is compared against GEOADV with three xed beacon rates. Our simulation results show that the adaptive beaconing scheme is able to reduce routing overhead, increase the average delivery ratio, and decrease the average delay. / Includes bibliography. / Dissertation (Ph.D.)--Florida Atlantic University, 2017. / FAU Electronic Theses and Dissertations Collection

Peer-to-peer networks and mobile ad hoc networks are emerging distributed networks that share several similarities. Fundamental among these similarities is the decentralized role of each participating node to route messages on behalf of other nodes, and thereby, collectively realizing communication between any pair of nodes. Messages are routed on a topology graph that is determined by the peer relationship between nodes. Although routing is fairly straightforward when the topology graph is static, dynamic variations in the peer relationship that often occur in peer-to-peer and mobile ad hoc networks present challenges to routing. In this thesis, we examine the interplay between routing messages and network topology design in two classes of these networks -- unstructured peer-to-peer networks and sparsely-connected mobile ad hoc networks. In unstructured peer-to-peer networks, we add structure to overlay topologies to support file sharing. Specifically, we investigate the advantages of designing overlay topologies with small-world properties to improve (a) search protocol performance and (b) network utilization. We show, using simulation, that "small-world-like" overlay topologies where every node has many close neighbors and few random neighbors exhibit high chances of locating files close to the source of file search query. This improvement in search protocol performance is achieved while decreasing the traffic load on the links in the underlying network. In the context of sparsely-connected mobile ad hoc networks where nodes provide connectivity via mobility, we present a protocol for routing in space and time where the message forwarding decision involves not only where to forward (space), but also when to forward (time). We introduce space-time routing tables and develop methods to compute these routing tables for those instances of ad hoc networks where node mobility is predictable over either a finite horizon or indefinitely due to periodicity in node motion. Furthermore, when the node mobility is unpredictable, we investigate several forwarding heuristics to address the scarcity in transmission opportunities in these sparsely-connected ad hoc networks. In particular, we present the advantages of fragmenting messages and augmenting them with erasure codes to improve the end-to-end message delivery performance.

In this thesis, we consider the k-edge connected L-hop-constrained network design problem. Given a weighted graph G=(N,E), a set D of pairs of terminal nodes, and two integers k,L > 1, it consists in finding in G the minimum cost subgraph containing at least k edge-disjoint paths of at most L edges between each pair in D. This problem is of great interest in today's telecommunication industry, where highly survivable networks need to be constructed.<p><p>We first study the particular case where the set of demands D is reduced to a single pair {s,t}. We propose an integer programming formulation for the problem, which consists in the st-cut and trivial inequalities, along with the so-called L-st-path-cut inequalities. We show that these three classes of inequalities completely describe the associated polytope when k=2 and L=2 or 3, and give necessary and sufficient conditions for them to be facet-defining. We also consider the dominant of the associated polytope, and discuss how the previous inequalities can be separated in polynomial time.<p><p>We then extend the complete and minimal description obtained above to any number k of required edge-disjoint L-st-paths, but when L=2 only. We devise a cutting plane algorithm to solve the problem, using the previous polynomial separations, and present some computational results.<p><p>After that, we consider the case where there is more than one demand in D. We first show that the problem is strongly NP-hard, for all L fixed, even when all the demands in D have one root node in common. For k=2 and L=2,3, we give an integer programming formulation, based on the previous constraints written for all pairs {s,t} in D. We then proceed by giving several new classes of facet-defining inequalities, valid for the problem in general, but more adapted to the rooted case. We propose separation procedures for these inequalities, which are embedded within a Branch-and-Cut algorithm to solve the problem when L=2,3. Extensive computational results from it are given and analyzed for both random and real instances.<p><p>Since those results appear less satisfactory in the case of arbitrary demands (non necessarily rooted), we present additional families of valid inequalites in that situation. Again, separation procedures are devised for them, and added to our previous Branch-and-Cut algorithm, in order to see the practical improvement granted by them.<p><p>Finally, we study the problem for greater values of L. In particular, when L=4, we propose new families of constraints for the problem of finding a subgraph that contains at least two L-st-paths either node-disjoint, or edge-disjoint. Using these, we obtain an integer programming formulation in the space of the design variables for each case.<p><p>------------------------------------------------<p><p>Dans cette thèse, nous considérons le problème de conception de réseau k-arete connexe à chemins L-bornés. Etant donné un graphe pondéré G=(N,E), un ensemble D de paires de noeuds terminaux, et deux entiers k,L > 1, ce problème consiste à trouver, dans G, un sous-graphe de cout minimum tel que, entre chaque paire dans D, il existe au moins k chemins arete-disjoints de longueur au plus L. Ce problème est d'un grand intéret dans l'industrie des télécommunications, où des réseaux hautement fiables doivent etre construits.<p><p>Nous étudions tout d'abord le cas particulier où l'ensemble des demandes D est réduit à une seule paire de noeuds. Nous proposons une formulation du problème sous forme de programme linéaire en nombres entiers, laquelle consiste en les inégalités triviales et de coupe, ainsi que les inégalités dites de L-chemin-coupe. Nous montrons que ces trois types d'inégalités décrivent complètement le polytope associé lorsque k=2 et L=2,3, et donnons des conditions nécessaires et suffisantes pour que celles-ci en définissent des facettes. Nous considérons également le dominant du polytope associé et discutons de la séparation polynomiale des trois classes précédentes.<p><p>Nous étendons alors cette description complète et minimale à tout nombre k de chemins arete-disjoints de longueur au plus 2. De plus, nous proposons un algorithme de plans coupants utilisant les précédentes séparations polynomiales, et en présentons quelques résultats calculatoires, pour tout k>1 et L=2,3.<p><p>Nous considérons ensuite le cas où plusieurs demandes se trouvent dans D. Nous montrons d'abord que le problème est fortement NP-dur, pour tout L fixé et ce, meme si les demandes sont toutes enracinées en un noeud. Pour k=2 et L=2,3, nous donnons une formulation du problème sous forme de programme linéaire en nombres entiers. Nous proposons également de nouvelles classes d'inégalités valides, pour lesquelles nous réalisons une étude faciale. Celles-ci sont alors séparées dans le cadre d'un algorithme de coupes et branchements pour résoudre des instances aléatoires et réelles du problème.<p><p>Enfin, nous étudions le problème pour de plus grandes valeurs de L. En particulier, lorsque L=4, nous donnons de nouvelles familles de contraintes pour le problème consistant à déterminer un sous-graphe contenant entre deux noeuds fixés au moins deux chemins de longueur au plus 4, que ceux-ci doivent etre arete-disjoints ou noeud-disjoints. Grace à ces dernières, nous parvenons à donner une formulation naturelle du problème dans chacun de ces deux cas. <p> / Doctorat en sciences, Spécialisation Informatique / info:eu-repo/semantics/nonPublished

Indiana University-Purdue University Indianapolis (IUPUI) / Mobile IP though allows mobility features to a node it suffers from signaling Latencies which are mainly incurred due to the fact that the MN itself is involved in the handover process. To overcome this problem proxy mobile IPv6(PMIPv6) was defined where the mobility signaling is taken care of by a proxy server while keeping track of the MN's movement. PMIPv6 has considerably reduced the handover latency but the demand for real time applications over the network has increased tremendously due to recent explosion of the cloud era. My thesis focuses on increasing the L3 handoff signaling efficiency by reducing the latency. This is achieved by our idea to do both the AAA authentication as well as the LMA registration in PMIPv6 at the same time. The simulation results show that our proposed approach perform better than the current PMIPv6 L3 handover signaling reducing the latency as well as packet loss.

Indiana University-Purdue University Indianapolis (IUPUI) / Derived from the field of art curation, digital provenance is an unforgeable record of a digital object's chain of successive custody and sequence of operations performed on the object. It plays an important role in accessing the trustworthiness of the object, verifying its reliability and conducting audit trails of its lineage. Digital provenance forms an immutable directed acyclic graph (DAG) structure. Since history of an object cannot be changed, once a provenance chain has been created it must be protected in order to guarantee its reliability. Provenance can face attacks against the integrity of records and the confidentiality of user information, making security an important trait required for digital provenance. The digital object and its associated provenance can have different security requirements, and this makes the security of provenance different from that of traditional data. Research on digital provenance has primarily focused on provenance generation, storage and management frameworks in different fields. Security of digital provenance has also gained attention in recent years, particularly as more and more data is migrated in cloud environments which are distributed and are not under the complete control of data owners. However, there still lacks a viable secure digital provenance scheme which can provide comprehensive security for digital provenance, particularly for generic and dynamic ones. In this work, we address two important aspects of secure digital provenance that have not been investigated thoroughly in existing works: 1) capturing the DAG structure of provenance and 2) supporting dynamic information sharing. We propose a scheme that uses signature-based mutual agreements between successive users to clearly delineate the transition of responsibility of the digital object as it is passed along the chain of users. In addition to preserving the properties of confidentiality, immutability and availability for a digital provenance chain, it supports the representation of DAG structures of provenance. Our scheme supports dynamic information sharing scenarios where the sequence of users who have custody of the document is not predetermined. Security analysis and empirical results indicate that our scheme improves the security of the typical secure provenance schemes with comparable performance.