<p>In this thesis we focused on high performance embedded real-time networks which are designed for systems like radar signalling processing systems, control systems etc. These high performance embedded networks consist of emerging standards like PCI Express, RapidIO, and standard Ethernet. All of these switched embedded networks communicate with each other through common gateway nodes. As these networks have different rate characteristics, maximum packet size (MTU), packet priorities, addressing schemes etc we have therefore defined the gateway nodes for these heterogeneous embedded networks which will allow these heterogeneous embedded networks to communicate with each other with the help of different translation functions. These gateway nodes allow end-to-end transmission across the heterogeneous embedded networks while keeping bound on end-to-end delay and guaranteed throughput. We need to have some flow control mechanism which will shape the traffic flow in the mentioned embedded networks and will avoid from buffer overflow.</p>

<p>Security  is  the second step after  that a successful network has been deployed. There are many  types  of  attacks  that  could  potentially  harm  the  network  and  an  administrator should  carefully  document  and  plan  the  weak  areas,  where  the  network  could  be compromised. Attackers use special tools and techniques to find out all the possible ways of defeating the network security.  This  thesis  addresses  all  the  possible  tools  and  techniques  that  attackers  use  to compromise the network. The purpose for exploring these tools will help an administrator to find the security holes before an attacker can. All of these tools in this thesis are only for the forensic purpose. Securing routers and switches in the best possible way is another goal. We in this part try to identify important ways of securing these devices, along with their limitations, and then determine the best possible way. The solution will be checked with network vulnerable  tools  to get  the  results.  It  is  important  to note  that most  of  the attention  in  network  security  is  given  to  the  router,  but  far  less  attention  is  given  to securing a switch. This  thesis will also address some more ways of securing a switch, if there is no router in the network. </p> / The opponent for the thesis was Yan Wang and the presentation time was 60 minutes.

At the time of a customer order, the e-tailer assigns the order to one or more of its order fulfillment centers, and/or to drop shippers, so as to minimize procurement and transportation costs, based on the available current information. However this assignment is necessarily myopic as it cannot account for all future events, such as subsequent customer orders or inventory replenishments. We examine the potential benefits from periodically re-evaluating these real-time order-assignment decisions. We construct near-optimal heuristics for the re-assignment for a large set of customer orders with the objective to minimize the total number of shipments. We investigate how best to implement these heuristics for a rolling horizon, and discuss the effect of demand correlation, customer order size, and the number of customer orders on the nature of the heuristics. Finally, we present potential saving opportunities by testing the heuristics on sets of order data from a major e-tailer. / Singapore-MIT Alliance (SMA)

Industrial facilities are characterized by the significant usage of natural resources and the massive discharge of waste materials. An effective strategy towards the sustainability of industrial processes is the conservation of natural resources through waste reclamation and recycles. Because of the numerous number of design alternatives, systematic procedures must be developed for the effective synthesis and screening of reclamation and recycle options. The objective of this work is to develop systematic and generally applicable procedures for the synthesis, design, and optimization of resource conservation networks. Focus is given to two important applications: material utilities (with water as an example) and spent products (with lube oil as an example). Traditionally, most of the previous research efforts in the area of designing direct-recycle water networks have considered the chemical composition as the basis for process constraints. However, there are many design problems that are not component-based; instead, they are property-based (e.g., pH, density, viscosity, chemical oxygen demand (COD), basic oxygen demand (BOD), toxicity). Additionally, thermal constraints (e.g., stream temperature) may be required to identify acceptable recycles. In this work, a novel approach is introduced to design material-utility (e.g., water) recycle networks that allows the simultaneous consideration of mass, thermal, and property constraints. Furthermore, the devised approach accounts for the heat of mixing and for the interdependence of properties. An optimization formulation is developed to embed all potential configurations of interest and to model the mass, thermal, and property characteristics of the targeted streams and units. Solution strategies are developed to identify stream allocation and targets for minimum fresh usage and waste discharge. A case study on water management is solved to illustrate the concept of the proposed approach and its computational aspects. Next, a systematic approach is developed for the selection of solvents, solvent blends, and system design in in extraction-based reclamation processes of spent lube oil Property-integration tools are employed for the systematic screening of solvents and solvent blends. The proposed approach identifies the main physical properties that influence solvent(s) performance in extracting additives and contaminants from used lubricating oils (i.e. solubility parameter (delta), viscosity (v), and vapor pressure (p)). The results of the theoretical approach are validated through comparison with experimental data for single solvents and for solvent blends. Next, an optimization formulation is developed and solved to identify system design and extraction solvent(s) by including techno-economic criteria. Two case studies are solved for identification of feasible blends and for the cost optimization of the system.

The Internet is divided into multiple layers to reduce and manage complexity. The International Organization for Standardization (ISO) developed a 7 layer network model and had been revised to a 5 layer TCP/IP based Internet Model. The layers of the Internet can also be divided into top layer TCP/IP protocol suite layers and the underlying transport network layers. SONET/SDH, a dominant transport network, was designed initially for circuit based telephony services. Advancement in the internet world with voice and video services had pushed SONET/SDH to operate with reduced efficiencies and increased costs. Hence, redesign and redeployment of the transport network has been and continues to be a subject of research and development. Several projects are underway to explore new transport network ideas such as G.709 and GMPLS.<p> This dissertation presents the Geographical Cell Transport (GCT) protocol as a candidate for a next generation transport network. The GCT transport protocol and its cell format are described. The benefits provided by the proposed GCT transport protocol as compared to the existing transport networks are investigated. Existing switch architectures are explored and a best architecture to be implemented in VLSI for the proposed transport network input queued virtual output queuing is obtained. The objectives of this switch are high performance, guaranteed fairness among all inputs and outputs, robust behavior under different traffic patterns, and support for Quality of Service (QoS) provisioning. An implementation of this switch architecture is carried out using HDL.<p> A novel pseudo random number generation unit is designed to nullify the bias present in an arbitration unit. The validity of the designed is checked by developing a traffic load model. The speedup factor required in the switch to maintain desired throughput is explored and is presented in detail. Various simulation results are shown to study the behavior of the designed switch under uniform and hotspot traffic. The simulation results show that QoS behavior and the crossing traffic through the switch has not been affected by hotspots.

While the hippocampus may play an essential role in the expression of memories soon after training, over time these memories are thought to become increasingly dependent on coordinated activity in a broad network of cortical and subcortical brain regions. However, the distributed nature of this representation has made it challenging to define the neural elements of the memory trace, and lesion and electrophysiological approaches provide only a narrow window into what is appreciated to be a much more global network. Here global mapping approaches are used to identify networks of brain regions that are activated and co-activated following recall of recent and remote contextual fear memory in mice. Analysis of Fos expression across 84 brain regions allowed for the description of brain-wide activity and interactivity of brain regions associated with memory expression. Activity analysis revealed that remote memory engages a broad collection of cortical and subcortical regions in comparison to recent memory expression. Interactivity analyses revealed that functional connectivity associated with fear memories depends on memory age and is altered in mutant mice that exhibit premature forgetting. In-depth functional connectivity analysis of remote long-term fear memory indicates that memory recall engages a network that has a distinct thalamic-hippocampal-cortical signature. This network is concurrently integrated and segregated and therefore has small-world properties as well as a resilient core of highly inter-connected regions. Centrality measures identify a collection of regions that may play a critical role in the function of the network including expected regions such as the anterior cingulate cortex and prelimbic cortex as well as novel regions including the reuniens thalamic nucleus. Post conditioning lesions of the reuniens lead to mild deficits in contextual fear memory expression providing support for the idea that identified hub regions may play a critical role in the function of the network. These results identify and describe functional activity and interactivity of brain regions underlying recent and remote fear memory expression and provide strong evidence for reorganization and distribution of the functional organization of memories over time.

This thesis proposes a clustering algorithm for vehicular communication networks. A novel clustering metric and an improved clustering framework are introduced. The novel clustering metric, network criticality, is a global metric on undirected graphs which quantifies the robustness of the graph against changes in environmental parameters, and point-to-point network criticality is also defined to measure the resistance between different points of a graph. We localize the notion of network criticality for a node of a vehicular network which can potentially be promoted as the cluster header. We use the localized notion of node criticality in conjunction with a universal link metric, Link Expiration Time (LET), to derive a clustering algorithm for the vehicular network. We employ a distributed multi-hop clustering algorithm based on the notion of network criticality. Simulation results show that the proposed clustering algorithm forms a more robust cluster structure.

This thesis proposes a clustering algorithm for vehicular communication networks. A novel clustering metric and an improved clustering framework are introduced. The novel clustering metric, network criticality, is a global metric on undirected graphs which quantifies the robustness of the graph against changes in environmental parameters, and point-to-point network criticality is also defined to measure the resistance between different points of a graph. We localize the notion of network criticality for a node of a vehicular network which can potentially be promoted as the cluster header. We use the localized notion of node criticality in conjunction with a universal link metric, Link Expiration Time (LET), to derive a clustering algorithm for the vehicular network. We employ a distributed multi-hop clustering algorithm based on the notion of network criticality. Simulation results show that the proposed clustering algorithm forms a more robust cluster structure.

Peer-to-Peer (P2P) systems are emerging as a new form of distributed computing with a strong emphasis on self-organization, decentralization, and autonomy of the participating nodes. The characteristics of self-organization, autonomy, and decentralization allow for highly adaptive, robust, and scalable networks, making P2P an increasingly interesting way to design distributed systems. <p>Since the deployment of P2P systems involves significant resources, e.g., hundreds of hosts and users, it is often not possible to run realistic tests prior to the rollout of the system. Consequently, simulation is the only realistic approach for testing or predicting the behavior of large P2P networks. However, the majority of the existing simulators tend to provide limited flexibility in simulating the details of the users, application, protocol, and physical network. <p>In this research, the impact of user behavior, protocol, and physical network characteristic on the overall P2P system are being observed. The aim is to investigate the importance of simulating P2P systems in such detail.

Computers are networked together in order to share the information they store and process. The internet connects many of these networks together, offering a multitude of options for communication, productivity and entertainment. It also offers the opportunity for unscrupulous individuals to contact these networked computers and attempt to appropriate or destroy the data on them, the computing resources they provide, and the identity or reputation of the computer user. Measures to secure networks need to be implemented by network administrators and users to protect their computing assets. <p>Firewalls filter information as it flows through a network. This filter can be implemented in hardware or software and can be used to protect computers from unwanted access. While software firewalls are considered easier to set up and use, hardware firewalls are often considered faster and more secure. Absent from the marketplace is an embedded hardware solution applicable to desktop systems. <p>Traditional software firewalls use the processor of the computer to filter packets; this is disadvantageous because the computer can become unusable during a network attack when the processor is swamped by the firewall process. Traditional hardware firewalls are usually implemented in a single location, between a private network and the internet. Depending on the size of the private network, a hardware firewall may be responsible for filtering the network traffic of hundreds of clients. This not only makes the required hardware firewall quite expensive, but dedicates those financial resources to a single point that may fail. <p>The dynamic silicon firewall project implements a hardware firewall using a soft-core processor with a custom peripheral designed using a hardware description language. Embedding this hardware firewall on each network interface card in a network would offer many benefits. It would avoid the aforementioned denial of service problem that software firewalls are susceptible to since the custom peripheral handles the filtering of packets. It could also reduce the complexity required to secure a large private network, and eliminate the problem of a single point of failure. Also, the dynamic silicon firewall requires little to no administration since the filtering rules change with the users network activity. The design of the dynamic silicon firewall incorporates the best features from traditional hardware and software firewalls, while minimizing or avoiding the negative aspects of each.