The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
MapReduce has become a prevalent programming model for building data processing applications in the cloud. While being widely used, existing MapReduce schedulers still suffer from an issue known as partitioning skew, where the output of map tasks is unevenly distributed among reduce tasks. Existing solutions follow a similar principle that repartitions workload among reduce tasks. However, those approaches...
In recent years, many companies are embracing the Hadoop MapReduce system for large-data processing with completion time constrains. However, exiting Hadoop schedulers still suffer from the reducer load imbalancing problem. In this paper, we present a novel run-time load balancing method for MapReduce. Our approach predicts the workload of each reduce task at run-time, and assigns the reduce tasks...
High performance computing (HPC) has witnessed a great boom of computing capability in recent years, however storage capacity fails to keep pace with that rapid growth, coun-teracting the benefits brought by higher computing power. Two dominating bottlenecks have been pointed out: firstly, Small-size IO requests fail to leverage the advantage of current distributed file systems and non-contiguous...
MapReduce has become a popular model for large-scale data processing in recent years. However, existing MapRe-duce schedulers still suffer from an issue known as partitioning skew, where the output of map tasks is unevenly distributed among reduce tasks. In this paper, we present DREAMS, a framework that provides run-time partitioning skew mitigation. Unlike previous approaches that try to balance...
In the recent few years, Software Defined Network (SDN) brings a revolution to network technology. Comparing with the traditional techniques, SDN has several distinguished features, including fine-grained flows management, global view of the network and centralized control, etc. Since SpaceWire is becoming a standard for high-speed links and networks for use onboard spacecraft, we argue that adopting...
A modern data center may host tens of thousands of machines, mixing with hundreds of thousands flows. Large number of flows concurrently traverse in a data center network may frequently cause traffic burst and unbalance, which may further induce congestion, packet losing, and therefore low efficiency. Generally speaking, there are three large families of scheduling algorithms to address this problem:...
Automatic address configuration is a key problem in data center networks. For performance and routing considerations, most of the recently proposed data center structures are well-structured. Their node addresses are usually dependent on node locations, making the traditional automatic address configuration schemes such as DHCP infeasible. Recently, some new solutions have been proposed. Both the...
Nowadays Internet-scale data centers are facing a severe issue, huge energy consumption, which not only increases operational cost, but also causes environment problem. For data center providers, putting power constraint on a data center may be a feasible way to keep energy consumption within an acceptable range. Hence it is commonly believed that, for a given power budget, maximizing the performance...
By allowing the mixture of information at the source and intermediate nodes, network coding benefits network protocols with increased throughput and higher reliability. However, such mixture makes network coding systems suffering pollution attacks, in which malicious nodes inject corrupted packets into the information flow. Previous solutions are either computationally expensive or too ineffective...
Network coding has emerged as a promising technology to increase network capacity and robustness of ubiquitous networks. However, network coding systems are vulnerable to pollution attacks. In this paper, we propose adapkeys, an adaptive security scheme in network coding allowing participating nodes to rapidly detect corrupted packets generated from pollution attackers. Our work is an innovative adaptive...
In DTN, a small amount of selfish nodes occupy the storage of specific key nodes with stronger transfer capacity in hot spot region which greatly consumes the limited network storage resource. This causes congestion and reduces the successful delivery ratio of messages from other nodes. This paper adopts pigeonhole principle and power in combinatorics to define node's responsibility range of message...
Flight landing optimization at the terminal area is an ongoing challenge for air traffic controllers. The current schedule scheme is first-come-first-served (FCFS). There are studies focusing on how to minimize the total cost or maximize the throughput. These schemes are short of fairness consideration. In this paper, we start from a real recent example to show that a lack of consideration of long-term...
Due to the limitation of DTN resource and intermittent connection, it's challenging to design a mechanism which achieves high message delivery successful ratio and control congestion to satisfy the demand. In this paper, a novel DTN congestion control routing mechanism, Ant Colony Optimization(ACO) for DTN congestion control algorithm(ADC) is proposed. In the message delivery, this mechanism can actively...
Due to the limited resources and intermittent connectivity of Delay-Tolerant Networks (DTNs), it is a challenging task to design an efficient congestion control method to meet the application requirements. In this paper, a new DTN congestion control method called following routing(FR) is proposed. In the method, when the transit node is about to be congested, current node will follow the route of...
When congestion happens at the node of DTN, the regular approach is to delete the old message of these nodes in order to make memory space for the new arrival message to remove congestion. A new method for the selection of message to delete, congestion control routing algorithm based on Simulated Annealing and regional movement (SARM) are proposed in this paper. This mechanism is under the premise...
In this paper, the recent research on secure transmission of network coding in wireless networks is reviewed. Security risks have become a major problem to the development of wireless networks, and network coding is the development trend of next generation secure networks. Firstly, the brief concept of network coding is introduced. Secondly, up to date related research on secure network coding in...
Based on the analysis of 802.11 link-layer handoff and representative cross-layer mechanisms supporting mobility, this paper proposes a Locator/Identifier Split Network Based Cross-Layer Roaming Mechanism (LISN-CLRM) with the Layer 2 and Layer 3 handoff coupling organically. Theoretical analysis shows that the total delay of this mechanism is much smaller than MIPv6, and is 77.5 ms smaller than SMOS[1]...
Computer electromagnetic radiation Trojan arouses concern gradually due to its particularity in route of transmission. Currently, technologies for preventing electromagnetic radiation are mainly divided into two types of software and hardware. Hardware has a high cost and limited range of application, while most of current software protection mechanism is in theoretical research stage with quite complex...
In wireless local area networks (WLANs), there could be several available access points (APs) around a Station (STA). How to select the most appropriate AP among those available APs has become a hot research topic. The conventional selection policy, which selects one AP with the best RSSI, makes the loads among APs be distributed unevenly and degrades resource utilization rate. Recently, several AP...
Mobility Model has drawn more and more attentions since its important role in Delay/Disruption Tolerant Networks (DTNs) routing protocol performance evaluation. In this paper, we first present a survey of various mobility models, and then analyze the movement characteristics in the disaster rescue scenario in detail. After that, we introduce a novel mobility model, the Random Way Point with Attraction...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.