Distributed networked systems form an essential resource for computation and applications ranging from commercial, military, scientific, and research communities. Allocation of resources on a given infrastructure is realized through various mapping systems that are tailored towards specific use cases of the requesting applications. While HPC system requests demand compute resources heavy on processor and memory, cloud applications may demand distributed web services that are composed of networked processing and some memory. All resource requests allocate on the infrastructure with some form of network connectivity. However, during mapping of resources, the features and topology constraints of network components are typically handled indirectly through abstractions of user requests. This paper is on a novel graph representation that enables precise mapping methods for distributed networked systems. The proposed graph representations are demonstrated to allocate specific network components and adjacency requirements of a requested graph on a given infrastructure. Furthermore, we report on application of business policy requirements that resulted in increased utilization and a gradual decrease in idle node count as requests are mapped using our proposed methods.

Network traffic modeling plays an important role in the generation of realistic network traffic in test environments. Especially in cases where researchers carry out experiments with real production-like traffic, as seen in specific home, enterprise, campus, LAN, or WAN networks. We present our ongoing work on a new framework that enables the methodical creation of application-agnostic traffic models from given network traces of a known network topology. The framework then uses these models to generate realistic traffic on a given network topology. We share a preliminary evaluation of the framework based on repeatable experiments where we model a typical web application traffic and then regenerate the traffic based on the model in a test network on our VTS (Virtual Topology Services) testbed.

Hadoop is a popular application process big data problems in a networked dist computers. Investigations of performance for networking have been of interest with the networking paradigm through on-demand an enforcements. Network usage characterization can further help understand what policy info needed during application use cases. At scale e Hadoop jobs will help facilitate such char report how Hadoop networking usage can be chi experimentation environment using the Environment for Network Innovation). Further distributed switch framework that may help alleviate the fault tolerance schemes in Hadoop application in the forwarding plane. Delay in recovery from failures has been reduced by almost 99% through such a distributed switch architecture deployed on the GENT experimentation environment.

The foray of wireless networks into time-sensitive applications demands support for emergency services, with guaranteed QoS bounds. The IEEE 802.11e technology could be an attractive option for emergency networking, if the protocol design is enhanced to achieve deterministic QoS for emergency traffic during distributed network operation. We propose channel preemptive EDCA scheme, an in-channel service preemption methodology for the 802.11e EDCA framework where emergency traffic incorporates the privileges to preempt the services of lower priority traffic for better QoS guarantees. The CP-EDCA results for emergency frames depict up to 50% decrease in medium access delays and insensitivity to routine traffic competition.

This paper presents the performance analysis of a code translation (conversion) module for an optical code-division multiple access (O-CDMA) local area network (LAN) system. Simulation results are presented for a code re-using system with two LANs connected by a central router. The same set of codes is being used in each of the two LANs. Code collisions occur at the router when a code in use in one LAN clashes with a message from the other LAN at the same code. A model is developed to simulate the system and to measure the performance characteristics. The simulations indicate that throughput can be increased at least by 20% using a code translation scheme. Furthermore, the network with given number of codes can support twice as many users for the same percentage of code collisions whenever a code translation scheme is employed