A NEW SCHEDULING PROTOCOL DESIGN BASED ON DEFICIT WEIGHTED ROUND ROBIN FOR QoS SUPPORT IN IP NETWORKS

2013 ◽  
Vol 22 (03) ◽  
pp. 1350012 ◽  
Author(s):  
RIDHA OUNI ◽  
JAMILA BHAR ◽  
KHOLDOUN TORKI
Keyword(s):  
Resource Sharing ◽  
Packet Scheduling ◽  
Systems Design ◽  
Service Level ◽  
Round Robin ◽  
Utilization Rate ◽  
Bandwidth Utilization ◽  
Network Resources ◽  
Weighted Sharing ◽  
Network Bandwidth

We present a study of the effects of active queue management (AQM) on the average queue size in routers. In this work, three prominent AQM schemes are considered: packet classification, checking service level agreements (SLA) and queue scheduling. This paper presents several adaptive resource sharing models that use a revenue criterion to allocate bandwidth in an optimal way. The models ensure QoS requirements of data flows and, at the same time, maximize the total revenue by adjusting parameters of the underlying schedulers. Deficit round robin (DRR) and deficit weighted round robin (DWRR) scheduling techniques have shown their ability in providing fair and weighted sharing of network resources for network devices. However, they are unable to use the total allocated network bandwidth even in burst traffic. In this paper, we propose a negative-deficit weighted round robin (N-DWRR) technique as a new packet scheduling discipline to improve the bandwidth utilization rate without increasing the total latency. A fully hardware packet scheduler has been implemented and verified as part of an intellectual property core. This is motivated by the fact that the design and analysis of hardware/software architectures for such techniques requires new models and methods, which do not fall under the domain of traditional embedded-systems design.

scholarly journals User online behavior based on big data distributed clustering algorithm

2020 ◽  
Vol 17 (2) ◽  
pp. 172988142091729 ◽  
Author(s):  
Yan Wang
Keyword(s):  
Big Data ◽  
Clustering Algorithm ◽  
Utilization Rate ◽  
Clear Understanding ◽  
Campus Network ◽  
Online Behavior ◽  
Distributed Clustering ◽  
Network Resources ◽  
Network Bandwidth ◽  
Network Usage

With the development of big data technology more and more perfect, many colleges and universities have begun to use it to analyze the construction work. In daily life, such as class, study, and entertainment, the campus network exists. The purpose of this article is to study the online behavior of users, analyze students’ use of the campus network by analyzing students, and not only have a clear understanding of the students’ online access but also feedback on the operation and maintenance of the campus network. Based on the big data, this article uses distributed clustering algorithm to study the online behavior of users. This article selects a college online user as the research object and studies and analyzes the online behavior of school users. This study found that the second-year student network usage is as high as 330,000, which is 60.98% more than the senior. In addition, the majority of student users spend most of their online time on the weekend, and the other time is not much different. The duration is concentrated within 1 h, 1–2 h, 2–3 h in these three time periods. By studying the user’s online behavior, you can understand the utilization rate of the campus network bandwidth resources and the distribution of the use of the network, to prevent students from indulging in the virtual network world, and to ensure that the network users can improve the online experience of the campus network while accessing the network resources reasonably. The research provides a reference for network administrators to adjust network bandwidth and optimize the network.

scholarly journals PERFORMANCE COMPARISON WITH ACCESSIBILITY PREDICTION AND LINK BREAKAGE PREDICTION IN MANETS

2015 ◽  
pp. 48-54
Author(s):  
TEJAL ARVIND SONAWALE ◽  
SHIKHA NEMA
Keyword(s):  
Ad Hoc ◽  
Power Level ◽  
Performance Comparison ◽  
Delivery Ratio ◽  
Route Discovery ◽  
Network Resources ◽  
Average Delay ◽  
Network Bandwidth ◽  
Multiple Routes ◽  
Hoc Networks

Ad Hoc Networks face a lot of problems due to issues like mobility, power level, load of the network, bandwidth constraints, dynamic topology which lead to link breaks, node break down and increase in overhead. As nodes are changing their position consistently, routes are rapidly being disturbed, thereby generating route errors and new route discoveries. The need for mobility awareness is widely proclaimed. In our dissertation we present a scheme AOMDV-APLP that makes AOMDV aware of accessibility of neighbor nodes in the network. Nodes acquire the accessibility information of other nodes through routine routing operations and keep in their routing table. Based on this information route discovery is restricted to only “accessible” and “start” nodes. Further route with the strongest signal strength is selected from multiple routes using Link life value predicted by Link Breakage prediction technique. Simulation result shows that using accessibility and link life knowledge in route discovery process MAC overhead, routing overhead and average delay is reduced 3 times, and improve the Packet delivery ratio to a large extent than standard AOMDV which reflects effective use of network resources.

scholarly journals Network Bandwidth Utilization Prediction Based on Observed SNMP Data

2018 ◽  
Vol 13 (1) ◽  
pp. 160-168
Author(s):  
Nandalal Rana ◽  
Krishna P Bhandari ◽  
Surendra Shrestha
Keyword(s):  
Linear Time ◽  
Arima Model ◽  
Real Data ◽  
Service Planning ◽  
Bandwidth Utilization ◽  
Network Nodes ◽  
Network Bandwidth ◽  
Bandwidth Requirement ◽  
Logit Transformation

 Bandwidth requirement prediction is an important part of network design and service planning. The natural way of predicting bandwidth requirement for existing network is to analyze the past trends and apply appropriate mathematical model to predict for the future. For this research, the historical usage data of FWDR network nodes of Nepal Telecom is subject to univariate linear time series ARIMA model after logit transformation to predict future bandwidth requirement. The predicted data is compared to the real data obtained from the same network and the predicted data has been found to be within 10% MAPE. This model reduces the MAPE by 11.71% and 15.42% respectively as compared to the non-logit transformed ARIMA model at 99% CI. The results imply that the logit transformed ARIMA model has better performance compared to non-logit-transformed ARIMA model. For more accurate and longer term predictions, larger dataset can be taken along with season adjustments and consideration of long term variations.Journal of the Institute of Engineering, 2017, 13(1): 160-168

Game Theory for Wireless Network Resource Management

Game Theory ◽  
2017 ◽  
pp. 383-399
Author(s):  
Sungwook Kim
Keyword(s):  
Game Theory ◽  
Computer Network ◽  
Limited Resource ◽  
Shared Resources ◽  
Network Resources ◽  
Network Resource ◽  
Network Bandwidth ◽  
Competitive Game ◽  
Network Usage ◽  
Fair Sharing

Computer network bandwidth can be viewed as a limited resource. The users on the network compete for that resource. Their competition can be simulated using game theory models. No centralized regulation of network usage is possible because of the diverse ownership of network resources. Therefore, the problem is of ensuring the fair sharing of network resources. If a centralized system could be developed which would govern the use of the shared resources, each user would get an assigned network usage time or bandwidth, thereby limiting each person's usage of network resources to his or her fair share. As of yet, however, such a system remains an impossibility, making the situation of sharing network resources a competitive game between the users of the network and decreasing everyone's utility. This chapter explores this competitive game.

Surgery Operations Modeling and Scheduling in Healthcare Systems

2020 ◽  
pp. 352-366
Author(s):  
Fatah Chetouane ◽  
Eman Ibraheem
Keyword(s):  
Linear Model ◽  
Resource Sharing ◽  
Completion Time ◽  
Health Care Systems ◽  
Utilization Rate ◽  
Operations Scheduling ◽  
Care Systems ◽  
Operation Duration ◽  
High Utilization ◽  
Healthcare Processes

Surgery operations scheduling is a complex task due to operation duration uncertainties and resource sharing and availabilities in healthcare processes. In current health care systems it is important to minimize staff idle time and maintain a high utilization rate for surgery facilities. In the present study a nonlinear mathematical model for surgery scheduling is described, and an approximated linear model is deduced based on a set of assumptions. The linear model is solved using heuristic approach. The objective is to maximize the utilization of operating rooms and the surgery staff. Computational results show that our model improved the surgery schedule and the resources utilization. Our model also showed the potential of adding cases to the schedule due to minimizing the completion time of the schedule.

Denial-of-Service and Botnet Analysis, Detection, and Mitigation

2021 ◽  
pp. 20-48
Author(s):  
Sobana Sikkanan ◽  
Kasthuri M.
Keyword(s):  
Denial Of Service ◽  
The Internet ◽  
Dos Attack ◽  
Dos Attacks ◽  
Network Resources ◽  
Systematic Analysis ◽  
Network Bandwidth ◽  
Research Areas ◽  
History Analysis ◽  
Near Future

The internet is designed for processing and forwarding of any packet in a best effort manner. The packets carried by the internet may be malicious or not. Most of the time, internet architecture provides an unregulated path to victims. Denial-of-service (DoS) attack is the most common critical threat that causes devastating effects on the internet. The Botnet-based DoS attack aims to exhaust both the target resources and network bandwidth, thereby making the network resources unavailable for its valid users. The resources are utilized by either injecting a computer virus or flooding the network with useless traffic. This chapter provides a systematic analysis of the causes of DoS attacks, including motivations and history, analysis of different attacks, detection and protection techniques, various mitigation techniques, the limitations and challenges of DoS research areas. Finally, this chapter discusses some important research directions which will need more attention in the near future to guarantee the successful defense against DoS attacks.

scholarly journals A Packet Scheduling Method Based on Dynamic Adjustment of Service Priority for Electric Power Wireless Communication Network

2020 ◽  
Vol 2020 ◽  
pp. 1-13
Author(s):  
Bo Hu ◽  
Xin Liu ◽  
Jinghong Zhao ◽  
Siya Xu ◽  
Zhenjiang Lei ◽  
...  
Keyword(s):  
Communication Network ◽  
Electric Power ◽  
Real Time ◽  
Resource Utilization ◽  
Packet Scheduling ◽  
Dynamic Adjustment ◽  
Communication Services ◽  
Network Bandwidth ◽  
Scheduling Method ◽  
Service Priority

With the development of the energy Internet, power communication services are heterogeneous, and different power communication services have different business priorities. The power communication services with different priorities have different requirements for network bandwidth and real-time performance. For traditional unified service, a scheduling method cannot meet these service requirements at the same time, and electric power communication network cannot guarantee the quality of service. Therefore, how to make full use of the time-varying characteristics of communication resources to meet the business needs of different priorities and achieve the goals of high resource utilization and transmission quality has become one of the urgent problems in the power communication network. For this reason, in order to adapt to the real-time congestion of the network, we have designed a packet scheduling method based on the dynamic adjustment of service priority, which dynamically adjusts the priority of the power service on the node; in addition, an evaluation method for the trust value of wireless forwarding nodes is introduced to improve the security of data transmission; and finally, we valuate the channel quality to establish a reasonable and efficient packet scheduling mechanism for services of different priorities. Simulation results show that this method improves the communication performance of high-priority services and improves the spectrum resource utilization of the entire system.

Combined Queue Management and Scheduling Mechanism to Improve Intra-User Multi-Flow QoS in a Beyond 3,5G Network

2012 ◽  
Vol 4 (1) ◽  
pp. 57-68 ◽  
Author(s):  
Amine Berqia ◽  
Mohamed Hanini ◽  
Abdelkrim Haqiq
Keyword(s):  
Real Time ◽  
High Speed ◽  
Packet Scheduling ◽  
Buffer Management ◽  
Packet Delay ◽  
Queue Management ◽  
Performance Parameters ◽  
Buffer Allocation ◽  
Network Resources ◽  
Delay Jitter

Packet scheduling and buffer management are the two important functions adopted in networks design to ensure the Quality of Service (QoS) when different types of packets with different needs of quality share the same network resources. The Packet scheduling policy determines packet service priorities at the output link, it can reduce packet delay and delay jitter for high-priority traffic. The buffer management involves packet dropping and buffer allocation. The overall goal of such schemes proposed in High Speed Downlink Packet Access (HSDPA) is to take advantage of the channel variations between users and preferably schedule transmissions to a user when the channel conditions are advantageous; it does not take in consideration the characteristics of the flows composing the transmitted traffic to the user. This paper compares two queue management mechanisms with thresholds applied for packets transmitted to an end user in HSDPA network. Those mechanisms are used to manage access packets in the queue giving priority to the Real Time (RT) packets and avoiding the Non Real Time (NRT) packets loss. The authors show that the performance parameters of RT packets are similar in the two mechanisms, where as the second mechanism improves the performance parameters of the NRT packets.

Sign in / Sign up

Export Citation Format

Share Document