Outgoing Data Research Articles

Routing in Fog-Enabled IoT Platforms: A Survey and an SDN-Based Solution

Fog computing is a promising technology that helps overcome to the difficulties of handling a huge amount of Internet of Things (IoT) data by distributing its applications and services closer to the network edge. In fog computing, distributed fog servers’ proximity to the end devices enables upcoming and outgoing data to be forwarded efficiently. However, as the size of fog-enabled IoT platforms increases, efficient routing mechanisms are required in fog computing to forward the ubiquitous IoT data to related servers with low latency, low bandwidth, and/or high security. Therefore, software defined networking (SDN) can be employed to optimize the routing process in fog-enabled IoT platforms. In this paper, we first identify the routing requirements of fog computing. Then, we present an extensive survey of routing in fog-enabled IoT platforms. Lastly, we propose a hierarchical SDN-based fog computing architecture for routing in fog-enabled IoT platforms where fog controllers take actions locally for frequent events while the cloud controller takes actions globally for rare events. The proposed framework is evaluated by varying the number of controllers. The initial results show that the proposed hierarchical SDN-based framework has the potential to reduce routing delay and data transmission overhead. Also, throughput is increased as the number of controllers increases.

Real-time heterogeneous stream processing with NaNet in the NA62 experiment

The use of GPUs to implement general purpose computational tasks, known as GPGPU since fifteen years ago, has reached maturity. Applications take advantage of the parallel architectures of these devices in many different domains.Over the last few years several works have demonstrated the effectiveness of the integration of GPU-based systems in the high level trigger of various HEP experiments. On the other hand, the use of GPUs in the DAQ and low level trigger systems, characterized by stringent real-time constraints, poses several challenges.In order to achieve such a goal we devised NaNet, a FPGA-based PCI-Express Network Interface Card design capable of direct (zero-copy) data transferring with CPU and GPU (GPUDirect) while online processing incoming and outgoing data streams. The board provides as well support for multiple link technologies (1/10/40GbE and custom ones).The validity of our approach has been tested in the context of the NA62 CERN experiment, harvesting the computing power of last generation NVIDIA Pascal GPUs and of the FPGA hosted by NaNet to build in real-time refined physics-related primitives for the RICH detector (i.e. the Cerenkov rings parameters) that enable the building of more stringent conditions for data selection in the low level trigger.

Aplikasi E-Office Berbasis Web pada STMIK Indonesia Padang

This study aims to create an E-Office application program that can perform data processing of incoming mail and outgoing mail STMIK Indonesia Padang and can provide solutions to problems processing data systems incoming mail and outgoing mail is still done manually. With this application processing of incoming and outgoing mail data becomes automatic such as reports and disposition letter. The proposed application can simplify the processing, searching, and displaying the attachments of the incoming and outgoing mail data required. E-Office application on STMIK Indonesia Padang is made by using PHP 5.0 programming language supported by MySQL database and System Development Life Cycle (SDLC) design. With E-Office Application, data and attachment of incoming and outgoing mail at STMIK Indonesia Padang can be processed with a relatively short time and the report produced more accurate.

Online learning in optical tomography: a stochastic approach

We study the inverse problem of radiative transfer equation (RTE) using stochastic gradient descent method (SGD) in this paper. Mathematically, optical tomography amounts to recovering the optical parameters in RTE using the incoming–outgoing pair of light intensity. We formulate it as a PDE-constraint optimization problem, where the mismatch of computed and measured outgoing data is minimized with same initial data and RTE constraint. The memory and computation cost it requires, however, is typically prohibitive, especially in high dimensional space. Smart iterative solvers that only use partial information in each step is called for thereafter. Stochastic gradient descent method is an online learning algorithm that randomly selects data for minimizing the mismatch. It requires minimum memory and computation, and advances fast, therefore perfectly serves the purpose. In this paper we formulate the problem, in both nonlinear and its linearized setting, apply SGD algorithm and analyze the convergence performance.

Secure On-Chip Communication Architecture for Reconfigurable Multi-Core Systems

Security is becoming the primary concern in today’s embedded systems. Network-on-chip (NoC)-based communication architectures have emerged as an alternative to shared bus mechanism in multi-core system-on-chip (SoC) devices and the increasing number and functionality of processing cores have made such systems vulnerable to security attacks. In this paper, a secure communication architecture has been presented by designing an identity and address verification (IAV) security module, which is embedded in each router at the communication level. IAV module verifies the identity and address range to be accessed by incoming and outgoing data packets in an NoC-based multi-core shared memory architecture. Our IAV module is implemented on an FPGA device for functional verification and evaluated in terms of its area and power consumption overhead. For FPGA-based systems, the IAV module can be reconfigured at run-time through partial reconfiguration. In addition, a cycle-accurate simulation is carried out to analyze the performance and total network energy consumption overhead for different network configurations. The proposed IAV module has presented reduced area and power consumption overhead when compared with similar existing solutions.

Optimal Energy and Data Routing in Networks With Energy Cooperation

We consider the delay minimization problem in an energy harvesting communication network with energy cooperation. In this network, nodes harvest energy from nature for use in data transmission, and may transfer a portion of their harvested energies to neighboring nodes through energy cooperation. For fixed data and energy routing topologies, we determine the optimum data rates, transmit powers and energy transfers, subject to flow and energy conservation constraints, in order to minimize the network delay. We start with a simplified problem with fixed data flows and optimize energy management at each node for the case of a single energy harvest per node. This is tantamount to distributing each node's available energy over its outgoing data links and energy transfers to neighboring nodes. For this case, with no energy cooperation, we show that each node should allocate more power to links with more noise and/or more data flow. In addition, when there is energy cooperation, our numerical results indicate that, energy is routed from nodes with lower data loads to nodes with higher data loads. We extend this setting to the case of multiple energy harvests per node over time. In this case, we optimize each node's energy management over its outgoing data links and its energy transfers to neighboring nodes, over multiple time slots. For this case, with no energy cooperation, we show that, for any given node, the sum of powers on the outgoing links is equal to the single-link optimal power over time. Finally, we consider the problem of joint flow control and energy management for the entire network. We determine the necessary conditions for joint optimality of a power control, energy transfer and routing policy. We provide an iterative algorithm that updates the data and energy flows, and power distribution over outgoing data links. We show convergence to a Pareto-optimal operating point.

Measuring QoS in an Aeronautical Opportunistic Network Architecture with Limited Access to a Satellite Communications Backhaul

We measure quality of service (QoS) in a wireless network architecture of transoceanic aircraft. A distinguishing characteristic of the network scheme we analyze is that it mixes the concept of Delay Tolerant Networking (DTN) through the exploitation of opportunistic contacts, together with direct satellite access in a limited number of the nodes. We provide a graph sparsification technique for deriving a network model that satisfies the key properties of a real aeronautical opportunistic network while enabling scalable simulation. This reduced model allows us to analyze the impact regarding QoS of introducing Internet-like traffic in the form of outgoing data from passengers. Promoting QoS in DTNs is usually really challenging due to their long delays and scarce resources. The availability of satellite communication links offers a chance to provide an improved degree of service regarding a pure opportunistic approach, and therefore it needs to be properly measured and quantified. Our analysis focuses on several QoS indicators such as delivery time, delivery ratio, and bandwidth allocation fairness. Obtained results show significant improvements in all metric indicators regarding QoS, not usually achievable on the field of DTNs.

An Effective Network Traffic Data Control Using Improved Apriori Rule Mining

The increasing usage of internet requires a significant system for effective communication. To pro- vide an effective communication for the internet users, based on nature of their queries, shortest routing path is usually preferred for data forwarding. But when more number of data chooses the same path, in that case, bottleneck occurs in the traffic this leads to data loss or provides irrelevant data to the users. In this paper, a Rule Based System using Improved Apriori (RBS-IA) rule mining framework is proposed for effective monitoring of traffic occurrence over the network and control the network traffic. RBS-IA framework integrates both the traffic control and decision making system to enhance the usage of internet trendier. At first, the network traffic data are ana- lyzed and the incoming and outgoing data information is processed using apriori rule mining algorithm. After generating the set of rules, the network traffic condition is analyzed. Based on the traffic conditions, the decision rule framework is introduced which derives and assigns the set of suitable rules to the appropriate states of the network. The decision rule framework improves the effectiveness of network traffic control by updating the traffic condition states for identifying the relevant route path for packet data transmission. Experimental evaluation is conducted by extrac- ting the Dodgers loop sensor data set from UCI repository to detect the effectiveness of theproposed Rule Based System using Improved Apriori (RBS-IA) rule mining framework. Performance evaluation shows that the proposed RBS-IA rule mining framework provides significant improvement in managing the network traffic control scheme. RBS-IA rule mining framework is evaluated over the factors such as accuracy of the decision being obtained, interestingness measure and execution time.

Say “GDNT”: frequency of adolescent texting at night

ObjectiveElectronic media use is pervasive among adolescents. However, prior studies of media use have not specifically focused on texting behavior, and current estimates of teen texting—a primary form of communication among adolescents—are based on teens' self-reported use. Evaluating the frequency of nighttime texting is crucial, given evidence that such behaviors may contribute to epidemic levels of insufficient sleep among adolescents. MethodsDescriptive analysis of objectively recorded outgoing text message data in a sample of adolescents (n = 43; mean = 16.06, SD = 1.29 years of age; 63% females). ResultsThe current study found that texting behavior was ubiquitous in the pre-bedtime period with 98% of adolescents sending at least 1 text after 8:00 pm. Texting was also very prevalent at night: 70% of participating teens sent at least 1 text between 10:00 pm and 5:59 am. ConclusionsThese findings add to a growing body of literature highlighting the potential role of mobile electronic devices in adolescent sleep disturbances.

Cauchy horizon stability and mass inflation with a cosmological constant

Motivated by the strong cosmic censorship conjecture, we consider the Einstein- Maxwell-scalar field system with a cosmological constant Λ (of any sign), under spherical symmetry, for characteristic initial conditions, with outgoing data prescribed by a (complete) subextremalReissner-Nordstrom black hole event horizon. We study the structure of the future maximal (globally hyperbolic) development, analyze the mass inflation scenarios, identifying, in particular, large choices of parameters for which the Hawking mass remains bounded, and study the existence of regular extensions. We also discuss why our results, although valid for all signs of Λ, only provide evidence for the failure of strong cosmic censorship in the case of a positive cosmological constant.

Implementation of Switching System for High Speed Data Transmission using VHDL

Switching system is used for data transmission between two communicating Channels. This transmission can be done via trunks or it can be fully wireless, technically termed as Telephone Switching and Mobile switching, respectively. The implementation of the switching system using VHSIC hardware description language is more reliable and efficient than the previous switching system (1). It converts entire bulky switching unit which consists of routers, multiplexers, decoders, counters in to a single integrated circuit . Simulation results are presented for transfer of data from input subscriber to the output subscriber using sequential write / random read mode with the timing diagram(2). To verify the transfer of data from input subscriber to the output subscriber a 32 bit op-code is assumed in which each bit represents a specific function. In our Paper we have worked on Switching System for two different channels using VHDL, each channel have 16 users. They can communicate either intra channel or inter channel. We are also providing Caller ID facility. The incoming data through the inlets are written into the data memory and later read out to the appropriate outlets. The incoming and outgoing data are usually in serial form whereas the data are written into and read out of the memory in parallel form. That's why it is necessary to perform serial to parallel conversion and parallel to serial conversion at the inlets and outlets respectively. We have selected 32 bit op-code for communication among these channels because its ability to define all the functions. This 32 bit op-code is responsible for caller id and transmission and reception of particular data. I have implemented my work with the help of Xilinx ISE and Modelsim 10.2a.

Joint Transmission Rate Control and Opportunistic Network Coding Over Wireless Networks

Existing opportunistic network coding architectures (e.g., COPE) rely on pseudobroadcast to deliver a coded packet to multiple receivers in a single transmission. Only the primary receiver acknowledges the reception by MAC-layer acknowledgements (synchronous ACKs) and the other receivers receive the coded packet by overhearing and acknowledge the reception by asynchronous ACKs, which are usually piggybacked in outgoing data packets. In realistic wireless networks, this mechanism may cause unnecessary retransmissions if asynchronous ACKs are dropped due to packet losses or arrive late and thus compromise the throughput gain brought by network coding. In this paper, we propose a framework of joint rate control and code selection (ORC) to address this issue, aiming at improving the performance gain of opportunistic network coding in wireless networks. The framework of ORC consists of two mechanisms: (1) Rate control: the optimal transmission rate for coded packets is selected by formulating the rate control process as a Finite Horizon Markov Decision Process. (2) Code selection: based on the results of rate selection, the packet combination for forming the coded packet is determined. Numerical results show that ORC can substantially improve the performance gain of opportunistic network coding compared with COPE.

All-to-All Communication in Random Regular Directed Graphs

We consider networks formed by the union of $M$ random $1$ -regular directed graphs. These graphs are also called permutation models in the literature. We first present a proof showing that the expansion factor of such graphs is greater than or equal to $\log\; N$ a.a.s when $M> 4\;\log\; N,$ where $N$ is the number of nodes in the network. The reason for considering such random graph models is their applicability in the design of peer-to-peer networks and data center networks of switches. Assuming that each node in the network has upload and download capacities greater than $8\; \log\; N,$ we also show that the above result implies that all-to-all communication is possible in such a network, if the total incoming data rate and the total outgoing data rate at each node are both less than or equal to $1.$

Моделювання консолідованого інформаційного ресурсу для комунікативної взаємодії користувачів веб-сторінки кафедри

Розглянуто питання створення консолідованого інформаційного ресурсу як комунікативної ланки для взаємодії зі вступниками та випускниками кафедри. Визначено мету розроблення, очікувані ефекти від створення веб-форуму, вхідні та вихідні дані ресурсу. Проведено системний аналіз об’єкта дослідження, створено діаграму потоків даних і діаграму «сутність-зв’язок».

Reputation as Public Policy for Internet Security

Insufficient resource allocation causes an Internet information security (infosec) problem that public policy could improve. Lack of transparency lets organizations avoid ad- dressing internal risks, leaving vulnerabilities that are exploited by botnets, threatening information security of other Internet participants. Their protection provides no economic benefit to the firm, so this negative externality causes underinvestment in infosec. Public policy could provide a partial solution by adding incentives for organizations to have well-configured in- fosec. Specifically, mandatory reporting of security issues plus presenting this information to the public, can impose shame and fame on organizations through publicity and peer influence by comparison with major competitors. Outbound spam is a prominent symptom of poor infosec that this project uses as a proxy for overall security, mapping anti-spam blocklist IP addresses to organizations (1). Selected top outbound spam rankings publicized through SpamRankings.net have already produced positive pilot test results. Next we use field experiments to test the effects of information disclosure and the relative effectiveness of different information presentations. As the first of two objectives, we determine whether public ranking of spam can be an effective mechanism for encouraging firms to reduce outbound spam. Second, we explore the most effective ways of presenting information to the public to improve infosec. Our study serves as an assessment for the public policy of mandatory information disclosure. We use field experiments to aggregate company information within and between industries and analyze the results of presenting such information to the pub- lic. Field experiments have been used extensively in the analysis of public policy programs (2) (3). The experiments include design of an information system for public information disclosure and presentation to get public attention, to observe reactions, and to analyze the underlying mechanisms. This information system design can be extended to other problems to provide incentives for the decision makers of externality problems, such as pollution, energy saving, etc. A public information system enables inferring internal infosec based on observed outcome, and thus makes such information transparent and induces reputation for the decision makers: shame for producing negative externalities or fame for fixing or preventing them. Reputation internalizes externalities, encouraging decision makers to take socially optimal behavior. Because of the positive pilot test results, we propose conducting a full-scale randomized controlled trial based on the Spam- Rankings.net initiative. The purpose of a randomized controlled trial is to experimentally create individual research groups that are generally similar except that the groups receive different experimental treatments. So any differences that arise between the research groups subsequent to the treatments are due to the respective treatment. Randomized experiments thus avoid selection bias, producing high internal validity. For two full-scale experiments, we will identify a sample of companies by geographic units for which we have outgoing spam data, and randomly assign the companies by geographic unit to different groups. In the first experiment, we will randomly assign the companies to one of two groups: a treatment group whose spam statistics will be widely publicized and a control group without publicizing any spam information. This initial evaluation can examine whether the proposed policy can induce firms to reduce spam. Assuming success of the first experiment, the second will explore the most effective policy intervention, by randomly assigning company groups to different information presentations including absolute spam volume, ranking per country, and ranking per industry, to see what granularity of peer comparison has the most effect. This is the first publication of the details and the behavioral economics context of these experiments. Supported by NSF grant no. 0831338; the usual disclaimers apply.

A Delay-Aware Network Structure for Wireless Sensor Networks With In-Network Data Fusion

A wireless sensor network (WSN) comprises a large number of wireless sensor nodes. Wireless sensor nodes are battery-powered devices with limited processing and transmission power. Therefore, energy consumption is a critical issue in system designs of WSNs. In-network data fusion and clustering have been shown to be effective techniques in reducing energy consumption in WSNs. However, clustering can introduce bottlenecks to a network, which causes extra delays in a data aggregation process. The problem will be more severe when in-network data fusion does not yield any size reduction in outgoing data. Such problems can be greatly alleviated by modifying the network structure. In this paper, a delay-aware network structure for WSNs with in-network data fusion is proposed. The proposed structure organizes sensor nodes into clusters of different sizes so that each cluster can communicate with the fusion center in an interleaved manner. An optimization process is proposed to optimize intra-cluster communication distance. Simulation results show that, when compared with other existing aggregation structures, the proposed network structure can reduce delays in data aggregation processes and keep the total energy consumption at low levels provided that data are only partially fusible.

High Performance Computing on Fast Lock Delay Locked Loop with Low Power State and Simultanoeus Switching Noise Reduction

Problem statement: In any multimedia processor, controller may consume most of the on- chip memory resources. The memory requirement is directly depends on algorithm shared by different blocks, so leads to failure in the system models. Approach: This study presents the implementation of DLL unit used for memory optimization. Various aspects of the underlying coarse lock detector are explored and modifications are made with software r eference implementation. The whole system is implemented in 0.18 µm CMOS technology, where an input reference clock to an outgoing data clock monitors and true locking is initialized with 50% d uty cycle correction. Results: From the measurement result of DLL operation, the output clo ck jitter is analyzed. Power consumption of DLL including large size output buffer is about few mW. Conclusion: The great challenge in this implementation is communication bandwidth, has brought to process variation and power state reduction techniques. In addition, inefficiency of computing capacity and simultaneous switching noise is reduced in the real time applications.

A Multi-Dimensional approach towards Intrusion Detection System

this paper, we suggest a multi-dimensional approach towards intrusion detection. Network and system usage parameters like source and destination IP addresses; source and destination ports; incoming and outgoing network traffic data rate and number of CPU cycles per request are divided into multiple dimensions. Rather than analyzing raw bytes of data corresponding to the values of the network parameters, a mature function is inferred during the training phase for each dimension. This mature function takes a dimension value as an input and returns a value that represents the level of abnormality in the system usage with respect to that dimension. This mature function is referred to as Individual Anomaly Indicator. Individual Anomaly Indicators recorded for each of the dimensions are then used to generate a Global Anomaly Indicator, a function with n variables (n is the number of dimensions) that provides the Global Anomaly Factor, an indicator of anomaly in the system usage based on all the dimensions considered together. The Global Anomaly Indicator inferred during the training phase is then used to detect anomaly in the network traffic during the detection phase. Network traffic data encountered during the detection phase is fed back to the system to improve the maturity of the Individual Anomaly Indicators and hence the Global Anomaly Indicator.

Needs and Capabilities towards the Development of Web Services

This study aims to develop a web service based on the priority needs of SSC faculty and students of SSC SGS. This made use of survey and interview to gather data from randomly selected 81 faculty members of the four campuses of the College and 96 students of SSC SGS. Results revealed that both faculty and student respondents of the four campuses of the College were familiar with the internet surfing. Further, it showed that online enrolment ranked number one priority web service by the two groups of respondents. As to training needs the first priority of the faculty is training on web interactivity while the students’ priority is online thesis advising. The developed web service allows processing the incoming and outgoing data such as online enrolment and evaluation of grades. Users’ data such as profile and other sensitive is being secured through encryption and decryption process before and after they are saved in the designated databases. All students in the SGS have their own credentials before they could access their data for evaluation of grades and during the enrollment process. However, payment of tuition fees and the like had not been included in the development due to issue on accounting rules and regulations. Keywords - web services, internet surfing, web interactivity, encryption process

2004 Venezuelan Presidential Recall Referendum (2004 PRR): A Statistical Analysis from the Point of View of Electronic Voting Data Transmissions

Statistical comparisons of electoral variables are made between groups of electronic voting machines and voting centers classified by types of transmissions according to the volume of traffic in incoming and outgoing data of machines from and toward the National Electoral Council (CNE) totalizing servers. One unexpectedly finds two types of behavior in wire telephony data transmissions and only one type where cellular telephony is employed, contravening any reasonable electoral normative. Differentiation in data transmissions arise when comparing number of incoming and outgoing data bytes per machine against total number of votes per machine reported officially by the CNE. The respective distributions of electoral variables for each type of transmission show that the groups classified by it do not correspond to random sets of the electoral universe. In particular, the distributions for the NO percentage of votes per machine differ statistically across groups. The presidential elections of 1998, 2000 and the 2004 Presidential Recall Referendum (2004 PRR) are compared according to the type of transmissions in 2004 PRR. Statistically, the difference between the empirical distributions of the 2004 PRR NO results and the 2000 Chavez votes results by voting centers is not significant.