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.
Minimizing the flow completion times (FCTs), especially for the short flows, is widely deemed an important optimization goal in designing data center networks, while flow scheduling strategies play great role in achieving this target. Existing optimal scheduling algorithms severely depend on the prior knowledge of flow size, which is hard to implement in practice. Therefore, it is necessary to estimate...
Improving the performance of network traffic in shuffle phase is important to improve the performance of MapReduce. The goal of enhancement of network traffic is achieved by using partition and aggregation. According to traditional method a hash function is used to partition intermediate data among reduce tasks but the traditional function is not efficient to handle network traffic. A novel intermediate...
Currently, service characteristic is rarely considered in service processing for the optical network. In this paper, we introduce a novel service-basedscheme which will buffer and schedule services to optimize the blocking performance of flexi-grid optical network based on Software Defined Network (SDN). This scheme gives sufficient consideration to the diversity of services in SDN network. Besides,...
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:...
In next generation mobile communication systems, the cell size reduction is unavoidable due to the transmission power limitation at user equipments (UEs). The small cell size accelerates traffic non-uniformity between cells, and this situation brings non-uniform transmission performance between cells across the system. The inter-cell carrier aggregation (CA) technique, which aggregates multiple component...
Today, running applications on embedded systems demand more computation to satisfy requirements such as performance and power consumption. Multiprocessor systems on chip (MPSoC) provide practical solution by having significant effect on throughput‥ We can employ application-specific instruction set processor (ASIP) concept to customize each processor in MPSoC platform based on the application mapped...
In this paper, a novel semi-static inter-cell interference coordination scheme based on spectrum pool is proposed for cellular OFDMA systems. In the proposed scheme, the spectrum is divided into three partitions, called major subbands group, minor subbands group and spectrum pool group. The major subbands and the spectrum pool are used by all users in a cell and the minor subbands only can be used...
There are kinds of Internet applications such as VoIP, online gaming and video Conferencing which need quality of service guarantees making the performance analysis critical, and the traffic of such applications usually exhibits the properties of self-similarity and heavy tail. In this paper, we use the generalized Stochastically Bounded Burstiness model to characterize the network traffic with self-similar...
In this present work, we propose a scheduling approch for heterougeneous traffic over network. The proposed scheduling not only satiesfies the QoS requirements of the real time flows (class-1) but also continues providing best effort service to non real time flows (class-2). Many scheduling techniques have been proposed to respond to the temporal requirements of real-time jobs (flows). The technique...
Carrier Aggregation (CA) is one of the important technologies to further improve the capacity of Long Term Evolution Advanced (LTE-A). When CA is conducted, a User Equipment (UE) will firstly select a Primary Serving Cell (PCell) for mobility support and then add Secondary Serving Cells (SCell) for higher experienced data rate. When and how to add/remove SCell is a very important issue, especially...
We describe here a new burst scheduling algorithm to avoid burst overlapping in the egress router of optical burst switching (OBS) network, and hence to improve the quality of service (QoS) in developing several optical networks to fulfill the increasing demand of Internet facilities. We consider TAG (tell-and-go) protocol where many lightpaths pass in a given link and burst overlap may occur. In...
Qos provision is considered as the complex task due to the heterogeneous nature, diverse QoS requirements of emergent different applications. With the advent of high bandwidth 3G/4G technologies, like LTE, LTE-advanced, the necessity of QoS provision becomes even crucial. Uplink scheduling with QoS provision is considered here. The contribution of this work is uplink packet scheduling scheme maintaining...
In this paper Dynamic Sleep Scheduling (DSS) for Minimizing Delay in Wireless Sensor Network is proposed. To reduce delay, DSS identifies nodes for different sleep/wake according to their traffic load at two levels: a) Nodes with different sleep/wake schedule requirement according to their different traffic load based on their topological importance in the network. b) Nodes with different sleep/wake...
In this paper we analyze the performance of advanced OFDM packet scheduling techniques based on 3GPP UTRAN Long Term Evolution (LTE) framework for high velocity scenarios. Based on our previous investigations in system performance analysis, we demonstrate that packet scheduler being part of the whole radio resource management (RRM) process has a major impact on it. On the other hand high user velocities...
Multiple-Input Multiple-Output (MIMO) communications have shown great promise in providing high spectral efficiency for wireless ad hoc networks. In this paper we study the problem of joint routing, scheduling, power control and bit rate selection in MIMO-based ad hoc network with the goal of maximizing the system throughput that satisfies a given end-to-end traffic demand. We formulate this cross-layer...
Offering throughput guarantees for cellular wireless networks, carrying real-time traffic, is of interest to both the network operators and the customers. Furthermore, to be able to quantify the soft throughput guarantees for a certain scheduling algorithm without conducting experimental investigations, is valuable for network providers. In this paper, we develop an expression for the approximate...
A Framework for Integrated Routing, Scheduling and Traffic Management (FIRST) in Ad Hoc Networks is introduced. Unicast and multicast routes are established in coordination with the scheduling of transmissions and bandwidth reservations in a way that bandwidth and delay guarantees can be enforced on a per-hop and end-to-end basis. Results from detailed simulation experiments show that, compared to...
We address the optimal sink scheduling problem in wireless sensor networks (WSNs). The problem is inherently difficult since sink scheduling and data routing are tightly coupled. Previous approaches either have questionable performance due to no joint considerations, or are based on relaxed constraints. Our aim is to fill in this blank in the research. First, by discretizing continuous time, we develop...
We study the privacy compromise due to a queuing side channel which arises when a resource is shared between two users in the context of packet networks. The adversary tries to learn about the legitimate users activities by sending a small but frequent probe stream to the shared resource (e.g., a router). We show that for current frequently used scheduling policies, the waiting time of the adversary...
Uplink scheduling for relay stations in mobile multi-hop relay network has not been widely addressed in the literature under common belief that downlink traffic overwhelms uplink traffic. Recently, data traffic from user created content (UCC) is rapidly growing with a potential to create a huge amount of uplink (UL) traffic. Overlapped resource allocation in uplink transmission allows MSs attached...
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.