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.
The limitation of bandwidth resource in a wireless network has driven a large amount of work in resource scheduling to better utilize the available bandwidth. Most of these work aim to maximize the throughput by considering a uniform user distribution across the cellular network. In reality, users may be distributed non-uniformly. This work studies the effects of nonuniform user distribution on throughput...
Inter-Cell Interference Coordination (ICIC) techniques are proposed as solutions to alleviate the negative impact of interference on system performance, while enhancing the provided Quality of Service (QoS). Typically, the available bandwidth is divided into inner and edge sub-bands. Users are also classified into interior and edge users. The available resources in each zone are exclusively allocated...
In the paper, we studied the solution of resource allocation problem with Coordinated Multi-Point(CoMP) in heterogeneous wireless networks. The utilization of CoMP technology enhances channel quality of users at the edge of cells, but it also brings more complexity to resource management of the network. To reduce this pressure, we exploited a feedback-based method to determine the allocation of users...
Most applications running on supercomputers achieve only a fraction of a system's peak performance. It has been demonstrated that the co-scheduling of applications can improve the overall system utilization. However, following this approach, applications need to fulfill certain criteria such that the mutual slowdown is kept at a minimum. In this paper, we present an HPC scheduler that applies co-scheduling...
The exponential growth of available data has increased the need for interactive exploratory analysis. Dataset can no longer be understood through manual crawling and simple statistics. In Geographical Information Systems (GIS), the dataset is often composed of events localized in space and time; and visualizing such a dataset involves building a map of where the events occurred.We focus in this paper...
With the maturity and proliferation of Software-Defined Networking (SDN), there has been an increasing number of network deployments that provide dedicated connections through on-demand and in- advance scheduling in support of data-intensive applications for global scientific collaboration. In such dedicated network environments, bandwidth scheduling serves as a key technique to improve the utilization...
Network coding has shown the promise of significance throughput improvement. In this paper, we study the throughput of two-hop wireless network coding and explore how the maxi-mum throughput can be achieved under a random medium access scheme. In this paper, the problem of the performance of COPE type network coding under dual source coding architecture is solved. An Embedded Markov Chain Model for...
Coflow scheduling without prior knowledge has been proposed recently. However, the previous solution, Aalo, has two problems: it does not explicitly control the flow rate; it assumes the network is ideally non-blocking (with perfect traffic balancing and no oversubscription). In this paper, we show the performance loss caused by the above two problems. We propose EAalo to cope with the problems. It...
The control packets in the Data Center Networks (DCNs) have to contest with the data packets although they are usually much shorter in size and much more important in network management. Moreover, the uneven distribution of the packets may create potential hotspots in the DCN which could degrade network performance drastically. To bridge these gaps, a few proposals have been put forward to construct...
This paper proposes a fully distributed scheduling algorithm to process MapReduce data-intensive applications across geo-distributed clusters in federated clouds. The proposed algorithm, called FedSCD, takes advantage of data locality while reducing both VM cost and data transfer cost (between clusters) subject to Deadline constraint. This work is compared to conventional partially distributed scheduling...
Imprecise input data imposes special challenges to workflow scheduling. This paper introduces a robust scheduler based on particle swarm optimisation, called RobWE, which considers uncertainties of available bandwidth when producing schedules for workflow ensembles. The proposed scheduler is also a flexible scheduler since it allows the replacement of its objective function according to the user's...
Existing coflow scheduling frameworks effectively shorten communication time and completion time of cluster applications. However, existing frameworks only consider available bandwidth on hosts and overlook congestion in the network when making scheduling decisions. Through extensive simulations using the realistic workload probability distribution from Facebook, we observe the performance degradation...
The emerging deployment of geographically distributed data centers (DCs) incurs a significant amount of data transfers over the Internet. Such transfers are typically charged by Internet Service Providers (ISPs) with the widely adopted q-th percentile charging model. In such charging model, the time slots with top 100-q percent of data transmission do not affect the total transmission cost, and can...
Erasure-coded storage systems have gained considerable adoption recently since they can provide the same level of reliability with significantly lower storage overhead compared to replicated systems. However, background traffic of such systems - e.g. repair, rebalance, backup and recovery traffic - often has large volume and consumes significant network resources. Independently scheduling such tasks...
Data transfer duration accounts for a great proportion of job completion time in big-data systems. To reduce the time spent on data transfer, some traffic scheduling mechanisms at coflow-level are proposed recently. Most of them abstract datacenter networks as an ideal non-blocking big-switch, and the bottleneck is located at egress or ingress ports of end-hosts instead of in networks. Thus, they...
Software-Define Datacenter networks (SDDCs) are constantly changing due to various network update events. A set of involved flows of each update event should be migrated to the feasible paths without congestion. To tackle a single update event, prior methods find and execute a migration sequence so as to transform the initial traffic distribution to the final traffic distribution. However, when handling...
An increasing number of high-performance networks are built over the existing IP network infrastructure to provision dedicated channels for big data transfer. The links in these overlay networks correspond to underlying paths and may share lower-level link segments. We consider a model of overlay networks that incorporates correlated link capacities and linear capacity constraints (LCCs) to formulate...
Today's extreme-scale science applications involve the processing of bandwidth-intensive scientific workflows consisting of several inter-dependent tasks executing on heterogeneous clusters of computational resources and storage resources, which are interconnected by high-speed networks. An important challenge in such applications is the joint scheduling of computational, storage, and network resources...
High throughput satellites have proven to be an excellent solution to provide Internet services to white spots or to complement other existing infrastructures. With the use of multi-beam antennas, the same frequency may be reused dozens of times across a single satellite coverage area, increasing the system capacity and profitability. Legacy frequency reuse patterns such as uncoordinated 4-color scheme...
In this paper, we address cloud VoIP scheduling strategies to provide appropriate levels of quality of service to users, and cost to VoIP service providers. This bi-objective focus is reasonable and representative for real installations and applications. We conduct comprehensive simulation on real data of twenty three on-line non-clairvoyant scheduling strategies with fixed threshold of utilization...
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.