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.
Service differentiation is known as on the classic and major tasks in IP networks. We propose a novel queuing method which benefits both “Less Impact Better Service” (LIBS) and fuzzy logic paradigms. LIBS leads us to a queuing method called non-congestive queuing, which prioritizes small packets when conditions permit to limit the delay impact of prioritization on congestive applications. In our proposed...
Supporting guaranteed QoS is a significant issue in packet transport networks. Since various services require their own quality of service, flow-based traffic management that properly controls network resources when traffic congestion occurs is required for network nodes. In this paper, we propose an integrated flow management scheme to support guaranteed QoS in packet transport systems that comprise...
In this paper a flow-based model balancing queues at the nodes of MPLS-network is proposed. The novelty of the model is that it, in the contrast to the previously known models takes into account the features of the Traffic Engineering Queues technology. This technology has a purpose to ensuring load balancing of the node buffer resource.
QoS Routing Algorithm is a routing algorithm for finding the shortest path that satisfies the QoS requirements of the end users. While finding the shortest path this uses some of improved ideas for effectively finding the shortest path with required QoS measures. Exactly the QoS routing algorithm is a kind of multi constrained routing algorithm where more than one link components are taken into considerations...
The volume of Internet traffic increases every year, caused by increased amounts of individual information. Quality of Service (QoS) controls is necessary to manage this traffic. Differentiated Service (Diffserv) is a promising technique to realize scalable QoS control in the internet; extensive efforts have been made for its practical use and it is already introduced in some networks. The control...
Developing distributed applications for MANETs is a complex task due to the latter's bandwidth constrained nature. Further, in tactical MANETs, there is a need to prioritize traffic generated by distributed applications so that high priority traffic gets preferential access to the bandwidth constrained communication medium. Finally, applications must be designed to accommodate network bandwidth and...
Almost all deployed implementations of the IEEE802.16 standard (also known as WiMAX) employ the Point to Multipoint (PMP) topology. With such a topology Quality of Service (QoS) can be easily achieved, but the coverage area is limited. The other architectural topology is the Mesh Mode which is able to provide a larger coverage area, but cannot support the QoS required. This paper addresses the issue...
This paper proposes efficient analytical models to dimension the required transport bandwidths for the Long Term Evolution (LTE) access network for the elastic Internet traffic (which is carried by the TCP protocol). The dimensioning models are based on the use of Processor Sharing queuing theory to guarantee a desired end-to-end application QoS target. For validating the analytical dimensioning models,...
Current network situation with its limited resources and excessive users' demands reveals the potential necessity for revolutionary organization and management of these resources. Efficient and effective resource scheduling significantly reduces queuing delay which considered as crucial particularly for sensitive packets such as real-time application. This study investigates in the main four categories...
The potential increase in the popularity of greedy software such as download accelerator software and greedy application such as P2P leads to a significant demands for reconstruction of the old fashion max-min fairness definition. Furthermore, these applications and software monopolize network bandwidth and hence result in magnificent degradation in the performance of real-time application such as...
This paper proposes a novel Dynamic Priority Time-Threshold-based Queuing bandwidth allocation Scheme for Multimedia services (DPTTQM) in cellular networks. Because future data service will occupy a large portion of all services in next generation mobile networks, there is much significance in improving non-prioritized handoff data call dropping probability of Finite Queuing Adaptive Time-Threshold-based...
Queue scheduling algorithm achieves the assignment of the network resource through scheduling strategy, the reserved bandwidth and delaytime can be guaranteed, then the router select the next packet waiting for forwarding from one or more queues based on some rules, All input network services can share the output bandwidth according to reserved way, to have corresponding resource, and to meet service...
Resource allocation in Wireless Sensor Networks (WSNs) is certainly a challenging issue. WSNs are characterized by special features, like energy constraints and limited computing resources. Latest trends define that sensors should be able to provide Quality of Service (QoS) demanding data transmission. A modern approach in bandwidth sharing considers both the packet queue load as well as the traffic...
The IEEE 802.16 standard defines MAC and physical layer protocols for broadband wireless access, however it does not specify any scheduling algorithm. In this paper, we propose a RED-based Weighted Fair Priority Queuing algorithm for inter-class scheduling and a channel aware algorithm for intra-class scheduling. Weights of the service classes are adaptive according to the QoS requirements of each...
DiffServ model is a main model that guarantees QoS in modern-Large-scale network., On the basis of RIO-C, the paper introduces an Active Queue Management algorithm -- PFRIO that is suitable for DiffServ model. The algorithm increases the fair for bandwidth allocation and the network's capacity to hand of sudden data flow, and improves the overall performance of DiffServ model effectively.
In this paper, based on analyzing the two existing queue scheduling algorithms WRR and DWRR, an improved scheduling algorithm, called DWRR+, is presented, which is the resolution for the fairness of bandwidth allocation of the WRR algorithm. The ns-2 simulations show that the improved scheduling algorithm not only offers the service of the minimum guaranteed bandwidth but also implements the fair...
The QoS (Quality of Service) is an important factor in computer networks. Here we proposed an effective queuing discipline for obtaining QoS and thus the throughput is increased. The SQP is a stateless queue management algorithm. The SQP allocates variable bandwidth for TCP (Transmission Control Protocol) flows and performs the matched drops in the queue. Based on the priority of TCP flow the queuing...
Diffserv(Differentiated Service) is a promising technique to realize scalable QoS control in the internet. Therefore, extensive efforts have been made for the practical use of this technique. Diffserv is already introduced in some networks. Control functions for Diffserv are installed in edge routers and core routers. This enables a scalable QoS control as mentioned above. This paper proposes a new...
Active Queue Management (AQM) algorithm is important to manage buffers and transfer packets for wired/wireless networks. However, the unresponsive flows to the network congestion control is dangerous to the network equilibrium and Quality of Service (QoS), especially from the point of network resource allocation. In some certain scenarios, the limited network resource (buffers) can be occupied by...
To ensure Quality of Service (QoS) for data centers, it is critical to enforce a fair share of storage resources between competing users. Interposed schedulers are one of the most practical methods for performance isolation. Most fair queuing-based proportional sharing algorithms for existing interposed scheduler are variants of counterparts designed for network routers and may result in breaking...
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.