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.
In this paper, we propose an uplink resources allocation strategy for Long Term Evolution (LTE) systems. In time domain, the scheduler aims at ensuring more fairness by using a metric updated every new uplink transmission round, giving higher priority to users who are the farthest from their minimum QoS requirements. Then, resources are allocated in a way to achieve the required rate with the minimum...
Scheduling protocols that provide both rate and fairness guarantees, such as Weighted Fair Queuing, distribute the unused capacity among the flows in proportion to the reserved rate of the flows. Thus, flows whose reserved rate is the largest will receive a larger share of the unused capacity. We present a scheduling algorithm that first distributes unused capacity to those flows whose reserved rate...
In this paper, we propose a scheduling algorithm for mobile WiMAX networks that distributes dynamically the bandwidth among service flows while giving real-time packets more chances to satisfy their QoS requirements. The scheduling in the proposed algorithm is assisted by the subscriber stations, hence requiring two-schedulers, a scheduler at the BS and another one at the SS, where preemption is applied...
Long term evolution (LTE) is the next generation wireless system. There are not many researches for LTE downlink scheduling. It uses orthogonal frequency division multiple access (OFDMA) in downlink. Until now, the goal for the LTE scheduler is achieving the system highest performance, but it will cause to lower priority connection delay or starvation under limited bandwidth resources. Therefore,...
3G Long Term Evolution (LTE) is an all internet protocol (IP) based network and one of its main aims is to improve mobile multimedia services. This is achieved through streamlining the system for packet services. This leads to improvements in the form of higher bit rates, lower latencies, and a variety of service offerings. However, more challenging technical difficulties may be expected to arise...
Scheduling algorithms prove crucial to ensure simultaneous requested services satisfaction per a mobile user in packet access networks. In this paper, we propose a novel Adaptive Chunks Allocation scheme based-QoS-threshold named “ACA-QoSthresh”. Our ACA-QoSthresh scheme consists of three steps: (1) Distribute chunks to mobile users under class of services constraints. A threshold for rtPS-class is...
This paper presents an approach for scheduling U-Life care applications in the cloud computing environment based on virtual resources to support real-time services and to improve user Quality of Service (QoS) requirements. We design and develop an architecture called ULC3 (Ubiquitous Life Care Cloud Computing) that uses virtual resources provided by cloud computing to schedule U-Life care applications...
In ubiquitous services, concurrent requests from various services for limited service resources such as network bandwidth, easily lead to a problem of resource insufficiency. The resource scheduling for ubiquitous services is the key to improve the tradeoff between request admittance, resource utilization and service quality. In this paper, a GA-based approach to resource scheduling to enable a flexible...
This paper proposes an algorithm of bandwidth allocation based on wireless access network 802.16d standard. First distributes the bandwidth in different services then redistributes the bandwidth in different connection of one service. By the test of simulation platform of the IEEE 802.16 using OPNET, the algorithm guarantees time-delay of the real-time polling service and it also satisfies the fairness...
To maximize the utilization of system resources with satisfying diverse quality of service (QoS) requirements, a novel multiple utility factors-based parallel (MUFP) packet scheduling algorithm is proposed for the broadcast base station (BBS) and cell base station (CBS) mixed mode of broadband wireless multimedia (BWM) systems. MUFP takes into consideration QoS requirements, queue dynamics and channel...
The LTE specification provides QoS of multimedia services with fast connectivity, high mobility and security. However, 3GPP specifications have not defined scheduling algorithms to support real time and non-real time application services. In this paper we propose a modified version of M-LWDF and EXP/PF scheduling algorithms based on token mechanism, which provide better performance to real time flows...
Given that statistical multiplexing of video streams is employed in enhanced Multimedia Broadcast/Multicast Service (e-MBMS), we address the issue of scheduling across the streams towards Advanced-Long Term Evolution (LTE-A) system, in order to improve the quality of service (QoS) performances. In this paper, the optimization problem of scheduling and resource allocation for separate streams is first...
As IEEE 802.11 wireless local area network (WLAN) devices currently have gained wide popularity, demands on quality of service (QoS) capability have increased as well. Although IEEE 802.11e is proposed for the support of QoS by traffic and service differentiation, it still has weakness on the adapting the multimedia services which has the traffic characteristic of variable bit rate (VBR). In this...
The end-to-end congestion control in intelligent optical networks(IONs) based on IP layer is studied. The queue scheduling algorithms are used to intelligent optical networks and two queue scheduling algorithms are analyzed and compared. The network's throughput are gotten for different queue scheduling algorithms by simulating different scenes. The scene is about a TCP flow and a no feedback UDP...
Switch is the kernel of Avionics Full Duplex Switched Ethernet (AFDX) network, and its scheduling algorithm affects the switch's performance directly. Employing the Earliest Deadline First (EDF) scheduling method in the switch of AFDX network can overcome the disadvantages of Quality of Service (QoS) for emergent messages. EDF scheduling algorithm assigns a priority level for each arriving message,...
For advanced per-flow service disciplines at high-speed network links, it is essential to maintain priority queues in sorted order. The scalable priority queue implementation requires managing a large number of queues at ever increasing line speeds. In this paper, we propose novel solutions to the management of priority queues using a previously proposed pipelined Counting Priority Index (pCPI) structure...
QoS sensitive applications have become increasingly popular. This paper presents end-to-end QoS control techniques to improve the network usage factor and the destination buffer utilization of the application. The data scheduling process of the QoS sensitive applications has been described. An analytical modeling of QoS performance has been put forward. End-to-end QoS evaluation metrics have been...
Packet loss control is an essential issue for video transportation over Internet. Buffer management is a traditional network technique to protecting video data against packet loss. To meet the need of quality of service in MPEG video transportation, a new innovative use of packet scheduling to meet the loss constraints of video communication is proposed. Followed by programming tests concerning establishment...
Traditional scheduling algorithms are focused in maximizing system throughput considering a grade of fairness. However, maximizing the system throughput does not necessarily result in maximizing the number of satisfied users (users with a packet delay below a threshold). Also, the throughput maximization could cause a low grade of fairness. In this paper, we propose a scheduling algorithm that maximizes...
Some current Internet applications (e.g., Grid/Cloud computing storage, video-conference) demand service differentiation, not only in terms of packet forwarding, but also at the connection level. To satisfy the demands for delay-sensitive and low-blocking applications, immediate reservation (IR) and advance reservation (AR) can be performed. Independent resource reservation of each type of network...
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.