Packet and flow scheduling algorithms for WiMAX has been a topic of interest for a long time since the very inception of WiMAX networks. WiMAX offers advantages particularly in terms of Quality of service it offers over a longer range at the MAC level. In our paper, we propose two credit based scheduling schemes one in which completed flows distributes the left over credits equally to all higher priority flows(FDCBSS) and another in which completed flows give away all the excess credits to the highest priority uncompleted flow(SDCBSS). Both the schemes are compatible with 802.16 MAC protocol and can efficiently serve real time bursty traffic with reduced latency and hence improved QOS for real time flows. We compare the two proposed schemes for their latency, bandwidth utilization and throughput for real time burst flows with the basic Deficit Round Robin scheduling scheme.
Design and implementation of low latency weighted round robin (ll wrr) schedu...ijwmn
Today’s wireless broadband networks are required to provide QoS guarantee as well as fairness to
different kinds of traffic. Recent wireless standards (such as LTE and WiMAX) have special provisions at
MAC layer for differentiating and scheduling data traffic for achieving QoS. The main focus of this paper is
concerned with high speed packet queuing/scheduling at central node such as base station (BS) or router to
handle network traffic. This paper proposes novel packet queuing scheme termed as Low Latency
Weighted Round Robin (LL-WRR) which is simple and effective amendment to weighted round robin (WRR)
for achieving low latency and improved fairness. Proposed LL-WRR queue scheduling scheme is
implemented in NS-2 considering IEEE 802.16 network [1] with real time video and Constant Bit Rate
(CBR) audio traffic connections. Simulation results show improvement obtained in latency and fairness
using LL-WRR. The proposed scheme introduces extra complexity of computing coefficient but its overall
impact is very small.
This document summarizes a research paper that proposes a clustered conduction of VoIP routing (CCVR) topology for 802.11 wireless local area networks to improve quality of service. The CCVR topology clusters VoIP data packets into different buffers based on their properties. It introduces a novel scheduling mechanism to differentiate packet loss and transmission delay. Simulation results showed that the CCVR approach achieved better frame delivery ratios and less frame overhead compared to existing single buffer and scheduling strategies. The clustering and prioritization of buffers and adaptive scheduling of traffic flows helped meet various quality of service guarantees for delay, packet loss and bandwidth utilization.
This document summarizes a research paper that proposes an energy and bandwidth constrained routing technique for mobile ad hoc networks (MANETs). It presents an available bandwidth measurement algorithm that estimates available bandwidth more accurately by considering node capacity, link utilization, idle time synchronization, collision probability, and overhead from backoff mechanisms. It also proposes a probability-based overhearing method to reduce energy consumption from overhearing without affecting route quality. The techniques are evaluated using NS2 simulations to analyze network performance in terms of quality of service parameters.
The International Journal of Engineering and Science (The IJES)theijes
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
Quality of Service (QoS) provisioning in networks requires proper scheduling algorithm. Internet traffic,
especially real-time multimedia applications, is bursty in nature . Hence, in addition to the service rate
which is commonly used to isolate service of sessions, other parameters should be involved. In this paper
a scheduling algorithm is proposed that attempts to provide a balance between bursty and non-bursty
(smooth) traffic. We improve thewell-known packet scheduling algorithm, SCFQ.Our proposed algorithm
is proficient to compensate an adjustable amount of missed service to each session. The average delay of
the proposed algorithm is evaluated by simulation. An important advantage of our algorithm is that
byselecting correct parameter setting for each session, the average delay of a bursty session can be
reduced. Furthermore, compared to SCFQ our proposed algorithm does not necessitate any additional
computation.
This document discusses using fuzzy logic to help manage quality of service (QoS) in satellite communication systems. It outlines some challenges in maintaining service level agreements (SLAs) for QoS in satellite networks due to external factors like weather. The document proposes a fuzzy logic controller to help dynamically tune the parameters of the random early detection (RED) congestion control algorithm used in these networks. This approach aims to make satellite-IP networks more adaptive to changing weather conditions like rain fade that can impact performance.
This document presents a QoS-based packet scheduling algorithm for hybrid wireless networks. It proposes using the Earliest Deadline First (EDF) algorithm to schedule packets for online conference applications and the Least Slack Time First algorithm to schedule packets for online video applications. The goal is to reduce transmission delay and improve QoS. It implements this scheduling approach using the NS2 network simulator. The scheduling algorithm classifies packets by application type and places them in queues. EDF and Least Slack Time are then used to schedule packets from each queue to minimize delay for multimedia applications over hybrid wireless networks.
Improving data transmission in the vanet using multi criteria decision making...ijfcstjournal
In vehicular ad
-
hoc networks the packets are sent using multi
-
hop methods and the receiving limit of a
message is gradually extended, but the exponential increment of the number of nodes re
-
broadcasting a
message results in broadcast storm problem in data
broadcasting in this case. Some characteristics like
high speed of nodes, rapid topological changes and repetitive discontinuities have made it difficult
to
design an efficient broadcasting protocol for these networks.
We have offered a novel fuzzy method
based on multi
-
criteria decision
-
making (MCDM) for prioritizing the
vehicles in selection of the most proper neighbor to broadcast data in this paper. With using this f
uzzy
method, the most proper vehicles participate in data broadcasting. The results of
simulation using NS show
that because of selecting the neighboring vehicles with high priority in data broadcasting, the spee
d of
sending the packs is increased and the network load is considerably decreased. This method also
considerably decreases broadca
sting traffic.
Design and implementation of low latency weighted round robin (ll wrr) schedu...ijwmn
Today’s wireless broadband networks are required to provide QoS guarantee as well as fairness to
different kinds of traffic. Recent wireless standards (such as LTE and WiMAX) have special provisions at
MAC layer for differentiating and scheduling data traffic for achieving QoS. The main focus of this paper is
concerned with high speed packet queuing/scheduling at central node such as base station (BS) or router to
handle network traffic. This paper proposes novel packet queuing scheme termed as Low Latency
Weighted Round Robin (LL-WRR) which is simple and effective amendment to weighted round robin (WRR)
for achieving low latency and improved fairness. Proposed LL-WRR queue scheduling scheme is
implemented in NS-2 considering IEEE 802.16 network [1] with real time video and Constant Bit Rate
(CBR) audio traffic connections. Simulation results show improvement obtained in latency and fairness
using LL-WRR. The proposed scheme introduces extra complexity of computing coefficient but its overall
impact is very small.
This document summarizes a research paper that proposes a clustered conduction of VoIP routing (CCVR) topology for 802.11 wireless local area networks to improve quality of service. The CCVR topology clusters VoIP data packets into different buffers based on their properties. It introduces a novel scheduling mechanism to differentiate packet loss and transmission delay. Simulation results showed that the CCVR approach achieved better frame delivery ratios and less frame overhead compared to existing single buffer and scheduling strategies. The clustering and prioritization of buffers and adaptive scheduling of traffic flows helped meet various quality of service guarantees for delay, packet loss and bandwidth utilization.
This document summarizes a research paper that proposes an energy and bandwidth constrained routing technique for mobile ad hoc networks (MANETs). It presents an available bandwidth measurement algorithm that estimates available bandwidth more accurately by considering node capacity, link utilization, idle time synchronization, collision probability, and overhead from backoff mechanisms. It also proposes a probability-based overhearing method to reduce energy consumption from overhearing without affecting route quality. The techniques are evaluated using NS2 simulations to analyze network performance in terms of quality of service parameters.
The International Journal of Engineering and Science (The IJES)theijes
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
Quality of Service (QoS) provisioning in networks requires proper scheduling algorithm. Internet traffic,
especially real-time multimedia applications, is bursty in nature . Hence, in addition to the service rate
which is commonly used to isolate service of sessions, other parameters should be involved. In this paper
a scheduling algorithm is proposed that attempts to provide a balance between bursty and non-bursty
(smooth) traffic. We improve thewell-known packet scheduling algorithm, SCFQ.Our proposed algorithm
is proficient to compensate an adjustable amount of missed service to each session. The average delay of
the proposed algorithm is evaluated by simulation. An important advantage of our algorithm is that
byselecting correct parameter setting for each session, the average delay of a bursty session can be
reduced. Furthermore, compared to SCFQ our proposed algorithm does not necessitate any additional
computation.
This document discusses using fuzzy logic to help manage quality of service (QoS) in satellite communication systems. It outlines some challenges in maintaining service level agreements (SLAs) for QoS in satellite networks due to external factors like weather. The document proposes a fuzzy logic controller to help dynamically tune the parameters of the random early detection (RED) congestion control algorithm used in these networks. This approach aims to make satellite-IP networks more adaptive to changing weather conditions like rain fade that can impact performance.
This document presents a QoS-based packet scheduling algorithm for hybrid wireless networks. It proposes using the Earliest Deadline First (EDF) algorithm to schedule packets for online conference applications and the Least Slack Time First algorithm to schedule packets for online video applications. The goal is to reduce transmission delay and improve QoS. It implements this scheduling approach using the NS2 network simulator. The scheduling algorithm classifies packets by application type and places them in queues. EDF and Least Slack Time are then used to schedule packets from each queue to minimize delay for multimedia applications over hybrid wireless networks.
Improving data transmission in the vanet using multi criteria decision making...ijfcstjournal
In vehicular ad
-
hoc networks the packets are sent using multi
-
hop methods and the receiving limit of a
message is gradually extended, but the exponential increment of the number of nodes re
-
broadcasting a
message results in broadcast storm problem in data
broadcasting in this case. Some characteristics like
high speed of nodes, rapid topological changes and repetitive discontinuities have made it difficult
to
design an efficient broadcasting protocol for these networks.
We have offered a novel fuzzy method
based on multi
-
criteria decision
-
making (MCDM) for prioritizing the
vehicles in selection of the most proper neighbor to broadcast data in this paper. With using this f
uzzy
method, the most proper vehicles participate in data broadcasting. The results of
simulation using NS show
that because of selecting the neighboring vehicles with high priority in data broadcasting, the spee
d of
sending the packs is increased and the network load is considerably decreased. This method also
considerably decreases broadca
sting traffic.
LTE QOS DYNAMIC RESOURCE BLOCK ALLOCATION WITH POWER SOURCE LIMITATION AND QU...IJCNCJournal
3GPP has defined the long term evolution (LTE) for 3G radio access in order to maintain the future
competitiveness for 3G technology, the system provides the capability of supporting a mixture of services
with different quality of service (QoS) requirements. This paper proposes a new cross-layer scheduling
algorithm to satisfy better QoS parameters for real time applications. The proposed algorithm takes care of
allocating resource blocks (RBs) with different modulation and coding schemes (MCS) according to target
bit error rate (BER), user equipment supportable MCS, queue stability constraints and available transmit
power constraints. The proposed algorithm has been valued, compared with an earlier allocation algorithm
in terms of service rate and packet delay and showed better performance regards the real time
applications.
Packet delivery ratio, delay, throughput, routing overhead etc are the strict quality of service requirements
for applications in Ad hoc networks. So, the routing protocol not only finds a suitable path but also the path
should satisfy the QoS constraints also. Quality of services (QoS) aware routing is performed on the basis
of resource availability in the network and the flow of QoS requirement. In this paper we developed a
source routing protocol which satisfying the link bandwidth and end –to- end delay factor. Our protocol
will find multiple paths between the source and the destination, out of those one will be selected for data
transfer and others are reserve at the source node those can be used for route maintenance purpose. The
path selection is strictly based on the bandwidth and end-to-end delay in case two or more then two paths
are having the same values for QoS constraints then we will use hop as a parameter for path selection.
A cross layer delay-aware multipath routing algorithm for mobile adhoc networkscsandit
Mobile Ad Hoc Networks (MANETS) require reliable routing and Quality of Service(QoS)
mechanism to support diverse applications with varying and stringent requirements. Routing
protocols such as AODV, AOMDV, DSR and OLSR use minimum hop count as the metric for
path selection, hence are not suitable for delay sensitive real time applications. To support such
applications delay constrained routing protocols are employed. These Protocols makes path
selection based on the delay over the discovered links during routing discovery and routing
table calculations. We propose a variation of a node-disjoint Multipath QoS Routing protocol
called Cross Layer Delay aware Node Disjoint Multipath AODV (CLDM-AODV) based on
delay constraint. It employs cross-layer communications between MAC and routing layers to
achieve link and channel-awareness. It regularly updates the path status in terms of lowest
delay incurred at each intermediate node. Performance of the proposed protocol is compared
with single path AODV and NDMR protocols. Proposed CLDM-AODV is superior in terms of
better packet delivery and reduced overhead between intermediate nodes.
The document summarizes performance improvements for transferring short messages over the Universal Mobile Telecommunication System (UMTS). It presents two mathematical models: 1) a dedicated channel model that analyzes throughput over dedicated channels only, and 2) a proposed model that analyzes throughput over both random access channels (RACH) and dedicated channels. The proposed model increases message throughput by allowing RACH to carry messages directly instead of just requests. Results show the proposed model achieves higher throughput than the dedicated channel model across most values of network load and percentage of messages sent over RACH versus dedicated channels. Optimal values for maximizing throughput depend on the network load.
Quantitative Evaluation for PMPIv6 Multicast Fast Reroute OperationsjournalBEEI
This paper evaluates Proxy Mobile Internet Protocol Version 6 (PMIPv6) multicast fast reroute operations using quantitative analysis. The motivation is to cater the fast growth of mobile data traffic consumption and its networking technologies. Hence it is significance to enhancing the present techniques. Multicast enabled PMIPv6 is a mobile multicast networking management protocol that is highly acceptable in handling mobile data traffic. This paper briefly highlights the methodology, architecture and processes involved to produce the quatitative equations for each parameter. The quantitative parameters discussed are packet loss cost and handover latency.
DETERMINING THE NETWORK THROUGHPUT AND FLOW RATE USING GSR AND AAL2Rijujournal
In multi-radio wireless mesh networks, one node is eligible to transmit packets over multiple channels to different destination nodes simultaneously. This feature of multi-radio wireless mesh network makes high throughput for the network and increase the chance for multi path routing. This is because the multiple channel availability for transmission decreases the probability of the most elegant problem called as interference problem which is either of interflow and intraflow type. For avoiding the problem like interference and maintaining the constant network performance or increasing the performance the WMN need to consider the packet aggregation and packet forwarding. Packet aggregation is process of collecting several packets ready for transmission and sending them to the intended recipient through the channel, while the packet forwarding holds the hop-by-hop routing. But choosing the correct path among different available multiple paths is most the important factor in the both case for a routing algorithm. Hence the most challenging factor is to determine a forwarding strategy which will provide the schedule for each node for transmission within the channel. In this research work we have tried to implement two forwarding strategies for the multi path multi radio WMN as the approximate solution for the above said problem. We have implemented Global State Routing (GSR) which will consider the packet forwarding concept and Aggregation Aware Layer 2 Routing (AAL2R) which considers the both concept i.e. both packet forwarding and packet aggregation. After the successful implementation the network performance has been measured by means of simulation study.
A QUALITY OF SERVICE ARCHITECTURE FOR RESOURCE PROVISIONING AND RATE CONTROL ...ijasuc
Prioritized flow control is a type of QoS provisioning in which each class is provided a different QoS by
assigning priority to one class over another in terms of allocating resources. It is an effective means to
provide service differentiation to different class of service in mobile ad hoc networks. So the objective is to
achieve a desired level of service to high-priority flows so that the wireless medium is completely utilized
using adaptive rate control. In this paper, we propose to design QoS architecture for Bandwidth
Management and Rate Control in MANET. Our proposed QoS architecture contains an adaptive
bandwidth management technique which measures the available bandwidth at each node in real-time and
it is then propagated on demand by the QoS routing protocol. The source nodes perform call admission
control for different priority of flows based on the bandwidth information provided by the QoS routing.
The network bandwidth utilization is monitored continuously and network congestion is detected in
advance. Then a rate control mechanism is used to regulate best-effort traffic.
Qo s oriented distributed routing protocols : anna university 2nd review pptAAKASH S
To find a QoS path between source and destination, Which satisfies
The QoS requirements for each admitted connection and
Optimizes the use of network resources
Quality encompasses the data loss, latency, jitter, efficient use of network resources,..
QoS mechanisms for unfairness: managing queuing behavior, shaping traffic, control admission, routing, …
Usually, a hybrid network has widespread base stations
The data transmission in hybrid networks has two features:
An AP can be a source or a destination to any mobile node
It allows a stream to have anycast transmission along multiple transmission paths to its destination through base stations
The number of transmission hops between a mobile node and an AP is small
It enables a source node to connect to an AP through an intermediate node
In this paper introduce the QoS-Oriented Distributed routing protocol(QOD)
This QOD protocol makes five contributions:
QoS-guaranteed neighbor selection algorithm
Distributed packet scheduling algorithm
Mobility-based segment resizing algorithm
Soft-deadline based forwarding scheduling algorithm
Data redundancy elimination based transmission
AAA (Allocation, Admission and Assignment Control) for Network managementcontactmvrk
The document proposes a joint Allocation, Assignment, and Admission Control (AAA) framework for next generation cellular networks. It introduces a novel semi-distributed resource allocation method using both central and local allocation. It also presents a Markov-based assignment approach that calculates packet dropping probabilities considering queuing and adaptive modulation/coding. The admission control is based on calculating mean resource usage of existing users and buffer conditions. The AAA framework aims to improve overall network throughput, cell-edge throughput, and number of admitted users while guaranteeing quality of service.
Dynamic Routing for Data Integrity and Delay Differentiated Services in Wirel...1crore projects
IEEE PROJECTS 2015
1 crore projects is a leading Guide for ieee Projects and real time projects Works Provider.
It has been provided Lot of Guidance for Thousands of Students & made them more beneficial in all Technology Training.
Dot Net
DOTNET Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
Java Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
ECE IEEE Projects 2015
1. Matlab project
2. Ns2 project
3. Embedded project
4. Robotics project
Eligibility
Final Year students of
1. BSc (C.S)
2. BCA/B.E(C.S)
3. B.Tech IT
4. BE (C.S)
5. MSc (C.S)
6. MSc (IT)
7. MCA
8. MS (IT)
9. ME(ALL)
10. BE(ECE)(EEE)(E&I)
TECHNOLOGY USED AND FOR TRAINING IN
1. DOT NET
2. C sharp
3. ASP
4. VB
5. SQL SERVER
6. JAVA
7. J2EE
8. STRINGS
9. ORACLE
10. VB dotNET
11. EMBEDDED
12. MAT LAB
13. LAB VIEW
14. Multi Sim
CONTACT US
1 CRORE PROJECTS
Door No: 214/215,2nd Floor,
No. 172, Raahat Plaza, (Shopping Mall) ,Arcot Road, Vadapalani, Chennai,
Tamin Nadu, INDIA - 600 026
Email id: 1croreprojects@gmail.com
website:1croreprojects.com
Phone : +91 97518 00789 / +91 72999 51536
This document describes the implementation of a reliable and scalable multicast model called RSM2. RSM2 uses a flat architecture with active server-based local recovery using Dynamics Managers. It employs techniques like proactive routing, minimum cost path algorithm, combo-casting, NACK-based acknowledgment, buffer management, and an optimized flooding algorithm to provide reliability, scalability and efficient delivery of packets in one-to-many, many-to-many, and all-to-all communication environments. RSM2 is designed to overcome limitations of existing hierarchical models like RMTP and provide an improvement for reliable multicasting.
A New QoS Renegotiation Mechanism for Multimedia ApplicationsABDELAAL
The document proposes an adaptive QoS architecture that uses call rejection notifications as feedback to capture network characteristics and allow multimedia applications to renegotiate QoS requirements dynamically. It aims to improve on existing static and dynamic QoS approaches by using flow-based traffic monitoring and a feedback mechanism with low overhead. Simulation results show the approach admits more calls, improves QoS parameters, and decreases call processing time compared to other methods.
Long-Term Evolution (LTE), an emerging and promising fourth generation mobile technology, is expected
to offer ubiquitous broadband access to the mobile subscribers. In this paper, the performance of Frame
Level Scheduler (FLS), Exponential (EXP) rule, Logarithmic (LOG) rule and Maximum-Largest Weighted
Delay First (M-LWDF) packet scheduling algorithms has been studied in the downlink 3GPP LTE cellular
network. To this aim, a single cell with interference scenario has been considered. The performance
evaluation is made by varying the number of UEs ranging from 10 to 50 (Case 1) and user speed in the
range of [3, 120] km/h (Case 2). Results show that while the number of UEs and user speed increases, the
performance of the considered scheduling schemes degrades and in both case FLS outperforms other three
schemes in terms of several performance indexes such as average throughput, packet loss ratio (PLR),
packet delay and fairness index.
Hierarchical Genetic Algorithm For Dynamic Channel Units Allocation in TD-CDM...ijwmn
Hierarchical Genetic Algorithms (HGA) as a tool for search and optimizing methodology have now reached a mature stage. The minimum resource facility to carry user traffic, termed a channel unit (CU), is composed of a one time-slot and one code in the TD-CDMA/TDD system. The control of the number of CUs depends on the traffic load solves varied and asymmetrical traffic problems in the 3G system. In a cellular network, the call arrival rate, call duration and the communication overhead between the base stations and the control center are vague and uncertain, regardless of whether the criteria of concern are nonlinear, constrained, discrete or NP hard. In this paper, the HGA is used to tackle the neural network (NN) topology as well as the fuzzy logic controller for the dynamic CU allocation scheme in wireless cellular networks. Therefore, we propose a new efficient HGA CUs Allocation (HGACA) in cellular networks. It aims to efficiently satisfy the diverse quality-of-service (QoS) requirements of multimedia traffic. The results show our algorithm has a lower blocking rate, lower dropping rate, less update overhead, and shorter channel-acquisition delay than previous methods
This document analyzes the impact of varying transmission range, mobility speed, and number of nodes on the performance of three routing protocols (AODV, DSDV, DSR) in mobile ad hoc networks. It simulates these protocols using the NS-2 simulator and measures the performance based on several QoS metrics including packet delivery ratio, end-to-end delay, routing overhead, and throughput. The results show that AODV generally has the best packet delivery ratio and throughput, while DSDV has the lowest end-to-end delay. DSR performance is between AODV and DSDV. Increasing the transmission range and number of nodes tends to improve performance, while increasing mobility reduces it.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Self-Pruning based Probabilistic Approach to Minimize Redundancy Overhead for...IJCNCJournal
The Broadcast storm problem causes severe interference, intense collision and channel contention, which greatly degrades the QoS performance metrics of the routing protocols. So, we suggest a neighbourhood coverage knowledge probabilistic broadcasting model (NCKPB) integrating with AODV protocol with knowledge on 2-hop neighbourhood coverage; a connectivity function to control a node’s forwarding probability of retransmission to alleviate significant overhead redundancy. Our objective is to minimize the broadcast RREQ overhead while ensuring fair retransmission bandwidth. We considered two more important measures called Saved Rebroadcast and Reachability. The outcomes of NCKPB, Fixed probability (FP) and Flooding (FL) routing schemes are examined under three major operating conditions, such as node density, mobility and traffic load. The NS-2 results demonstrate the efficacy of the proposed NCKPB model by illustrating its performance superiority over all key metrics such as redundancy overhead, end to end latency, throughput, reachability, saved rebroadcast and collision contrast to FP and FL.
A cross layer delay-aware node disjoint multipath routing algorithm for mobil...ijwmn
Mobile Ad Hoc Networks (MANETS) require reliable routing and Quality of Service(QoS) mechanism to
support diverse applications with varying and stringent requirements for delay, jitter, bandwidth, packets
loss. Routing protocols such as AODV, AOMDV, DSR and OLSR use shortest path with minimum hop
count as the main metric for path selection, hence are not suitable for delay sensitive real time
applications. To support such applications delay constrained routing protocols are employed. These
Protocols makes path selection between source and destination based on the delay over the discovered
links during routing discovery and routing table calculations. We propose a variation of a node-disjoint
Multipath QoS Routing protocol called Cross Layer Delay aware Node Disjoint Multipath AODV (CLDMAODV)
based on delay constraint. It employs cross-layer communications between MAC and routing
layers to achieve link and channel-awareness. It regularly updates the path status in terms of lowest delay
incurred at each intermediate node. Performance of the proposed protocol is compared with single path
AODV and NDMR protocols. Proposed CLDM-AODV is superior in terms of better packet delivery and
reduced overhead between intermediate nodes.
The document discusses various techniques for congestion control in computer networks, including at both the router and host levels. It defines congestion control as efforts to prevent or respond to overload conditions in the network. At the router level, it describes queue management techniques like FIFO, priority queuing, fair queuing (FQ), and weighted fair queuing (WFQ) which aim to allocate bandwidth fairly between flows. It also discusses congestion notification methods including explicit feedback and implicit feedback via packet drops. At the host level, it mentions TCP congestion control and reservation-based approaches.
A Survey on Cross Layer Routing Protocol with Quality of ServiceIJSRD
Wireless is playing the wide role in today’s industrial application. Central idea of this paper is to enhance quality of service (QoS) for multimedia transmission over ad-hoc network. This paper describes the operational of different QoS routing protocols, their properties and various parameters advantages and disadvantages. Also describes the use of QoS in Cross layer routing protocol. Finally, it concludes by study of all these cross layer QoS routing protocols.
A Fair and Efficient Packet Scheduling Scheme for IEEE 802.16 Broadband Wirel...ijasuc
This paper proposes a fair and efficient QoS scheduling scheme for IEEE 802.16 BWA systems that
satisfies both throughput and delay guarantee to various real and non-real time applications. The proposed
QoS scheduling scheme is compared with an existing QoS scheduling scheme proposed in literature in
recent past. Simulation results show that the proposed scheduling scheme can provide a tight QoS
guarantee in terms of delay, delay violation rate and throughput for all types of traffic as defined in the
WiMAX standard, thereby maintaining the fairness and helps to eliminate starvation of lower priority
class services. Bandwidth utilization of the system and fairness index of the resources are also
encountered to validate the QoS provided by our proposed scheduling scheme.
The document proposes a WFQ-based dynamic bandwidth allocation framework for mobile WiMAX applications. It uses a packet scheduler scheme, call admission policy, and dynamic bandwidth allocation mechanism. Bandwidth is dynamically allocated based on a BVal parameter, which considers fairness, utilization, and delay bound. Packet scheduling is done in two tiers - the first uses EDF, WFQ, WFQ, and RR for different traffic classes, while the second uses WFQ. This architecture aims to provide quality of service support in a fair manner for different traffic types.
LTE QOS DYNAMIC RESOURCE BLOCK ALLOCATION WITH POWER SOURCE LIMITATION AND QU...IJCNCJournal
3GPP has defined the long term evolution (LTE) for 3G radio access in order to maintain the future
competitiveness for 3G technology, the system provides the capability of supporting a mixture of services
with different quality of service (QoS) requirements. This paper proposes a new cross-layer scheduling
algorithm to satisfy better QoS parameters for real time applications. The proposed algorithm takes care of
allocating resource blocks (RBs) with different modulation and coding schemes (MCS) according to target
bit error rate (BER), user equipment supportable MCS, queue stability constraints and available transmit
power constraints. The proposed algorithm has been valued, compared with an earlier allocation algorithm
in terms of service rate and packet delay and showed better performance regards the real time
applications.
Packet delivery ratio, delay, throughput, routing overhead etc are the strict quality of service requirements
for applications in Ad hoc networks. So, the routing protocol not only finds a suitable path but also the path
should satisfy the QoS constraints also. Quality of services (QoS) aware routing is performed on the basis
of resource availability in the network and the flow of QoS requirement. In this paper we developed a
source routing protocol which satisfying the link bandwidth and end –to- end delay factor. Our protocol
will find multiple paths between the source and the destination, out of those one will be selected for data
transfer and others are reserve at the source node those can be used for route maintenance purpose. The
path selection is strictly based on the bandwidth and end-to-end delay in case two or more then two paths
are having the same values for QoS constraints then we will use hop as a parameter for path selection.
A cross layer delay-aware multipath routing algorithm for mobile adhoc networkscsandit
Mobile Ad Hoc Networks (MANETS) require reliable routing and Quality of Service(QoS)
mechanism to support diverse applications with varying and stringent requirements. Routing
protocols such as AODV, AOMDV, DSR and OLSR use minimum hop count as the metric for
path selection, hence are not suitable for delay sensitive real time applications. To support such
applications delay constrained routing protocols are employed. These Protocols makes path
selection based on the delay over the discovered links during routing discovery and routing
table calculations. We propose a variation of a node-disjoint Multipath QoS Routing protocol
called Cross Layer Delay aware Node Disjoint Multipath AODV (CLDM-AODV) based on
delay constraint. It employs cross-layer communications between MAC and routing layers to
achieve link and channel-awareness. It regularly updates the path status in terms of lowest
delay incurred at each intermediate node. Performance of the proposed protocol is compared
with single path AODV and NDMR protocols. Proposed CLDM-AODV is superior in terms of
better packet delivery and reduced overhead between intermediate nodes.
The document summarizes performance improvements for transferring short messages over the Universal Mobile Telecommunication System (UMTS). It presents two mathematical models: 1) a dedicated channel model that analyzes throughput over dedicated channels only, and 2) a proposed model that analyzes throughput over both random access channels (RACH) and dedicated channels. The proposed model increases message throughput by allowing RACH to carry messages directly instead of just requests. Results show the proposed model achieves higher throughput than the dedicated channel model across most values of network load and percentage of messages sent over RACH versus dedicated channels. Optimal values for maximizing throughput depend on the network load.
Quantitative Evaluation for PMPIv6 Multicast Fast Reroute OperationsjournalBEEI
This paper evaluates Proxy Mobile Internet Protocol Version 6 (PMIPv6) multicast fast reroute operations using quantitative analysis. The motivation is to cater the fast growth of mobile data traffic consumption and its networking technologies. Hence it is significance to enhancing the present techniques. Multicast enabled PMIPv6 is a mobile multicast networking management protocol that is highly acceptable in handling mobile data traffic. This paper briefly highlights the methodology, architecture and processes involved to produce the quatitative equations for each parameter. The quantitative parameters discussed are packet loss cost and handover latency.
DETERMINING THE NETWORK THROUGHPUT AND FLOW RATE USING GSR AND AAL2Rijujournal
In multi-radio wireless mesh networks, one node is eligible to transmit packets over multiple channels to different destination nodes simultaneously. This feature of multi-radio wireless mesh network makes high throughput for the network and increase the chance for multi path routing. This is because the multiple channel availability for transmission decreases the probability of the most elegant problem called as interference problem which is either of interflow and intraflow type. For avoiding the problem like interference and maintaining the constant network performance or increasing the performance the WMN need to consider the packet aggregation and packet forwarding. Packet aggregation is process of collecting several packets ready for transmission and sending them to the intended recipient through the channel, while the packet forwarding holds the hop-by-hop routing. But choosing the correct path among different available multiple paths is most the important factor in the both case for a routing algorithm. Hence the most challenging factor is to determine a forwarding strategy which will provide the schedule for each node for transmission within the channel. In this research work we have tried to implement two forwarding strategies for the multi path multi radio WMN as the approximate solution for the above said problem. We have implemented Global State Routing (GSR) which will consider the packet forwarding concept and Aggregation Aware Layer 2 Routing (AAL2R) which considers the both concept i.e. both packet forwarding and packet aggregation. After the successful implementation the network performance has been measured by means of simulation study.
A QUALITY OF SERVICE ARCHITECTURE FOR RESOURCE PROVISIONING AND RATE CONTROL ...ijasuc
Prioritized flow control is a type of QoS provisioning in which each class is provided a different QoS by
assigning priority to one class over another in terms of allocating resources. It is an effective means to
provide service differentiation to different class of service in mobile ad hoc networks. So the objective is to
achieve a desired level of service to high-priority flows so that the wireless medium is completely utilized
using adaptive rate control. In this paper, we propose to design QoS architecture for Bandwidth
Management and Rate Control in MANET. Our proposed QoS architecture contains an adaptive
bandwidth management technique which measures the available bandwidth at each node in real-time and
it is then propagated on demand by the QoS routing protocol. The source nodes perform call admission
control for different priority of flows based on the bandwidth information provided by the QoS routing.
The network bandwidth utilization is monitored continuously and network congestion is detected in
advance. Then a rate control mechanism is used to regulate best-effort traffic.
Qo s oriented distributed routing protocols : anna university 2nd review pptAAKASH S
To find a QoS path between source and destination, Which satisfies
The QoS requirements for each admitted connection and
Optimizes the use of network resources
Quality encompasses the data loss, latency, jitter, efficient use of network resources,..
QoS mechanisms for unfairness: managing queuing behavior, shaping traffic, control admission, routing, …
Usually, a hybrid network has widespread base stations
The data transmission in hybrid networks has two features:
An AP can be a source or a destination to any mobile node
It allows a stream to have anycast transmission along multiple transmission paths to its destination through base stations
The number of transmission hops between a mobile node and an AP is small
It enables a source node to connect to an AP through an intermediate node
In this paper introduce the QoS-Oriented Distributed routing protocol(QOD)
This QOD protocol makes five contributions:
QoS-guaranteed neighbor selection algorithm
Distributed packet scheduling algorithm
Mobility-based segment resizing algorithm
Soft-deadline based forwarding scheduling algorithm
Data redundancy elimination based transmission
AAA (Allocation, Admission and Assignment Control) for Network managementcontactmvrk
The document proposes a joint Allocation, Assignment, and Admission Control (AAA) framework for next generation cellular networks. It introduces a novel semi-distributed resource allocation method using both central and local allocation. It also presents a Markov-based assignment approach that calculates packet dropping probabilities considering queuing and adaptive modulation/coding. The admission control is based on calculating mean resource usage of existing users and buffer conditions. The AAA framework aims to improve overall network throughput, cell-edge throughput, and number of admitted users while guaranteeing quality of service.
Dynamic Routing for Data Integrity and Delay Differentiated Services in Wirel...1crore projects
IEEE PROJECTS 2015
1 crore projects is a leading Guide for ieee Projects and real time projects Works Provider.
It has been provided Lot of Guidance for Thousands of Students & made them more beneficial in all Technology Training.
Dot Net
DOTNET Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
Java Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
ECE IEEE Projects 2015
1. Matlab project
2. Ns2 project
3. Embedded project
4. Robotics project
Eligibility
Final Year students of
1. BSc (C.S)
2. BCA/B.E(C.S)
3. B.Tech IT
4. BE (C.S)
5. MSc (C.S)
6. MSc (IT)
7. MCA
8. MS (IT)
9. ME(ALL)
10. BE(ECE)(EEE)(E&I)
TECHNOLOGY USED AND FOR TRAINING IN
1. DOT NET
2. C sharp
3. ASP
4. VB
5. SQL SERVER
6. JAVA
7. J2EE
8. STRINGS
9. ORACLE
10. VB dotNET
11. EMBEDDED
12. MAT LAB
13. LAB VIEW
14. Multi Sim
CONTACT US
1 CRORE PROJECTS
Door No: 214/215,2nd Floor,
No. 172, Raahat Plaza, (Shopping Mall) ,Arcot Road, Vadapalani, Chennai,
Tamin Nadu, INDIA - 600 026
Email id: 1croreprojects@gmail.com
website:1croreprojects.com
Phone : +91 97518 00789 / +91 72999 51536
This document describes the implementation of a reliable and scalable multicast model called RSM2. RSM2 uses a flat architecture with active server-based local recovery using Dynamics Managers. It employs techniques like proactive routing, minimum cost path algorithm, combo-casting, NACK-based acknowledgment, buffer management, and an optimized flooding algorithm to provide reliability, scalability and efficient delivery of packets in one-to-many, many-to-many, and all-to-all communication environments. RSM2 is designed to overcome limitations of existing hierarchical models like RMTP and provide an improvement for reliable multicasting.
A New QoS Renegotiation Mechanism for Multimedia ApplicationsABDELAAL
The document proposes an adaptive QoS architecture that uses call rejection notifications as feedback to capture network characteristics and allow multimedia applications to renegotiate QoS requirements dynamically. It aims to improve on existing static and dynamic QoS approaches by using flow-based traffic monitoring and a feedback mechanism with low overhead. Simulation results show the approach admits more calls, improves QoS parameters, and decreases call processing time compared to other methods.
Long-Term Evolution (LTE), an emerging and promising fourth generation mobile technology, is expected
to offer ubiquitous broadband access to the mobile subscribers. In this paper, the performance of Frame
Level Scheduler (FLS), Exponential (EXP) rule, Logarithmic (LOG) rule and Maximum-Largest Weighted
Delay First (M-LWDF) packet scheduling algorithms has been studied in the downlink 3GPP LTE cellular
network. To this aim, a single cell with interference scenario has been considered. The performance
evaluation is made by varying the number of UEs ranging from 10 to 50 (Case 1) and user speed in the
range of [3, 120] km/h (Case 2). Results show that while the number of UEs and user speed increases, the
performance of the considered scheduling schemes degrades and in both case FLS outperforms other three
schemes in terms of several performance indexes such as average throughput, packet loss ratio (PLR),
packet delay and fairness index.
Hierarchical Genetic Algorithm For Dynamic Channel Units Allocation in TD-CDM...ijwmn
Hierarchical Genetic Algorithms (HGA) as a tool for search and optimizing methodology have now reached a mature stage. The minimum resource facility to carry user traffic, termed a channel unit (CU), is composed of a one time-slot and one code in the TD-CDMA/TDD system. The control of the number of CUs depends on the traffic load solves varied and asymmetrical traffic problems in the 3G system. In a cellular network, the call arrival rate, call duration and the communication overhead between the base stations and the control center are vague and uncertain, regardless of whether the criteria of concern are nonlinear, constrained, discrete or NP hard. In this paper, the HGA is used to tackle the neural network (NN) topology as well as the fuzzy logic controller for the dynamic CU allocation scheme in wireless cellular networks. Therefore, we propose a new efficient HGA CUs Allocation (HGACA) in cellular networks. It aims to efficiently satisfy the diverse quality-of-service (QoS) requirements of multimedia traffic. The results show our algorithm has a lower blocking rate, lower dropping rate, less update overhead, and shorter channel-acquisition delay than previous methods
This document analyzes the impact of varying transmission range, mobility speed, and number of nodes on the performance of three routing protocols (AODV, DSDV, DSR) in mobile ad hoc networks. It simulates these protocols using the NS-2 simulator and measures the performance based on several QoS metrics including packet delivery ratio, end-to-end delay, routing overhead, and throughput. The results show that AODV generally has the best packet delivery ratio and throughput, while DSDV has the lowest end-to-end delay. DSR performance is between AODV and DSDV. Increasing the transmission range and number of nodes tends to improve performance, while increasing mobility reduces it.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Self-Pruning based Probabilistic Approach to Minimize Redundancy Overhead for...IJCNCJournal
The Broadcast storm problem causes severe interference, intense collision and channel contention, which greatly degrades the QoS performance metrics of the routing protocols. So, we suggest a neighbourhood coverage knowledge probabilistic broadcasting model (NCKPB) integrating with AODV protocol with knowledge on 2-hop neighbourhood coverage; a connectivity function to control a node’s forwarding probability of retransmission to alleviate significant overhead redundancy. Our objective is to minimize the broadcast RREQ overhead while ensuring fair retransmission bandwidth. We considered two more important measures called Saved Rebroadcast and Reachability. The outcomes of NCKPB, Fixed probability (FP) and Flooding (FL) routing schemes are examined under three major operating conditions, such as node density, mobility and traffic load. The NS-2 results demonstrate the efficacy of the proposed NCKPB model by illustrating its performance superiority over all key metrics such as redundancy overhead, end to end latency, throughput, reachability, saved rebroadcast and collision contrast to FP and FL.
A cross layer delay-aware node disjoint multipath routing algorithm for mobil...ijwmn
Mobile Ad Hoc Networks (MANETS) require reliable routing and Quality of Service(QoS) mechanism to
support diverse applications with varying and stringent requirements for delay, jitter, bandwidth, packets
loss. Routing protocols such as AODV, AOMDV, DSR and OLSR use shortest path with minimum hop
count as the main metric for path selection, hence are not suitable for delay sensitive real time
applications. To support such applications delay constrained routing protocols are employed. These
Protocols makes path selection between source and destination based on the delay over the discovered
links during routing discovery and routing table calculations. We propose a variation of a node-disjoint
Multipath QoS Routing protocol called Cross Layer Delay aware Node Disjoint Multipath AODV (CLDMAODV)
based on delay constraint. It employs cross-layer communications between MAC and routing
layers to achieve link and channel-awareness. It regularly updates the path status in terms of lowest delay
incurred at each intermediate node. Performance of the proposed protocol is compared with single path
AODV and NDMR protocols. Proposed CLDM-AODV is superior in terms of better packet delivery and
reduced overhead between intermediate nodes.
The document discusses various techniques for congestion control in computer networks, including at both the router and host levels. It defines congestion control as efforts to prevent or respond to overload conditions in the network. At the router level, it describes queue management techniques like FIFO, priority queuing, fair queuing (FQ), and weighted fair queuing (WFQ) which aim to allocate bandwidth fairly between flows. It also discusses congestion notification methods including explicit feedback and implicit feedback via packet drops. At the host level, it mentions TCP congestion control and reservation-based approaches.
A Survey on Cross Layer Routing Protocol with Quality of ServiceIJSRD
Wireless is playing the wide role in today’s industrial application. Central idea of this paper is to enhance quality of service (QoS) for multimedia transmission over ad-hoc network. This paper describes the operational of different QoS routing protocols, their properties and various parameters advantages and disadvantages. Also describes the use of QoS in Cross layer routing protocol. Finally, it concludes by study of all these cross layer QoS routing protocols.
A Fair and Efficient Packet Scheduling Scheme for IEEE 802.16 Broadband Wirel...ijasuc
This paper proposes a fair and efficient QoS scheduling scheme for IEEE 802.16 BWA systems that
satisfies both throughput and delay guarantee to various real and non-real time applications. The proposed
QoS scheduling scheme is compared with an existing QoS scheduling scheme proposed in literature in
recent past. Simulation results show that the proposed scheduling scheme can provide a tight QoS
guarantee in terms of delay, delay violation rate and throughput for all types of traffic as defined in the
WiMAX standard, thereby maintaining the fairness and helps to eliminate starvation of lower priority
class services. Bandwidth utilization of the system and fairness index of the resources are also
encountered to validate the QoS provided by our proposed scheduling scheme.
The document proposes a WFQ-based dynamic bandwidth allocation framework for mobile WiMAX applications. It uses a packet scheduler scheme, call admission policy, and dynamic bandwidth allocation mechanism. Bandwidth is dynamically allocated based on a BVal parameter, which considers fairness, utilization, and delay bound. Packet scheduling is done in two tiers - the first uses EDF, WFQ, WFQ, and RR for different traffic classes, while the second uses WFQ. This architecture aims to provide quality of service support in a fair manner for different traffic types.
A Fuzzy Based Dynamic Queue Management Approach to Improve QOS in Wireless se...IJARIDEA Journal
Abstract— Wireless Sensor Networks (WSNs) are predicted to be the following iteration of networks which
will kind an indispensable a part of man’s lives and which furnish a bridge between the true bodily and
virtual worlds. WSNs will have to be able to aid more than a few functions over the same platform. Specific
applications would have unique QoS requirements helping the preliminary specifications for delivering
Quality of services (QoS), which is fundamental for numerous purposes, is directly concerning energy
consumption, delay, reliability, distortion, and community lifetime. There may be an inevitable correlation
between quality of accessible service levels in WSNs and power consumption in these networks, while
acquiring any of those bases acquires the influential interface on the other.
Keywords—Data integrity, Delay differentiated services, Dynamic routing, Potential field, Wireless sensor
networks.
Modulation aware connection admission control and uplink scheduling algorithm...ijwmn
Mobile WiMAX standard defines air interface for mobile broadband wireless access (BWA) systems and aimed to provide high data rate with seamless mobility while maintaining the quality of service (QoS). However, QoS of real-time applications depends on the link quality, which necessitate the channel-aware connection admission control (CAC) and scheduling schemes. In this paper Modulation aware CAC scheme and base station (BS) uplink scheduling algorithm are proposed to improve the system capacity and QoS performance respectively. The proposed CAC scheme aims to increase the admission of higher priority real time services by degrading the bandwidth of admitted lower priority connections on the basis of their channel status without deteriorating their QoS performance much. The performances of proposed algorithms are evaluated through simulation by considering the metrics like throughput, delay and number of connections admitted.
DYNAMIC CONGESTION CONTROL IN WDM OPTICAL NETWORKcscpconf
This paper is based on Wavelength Division Multiplexing (WDM) optical networking. In this optical networking, prior to data transfer, lightpath establishment between source and
destination nodes is usually carried out through a wavelength reservation protocol. This wavelength is reserved corresponding to a route between the source and destination and the
route is chosen following any standard routing protocol based on shortest path. The backward reservation protocol is implemented initially. A fixed connected and weighted network is
considered. The inputs of this implementation are the fixed network itself and its corresponding shortest path matrix. After this initial level of implementation, the average node usage over a time period is calculated and various thresholds for node usage are considered. Above threshold value, request arriving at that path selects its next shortest path. This concept is
implemented on various wavelengths. The output represents the performance issues of dynamic congestion control.
ADAPTIVE BANDWIDTH MANAGEMENT MODEL FOR WIRELESS MOBILE AD-HOC NETWORKIJCNCJournal
The quality of service (QoS) component in a mobile ad-hoc network has an active role in the current
network scenario. In a dynamic mobile ad hoc network, ensuring optimum QoS with a scarce network
resource is a significant challenge. To achieve QoS, it is essential to adopt some effective and efficient
mechanisms. We have proposed an adaptive bandwidth manager model (ABMM) which uses a bandwidthsharing concept along with the flexible bandwidth reservation algorithm (FBRA) for an effective, quick and
authentic data transfer. During real-time data transfer, to make communication effective, we make use of
bandwidth-sharing network design problems and the concept of reserving bandwidth in high-performance
networks. In our proposed model we are concentrating on the maximum utilization of resources, and using
the scheduling concept to provide the minimum required bandwidth guarantee to QoS flows. Our goal is to
reduce the delay in data transfer and enhance the throughput while properly utilizing the system resources.
Our simulation result also shows that our model improves the network performance.
Adaptive Bandwidth Management Model for Wireless Mobile Ad-hoc NetworkIJCNCJournal
The quality of service (QoS) component in a mobile ad-hoc network has an active role in the current network scenario. In a dynamic mobile ad hoc network, ensuring optimum QoS with a scarce network resource is a significant challenge. To achieve QoS, it is essential to adopt some effective and efficient mechanisms. We have proposed an adaptive bandwidth manager model (ABMM) which uses a bandwidthsharing concept along with the flexible bandwidth reservation algorithm (FBRA) for an effective, quick and authentic data transfer. During real-time data transfer, to make communication effective, we make use of bandwidth-sharing network design problems and the concept of reserving bandwidth in high-performance networks. In our proposed model we are concentrating on the maximum utilization of resources, and using the scheduling concept to provide the minimum required bandwidth guarantee to QoS flows. Our goal is to reduce the delay in data transfer and enhance the throughput while properly utilizing the system resources. Our simulation result also shows that our model improves the network performance.
REAL-TIME ROUTING PROTOCOLS FOR WIRELESS SENSOR NETWORKS: A SURVEYcscpconf
Wireless sensor networks can be termed as a new generation of distributed embedded systems
that has a capability of meeting broad range of real-time applications. Examples include
radiation monitoring, fire monitoring, border surveillance, and medical care to name but a few.
Wireless sensor networks that are deployed in time/mission-critical applications with highly
dynamic environments have to interact with the physical phenomenon under stringent timing
constraints and severe resource limitations. For such real-time wireless sensor networks,
designing and developing a real-time routing protocol that meets the required real-time
guarantee of data packets communication is a stimulating field of study that raised many
challenges and research issues. In this paper, we present a comprehensive survey of real-time
routing protocols in WSN, by discussing each protocol with its key features. Finally, we concluded this paper with open research issues and challenges of real-time routing in WSN.
IRJET- Survey on Enhancement of Manet Routing ProtocolIRJET Journal
This document discusses routing protocols for mobile ad hoc networks (MANETs). It provides an overview of several popular routing protocols, including AODV, DSDV, DSR, AOMDV and discusses their advantages and disadvantages. The document aims to analyze how the AOMDV protocol could be improved, for example by considering nodes' remaining battery power. It proposes developing a new routing algorithm based on this to achieve better performance than existing protocols.
Modified q aware scheduling algorithm for improved fairness in 802.16 j networksIJCNCJournal
Deployment of Multi-hop Relays in WiMax based Cellu
lar Networks is considered as a cost effective
solution to increase the Coverage area of Base Stat
ion and also to improve the Network Capacity with h
igh
quality short links. Scheduling became a challengin
g task in these Multi-hop Relay Wireless Cellular
Networks of IEEE 802.16j standard. H. Chen, X. Xie
and H. Wu proposed a Q-aware Scheduling
Algorithm in which back-pressure flow control mecha
nism is used to reflect current Q size of the Relay
s
and considered high back-pressure links to include
in Concurrent Transmission Scenarios, to maximize t
he
throughput. This focus on high back-pressure links,
leads to starvation of Mobile Stations having low
back-
pressure links, resulting unfairness in some cases.
To remedy this situation, a Fair Link Inclusion (F
LI)
mechanism is applied in Greedy Algorithm of Q-aware
Scheduling Algorithm. Simulation results show that
Modified Q-aware Scheduling Algorithm with FLI mech
anism has reasonable improvement in fairness and
maintaining steady throughput when compared with ex
isting algorithms.
Congestion Control and QOS Improvement for AEERG protocol in MANET pijans
QOS improvement has been a subject of intensive discussion. The research in the network field for
congestion control is by means of scheduling packets from different traffic flows for processing at a specific
node. When that particular node is selected for the transmission of all traffic flows since it has been chosen
as an emerging node for the shortest path in the adaptive energy efficient algorithm, queue scheduling
disciplines have been used to improve the quality of service. In this paper, we evaluate the performance of
four queuing disciplines (FIFO, PQ, RED and WFQ) which is implemented in the AEERG protocol. This
paper gives the NS-2 simulation results to compare their relative performance based on queuing delay,
packet drop rate and end-to-end delay for the above queuing techniques.
This document summarizes and evaluates scheduling algorithms for wireless IP networks that support multiclass traffic. It begins by describing the challenges of providing quality of service (QoS) over wireless networks due to time-varying transmission quality and location-dependent errors. It then reviews existing scheduling algorithms like weighted fair queuing (WFQ) and discusses their limitations in wireless environments. The document proposes a new scheduling mechanism that differentiates service between traffic classes and subclasses, allows compensation for non-real time traffic, and adjusts weights of real-time flows in error states to maintain throughput. Overall, the scheduling algorithm aims to provide QoS, fairness between flows, and flexibility to adapt to changing wireless channel conditions.
IMPROVED QUALITY OF SERVICE PROTOCOL FOR REAL TIME TRAFFIC IN MANETIJCNCJournal
This document proposes an improved quality of service protocol for real-time traffic in mobile ad hoc networks. It presents a modified version of the AODV routing protocol that provides two key improvements: 1) A balanced best-effort traffic aware route discovery mechanism that selects paths with lower ratios of best-effort packets to minimize their impact on real-time traffic. 2) A packet forwarding procedure that gives transmission priority to real-time packets by transmitting them immediately from the queue while best-effort packets have to wait, improving throughput for real-time applications. Simulation results show the proposed protocol performs better than basic AODV in terms of throughput and delay for real-time traffic.
A survey on routing algorithms and routing metrics for wireless mesh networksMohammad Siraj
This document summarizes a survey on routing algorithms and metrics for wireless mesh networks. It discusses the requirements of efficient mesh routing protocols including being distributed, adaptable to topology changes, loop-free, secure, scalable, and supporting quality of service. It reviews several important proactive routing protocols including destination-sequenced distance-vector routing, optimized link state routing, and mesh networking routing protocol. It also discusses reactive routing protocols and examples like dynamic source routing and ad hoc on-demand distance vector routing. Finally, it examines routing metrics and their impact on the performance of wireless mesh networks.
Traffic-aware adaptive server load balancing for softwaredefined networks IJECEIAES
Servers in data center networks handle heterogeneous bulk loads. Load balancing, therefore, plays an important role in optimizing network bandwidth and minimizing response time. A complete knowledge of the current network status is needed to provide a stable load in the network. The process of network status catalog in a traditional network needs additional processing which increases complexity, whereas, in software defined networking, the control plane monitors the overall working of the network continuously. Hence it is decided to propose an efficient load balancing algorithm that adapts SDN. This paper proposes an efficient algorithm TAASLB-traffic-aware adaptive server load balancing to balance the flows to the servers in a data center network. It works based on two parameters, residual bandwidth, and server capacity. It detects the elephant flows and forwards them towards the optimal server where it can be processed quickly. It has been tested with the Mininet simulator and gave considerably better results compared to the existing server load balancing algorithms in the floodlight controller. After experimentation and analysis, it is understood that the method provides comparatively better results than the existing load balancing algorithms.
Packet Transfer Rate & Robust Throughput for Mobile Adhoc NetworkEswar Publications
An ad-hoc wireless network is highly different considering dynamic stochastic process of its underlying links, leads to link breaks during data transaction. Hence, to provide free flow data transaction, many routing algorithms have the property of link recovery and maintenance procedures to minimize the loss of data during transmission. However these routing method do not guarantee reliable data transmission in some special application conditions with wide requirements on Packet delivery ratio and link quality of the network. Routing is a critical issue in MANET and hence the focus of this paper is the performance analysis of different routing protocols used in the
wireless network. We evaluate the ability of a mobile ad hoc wireless network to distribute flows across robust routes by introducing the robust throughput measure as a performance metric. The utility gained by the delivery of flow messages is based on the level of interruption experienced by the underlying transaction. We describe the mathematical calculation of a network’s robust throughput measure, as well as its robust throughput capacity. We introduce the robust flow admission and routing algorithm (RFAR) to provide for the timely and robust transport of flow transactions across mobile ad hoc wireless systems.
Energy maps for mobile wireless networks coherence time versues spreding peri...Mumbai Academisc
This document proposes a new approach to provide end-to-end quality of service (QoS) guarantees in mobile networks. Existing routing protocols cannot guarantee end-to-end QoS as paths change rapidly with node mobility. The document focuses on guaranteeing end-to-end per-packet energy consumption, which is important for networks where mechanical energy powers nodes. It constructs "energy maps" showing potential energy fields using local node measurements. If maps can be jointly built and disseminated within the "coherence time" before they change significantly, they can provide end-to-end energy guarantees for packets. Algorithms are described for path integration and dissemination to construct and spread maps network-wide.
A QUALITY OF SERVICE ARCHITECTURE FOR RESOURCE PROVISIONING AND RATE CONTROL ...ijasuc
Prioritized flow control is a type of QoS provisioning in which each class is provided a different QoS by
assigning priority to one class over another in terms of allocating resources. It is an effective means to
provide service differentiation to different class of service in mobile ad hoc networks. So the objective is to
achieve a desired level of service to high-priority flows so that the wireless medium is completely utilized
using adaptive rate control. In this paper, we propose to design QoS architecture for Bandwidth
Management and Rate Control in MANET. Our proposed QoS architecture contains an adaptive
bandwidth management technique which measures the available bandwidth at each node in real-time and
it is then propagated on demand by the QoS routing protocol. The source nodes perform call admission
control for different priority of flows based on the bandwidth information provided by the QoS routing.
The network bandwidth utilization is monitored continuously and network congestion is detected in
advance. Then a rate control mechanism is used to regulate best-effort traffic.
Similar to SELFLESS DISTRIBUTED CREDIT BASED SCHEDULING FOR IMPROVED QOS IN IEEE 802.16 WBA NETWORKS (20)
Beyond Degrees - Empowering the Workforce in the Context of Skills-First.pptxEduSkills OECD
Iván Bornacelly, Policy Analyst at the OECD Centre for Skills, OECD, presents at the webinar 'Tackling job market gaps with a skills-first approach' on 12 June 2024
ISO/IEC 27001, ISO/IEC 42001, and GDPR: Best Practices for Implementation and...PECB
Denis is a dynamic and results-driven Chief Information Officer (CIO) with a distinguished career spanning information systems analysis and technical project management. With a proven track record of spearheading the design and delivery of cutting-edge Information Management solutions, he has consistently elevated business operations, streamlined reporting functions, and maximized process efficiency.
Certified as an ISO/IEC 27001: Information Security Management Systems (ISMS) Lead Implementer, Data Protection Officer, and Cyber Risks Analyst, Denis brings a heightened focus on data security, privacy, and cyber resilience to every endeavor.
His expertise extends across a diverse spectrum of reporting, database, and web development applications, underpinned by an exceptional grasp of data storage and virtualization technologies. His proficiency in application testing, database administration, and data cleansing ensures seamless execution of complex projects.
What sets Denis apart is his comprehensive understanding of Business and Systems Analysis technologies, honed through involvement in all phases of the Software Development Lifecycle (SDLC). From meticulous requirements gathering to precise analysis, innovative design, rigorous development, thorough testing, and successful implementation, he has consistently delivered exceptional results.
Throughout his career, he has taken on multifaceted roles, from leading technical project management teams to owning solutions that drive operational excellence. His conscientious and proactive approach is unwavering, whether he is working independently or collaboratively within a team. His ability to connect with colleagues on a personal level underscores his commitment to fostering a harmonious and productive workplace environment.
Date: May 29, 2024
Tags: Information Security, ISO/IEC 27001, ISO/IEC 42001, Artificial Intelligence, GDPR
-------------------------------------------------------------------------------
Find out more about ISO training and certification services
Training: ISO/IEC 27001 Information Security Management System - EN | PECB
ISO/IEC 42001 Artificial Intelligence Management System - EN | PECB
General Data Protection Regulation (GDPR) - Training Courses - EN | PECB
Webinars: https://pecb.com/webinars
Article: https://pecb.com/article
-------------------------------------------------------------------------------
For more information about PECB:
Website: https://pecb.com/
LinkedIn: https://www.linkedin.com/company/pecb/
Facebook: https://www.facebook.com/PECBInternational/
Slideshare: http://www.slideshare.net/PECBCERTIFICATION
A review of the growth of the Israel Genealogy Research Association Database Collection for the last 12 months. Our collection is now passed the 3 million mark and still growing. See which archives have contributed the most. See the different types of records we have, and which years have had records added. You can also see what we have for the future.
हिंदी वर्णमाला पीपीटी, hindi alphabet PPT presentation, hindi varnamala PPT, Hindi Varnamala pdf, हिंदी स्वर, हिंदी व्यंजन, sikhiye hindi varnmala, dr. mulla adam ali, hindi language and literature, hindi alphabet with drawing, hindi alphabet pdf, hindi varnamala for childrens, hindi language, hindi varnamala practice for kids, https://www.drmullaadamali.com
Chapter wise All Notes of First year Basic Civil Engineering.pptxDenish Jangid
Chapter wise All Notes of First year Basic Civil Engineering
Syllabus
Chapter-1
Introduction to objective, scope and outcome the subject
Chapter 2
Introduction: Scope and Specialization of Civil Engineering, Role of civil Engineer in Society, Impact of infrastructural development on economy of country.
Chapter 3
Surveying: Object Principles & Types of Surveying; Site Plans, Plans & Maps; Scales & Unit of different Measurements.
Linear Measurements: Instruments used. Linear Measurement by Tape, Ranging out Survey Lines and overcoming Obstructions; Measurements on sloping ground; Tape corrections, conventional symbols. Angular Measurements: Instruments used; Introduction to Compass Surveying, Bearings and Longitude & Latitude of a Line, Introduction to total station.
Levelling: Instrument used Object of levelling, Methods of levelling in brief, and Contour maps.
Chapter 4
Buildings: Selection of site for Buildings, Layout of Building Plan, Types of buildings, Plinth area, carpet area, floor space index, Introduction to building byelaws, concept of sun light & ventilation. Components of Buildings & their functions, Basic concept of R.C.C., Introduction to types of foundation
Chapter 5
Transportation: Introduction to Transportation Engineering; Traffic and Road Safety: Types and Characteristics of Various Modes of Transportation; Various Road Traffic Signs, Causes of Accidents and Road Safety Measures.
Chapter 6
Environmental Engineering: Environmental Pollution, Environmental Acts and Regulations, Functional Concepts of Ecology, Basics of Species, Biodiversity, Ecosystem, Hydrological Cycle; Chemical Cycles: Carbon, Nitrogen & Phosphorus; Energy Flow in Ecosystems.
Water Pollution: Water Quality standards, Introduction to Treatment & Disposal of Waste Water. Reuse and Saving of Water, Rain Water Harvesting. Solid Waste Management: Classification of Solid Waste, Collection, Transportation and Disposal of Solid. Recycling of Solid Waste: Energy Recovery, Sanitary Landfill, On-Site Sanitation. Air & Noise Pollution: Primary and Secondary air pollutants, Harmful effects of Air Pollution, Control of Air Pollution. . Noise Pollution Harmful Effects of noise pollution, control of noise pollution, Global warming & Climate Change, Ozone depletion, Greenhouse effect
Text Books:
1. Palancharmy, Basic Civil Engineering, McGraw Hill publishers.
2. Satheesh Gopi, Basic Civil Engineering, Pearson Publishers.
3. Ketki Rangwala Dalal, Essentials of Civil Engineering, Charotar Publishing House.
4. BCP, Surveying volume 1
How to Manage Your Lost Opportunities in Odoo 17 CRMCeline George
Odoo 17 CRM allows us to track why we lose sales opportunities with "Lost Reasons." This helps analyze our sales process and identify areas for improvement. Here's how to configure lost reasons in Odoo 17 CRM
How to Setup Warehouse & Location in Odoo 17 InventoryCeline George
In this slide, we'll explore how to set up warehouses and locations in Odoo 17 Inventory. This will help us manage our stock effectively, track inventory levels, and streamline warehouse operations.
Strategies for Effective Upskilling is a presentation by Chinwendu Peace in a Your Skill Boost Masterclass organisation by the Excellence Foundation for South Sudan on 08th and 09th June 2024 from 1 PM to 3 PM on each day.
SELFLESS DISTRIBUTED CREDIT BASED SCHEDULING FOR IMPROVED QOS IN IEEE 802.16 WBA NETWORKS
1. International Journal of Wireless & Mobile Networks (IJWMN), Vol 1, No 2, November 2009
118
SELFLESS DISTRIBUTED CREDIT BASED
SCHEDULING FOR IMPROVED QOS IN IEEE 802.16
WBA NETWORKS
C.Kalyana Chakravarthy1
and Prof. P.V.G.D. Prasad Reddy2
1
Department of CSE, M.V.G.R.College of Engineering,Vizianagaram,India
kch.chilukuri@gmail.com
2
Prof. P.V.G.D.Prasad Reddy, Department of CS&SE,Andhra University College of
Engineering,Visakhapatnam,India
prof.prasadreddy@gmail.com
ABSTRACT
Packet and flow scheduling algorithms for WiMAX has been a topic of interest for a long time since the
very inception of WiMAX networks. WiMAX offers advantages particularly in terms of Quality of service
it offers over a longer range at the MAC level. In our paper, we propose two credit based scheduling
schemes one in which completed flows distributes the left over credits equally to all higher priority
flows(FDCBSS) and another in which completed flows give away all the excess credits to the highest
priority uncompleted flow(SDCBSS). Both the schemes are compatible with 802.16 MAC protocol and
can efficiently serve real time bursty traffic with reduced latency and hence improved QOS for real time
flows. We compare the two proposed schemes for their latency, bandwidth utilization and throughput for
real time burst flows with the basic Deficit Round Robin scheduling scheme.
KEYWORDS
scheduling; quality of service; latency;
1. INTRODUCTION
IEEE 802.16 in PMP mode, defines five types of scheduling services[1] to support quality of
service. They can be classified as Unsolicited Grant Services(UGS), Real-time Polling
services(rtPS), Extended rtPS, non Real-time polling services(nrtPS) and Best Effort(BE).
Application of Unsolicited grant services (UGS) is Voice over IP (VoIP) without silence
suppression. The mandatory service flow parameters that define this service are maximum
sustained traffic rate, maximum latency, tolerated jitter, and request/transmission policy.
Applications of Real-time Polling service (rtPS) are Streaming audio and video, MPEG (Motion
Picture Experts Group) encoded. The mandatory service flow parameters that define this service
are minimum reserved traffic rate, maximum sustained traffic rate, maximum latency, and
request/transmission policy.
Application of Extended real-time is VoIP with silence suppression. The mandatory service
flow parameters are guaranteed data rate and delay.
Application of Non-real-time Polling service is File Transfer Protocol (FTP). The mandatory
service flow parameters to define this service are minimum reserved traffic rate, maximum
sustained traffic rate, traffic priority, and request/transmission policy.
Applications of Best-effort service (BE) are Web browsing, data transfer. The mandatory
service flow parameters to define this service are maximum sustained traffic rate, traffic
priority, and request/transmission policy.
2. International Journal of Wireless & Mobile Networks (IJWMN), Vol 1, No 2, November 2009
119
Providing end-to-end QoS requires mechanisms in both the control plane and the data plane.
Control Plane mechanisms allow the users and the network to negotiate and agree on the
required QoS specifications and let the network appropriately allocate resources to each service.
Data plane mechanisms are required to ensure the agreed-on QoS requirements by controlling
the amount of network resources that each application/user can consume. Data Plane methods
ensure the agreed-on QoS by classifying the incoming packets into several queues and
allocating appropriate resources to each queue. Classification is done by inspecting the headers
of incoming packets, resource allocation is done by using appropriate scheduling algorithms and
buffer-management techniques for storing and forwarding packets in each queue. Two
approaches called per-flow handling where we have a separate queue for each individual session
or queue and aggregate handling where queues have packets from different flows exist. Both
these methods offer their own advantages .While the later method reduces burden of state
management and makes processing burden on nodes more scalable, the former method offers
better QOS for the end users. Our method uses the first approach, since the main motive of our
algorithm is to improve the Quality of service.
In WiMAX, the MAC layer at the base station is fully responsible for allocating bandwidth to
all users, in both the uplink and the downlink. The only time the MS has some control over
bandwidth allocation is when it has multiple sessions or connections with the BS. In that case,
the BS allocates bandwidth to the MS in the aggregate, and it is up to the MS to apportion it
among the multiple connections. All other scheduling on the downlink and uplink is done by the
BS. For the downlink, the BS can allocate bandwidth to each MS, based on the needs of the
incoming traffic, without involving the MS. For the uplink, allocations have to be based on
requests from the MS.
Different connection management strategies have been proposed, but the most common one is
of management connections first, real-time connections followed by non-real time connections
and finally Best Effort connections.
In our paper, we propose and compare two credit based scheduling schemes Fair distributed
credit based scheduling scheme and Selfless distributed credit based scheduling scheme. The
first one is based on distribution of excess credits equally between all higher priority flows
while the other proposed scheme is based on distribution of excess credits to the highest priority
flow which is yet to be completed. The schemes are used to schedule flows between two classes
of flows, real-time and non real-time flows.
We compare the two schemes in terms of the QOS parameters namely the throughput,
bandwidth utilization, maximum latency etc., and observe that though the former one is based
on fair scheduling, the latter in fact offers better performance under similar conditions compared
to the basic DRR scheduling scheme.
2. PREVIOUS WORK
A significant amount of work has already gone into scheduling disciplines that provide delay
guarantees and fairness.
Time stamp scheduler essentially uses the idea of assigning time stamps to packets and then
transmitting the packets in some order that achieves fairness. WFQ [3] and WF2
Q [4]
algorithms fall into this category. However, both of the schemes require a reference with the
GPS server to be maintained. Variants of WFQ include Self-Clocked Fair Scheduling [5] and
Virtual Clock [6], which do not need to maintain a reference GPS server and hence can compute
the time stamp in a more efficient way. Though time stamp schedulers have good delay
properties, their processing time is quite high.
Round-robin schedulers [7][8][9][10] are the other broad class of work-conserving schedulers.
These schedulers typically assign time slots to flows in some sort of round-robin fashion.
3. International Journal of Wireless & Mobile Networks (IJWMN), Vol 1, No 2, November 2009
120
Though they have better complexity compared to packet schedulers, however they have poor
delay characteristics, particularly for packets of varying sizes. Several improvements have been
proposed to improve the delay properties of the basic Round-robin scheduler. There is another
class of algorithms that try to combine the tight delay bound of time stamp based schedulers and
the low time complexity of round robin based schedulers. They usually adopt a basic round
robin like scheduling policy plus time stamp based scheduling on a reduced number of units
[11]. Bin Sort Fair Queueing [12] is based on arranging packets into different bins based on
their time stamps and scheduling in a FIFO manner.
Stratified Round Robin [13] uses the round robin approach for inter-class scheduling and the
time stamp approach for intra-class scheduling after grouping flows into respective classes.
Recently proposed algorithms like ADRR [14] enhance the deficit round robin scheduling
discipline by taking into account the channel quality experienced by the transmitting node. The
ADRR scheduler is designed to achieve performance isolation among links characterized by
heterogeneous channel conditions.
In the DRR scheme, Stochaic fair queuing is used to assign flows to queues. For servicing the
queues, Round-robin servicing is used, with a quantum of service attached to each queue. It
differs from the traditional Round-robin in that if a queue is unable to send a packet in the
previous round because a packet was too large, the remainder from the previous quantum is
added to the quantum for the next round. Queues that are not completely serviced in a round are
compensated in the next round. However, once a flow is serviced, irrespective of its weight, it
must wait for N−1 other flows to be serviced until it is serviced again. Also, during each round,
a flow transmits its entire quantum at once. As a result, DRR has poor delay and burstiness
properties.
The Smoothed Round Robin discipline addresses the output burstiness problem of DRR. This is
done by spreading the quantum allocated to a flow over an entire round using a Weight Spread
Sequence. Although SRR also results in better delay bounds than DRR, the worst case delay
experienced by a packet is still proportional to N, the number of flows.
3. FAIR DISTRIBUTED CREDIT BASED SCHEDULING SCHEME (FDCBSS)
In the FDCBSS, flows that complete first donate all their excess credits(debit), in addition to the
quantum size equally between all the higher priority flows in the subsequent rounds until all the
credits are exhausted.
Our model uses Inter-class scheduling for servicing the flows. It assumes fixed scheduling
intervals between flows associated with a particular flow class. For each class Fk, the length of a
scheduling interval is always 2 k
slots. If a scheduling interval for Fk starts at slot t, the next
scheduling interval for Fk starts at slot t + 2k, and so on. A flow is backlogged if it has not
received it’s fair share of bandwidth, i.e it still requires to be serviced in the next rounds.
Backlogged flows are considered to be active. After every pending flow is serviced in the
current time slot, clock time is tc is incremented. Otherwise, tc is advanced to the earliest time
when some flow class becomes pending again. Also, in our model the bandwidth is assumed to
be shared equally between the flows.
Figure 1.The Simulation Setup
4. International Journal of Wireless & Mobile Networks (IJWMN), Vol 1, No 2, November 2009
121
The following scenario explains the operation of the FDCBSS. For simplicity, we have chosen
the quantum size to be at least equal to the maximum packet size and the service pointer
advances after each flow has been serviced.
Figure 2.Beginning of Round one
Figure 3.End of Round one
Figure 4.Beginning of Round two for FDCBSS
It can be noted that flows which are complete donate their debit to the highest priority flows yet
to be completed, while other flows proceed the same way as in the DRR scheme[2].
Figure 5.The FDCBSS algorithm
5. International Journal of Wireless & Mobile Networks (IJWMN), Vol 1, No 2, November 2009
122
4. SELFLESS DISTRIBUTED CREDIT BASED SCHEDULING SCHEME (SDCBSS)
In the SDCBSS, flows that complete first donate all their excess credits (debit), in addition to
the quantum size in the next round to the highest priority flow that has not yet been complete.
This enables the higher priority flows to only hold the credits as long as required and donate the
remaining credits to the subsequent higher priority flow once it is complete.
The SCBSS differs from other scheduling schemes as in [15] where generally a completed flow
distributes its credits continuously in subsequent rounds to the higher priority flows until it has
no more credits to distribute.
The following scenario explains the operation of the SDCBSS. For simplicity, we have chosen
the quantum size to be at least equal to the maximum packet size and the service pointer
advances after each flow has been serviced.
Figure 6.Beginning of Round one
Figure 7.End of Round one
Figure 8.Beginning of Round two
6. International Journal of Wireless & Mobile Networks (IJWMN), Vol 1, No 2, November 2009
123
Figure 9.The SDCBSS algorithm
5. SIMULATION RESULTS
We use a custom simulator written in java. The simulation runs in two threads - the flow
generator that generates packet and the scheduler that checks at every configurable scheduling
period and schedules the packets. Both these modules can be run either concurrently or
independently. Simulation has been carried out on 20 queues, each containing maximum
packets of variable size, for different quantum sizes for 20 seconds and the results have been
evaluated. The packets are generated according to Poisson arrival process. For our results we
limited the number of flows so that the sum total of their minimum bandwidth requirements
matches the maximum capacity of the network.
All flows are critical and are arranged in the decreasing order of their priorities. Our algorithm
has shown reasonable improvement in terms of latency of critical flows, which makes it suitable
for real time communications such as real time Video-on demand. If all latency critical flows
meet the requirements, the maximum delay between latency critical flows should not exceed (n
* s) + Max/B where n is number of latency critical flows, B bandwidth of the output line, s is
maximum size of packet in a flow, Max is maximum quantum size.
Figure 10.Flow ID VS bandwidth utilization
Figure 11.Quantum Size VS avg. throughput for 20 flows
7. International Journal of Wireless & Mobile Networks (IJWMN), Vol 1, No 2, November 2009
124
Figure 12.Flow ID VS latency
6. CONCLUSIONS
In our work, we have proposed two scheduling schemes FDCBSS and SDCBSS for scheduling
real time flows. It was observed from the results that while both the schemes perform better
compared with the Deficit Round Robin scheduling scheme, the latter is more suitable for real
time flows under unsteady traffic conditions. In our method, any excessive idle bandwidth is
reallocated to avoid wasting of available transmission capacity. However, in both cases, we
assume scheduling under error free conditions.
Scheduling based on channel conditions is an active topic of research and the above scheduling
schemes can easily be extended for example to consider back-off time required for
retransmissions in erroneous channels at the link layer. With the awareness of channel condition
and with knowledge of applications, schedulers can maximize the system throughput or support
more users. Scheduling on Multiple Input Multiple Output channels with multiple antennas,
scheduling on multi-hop networks for end to end service guarantees are also areas that need
further improvement.
REFERENCES
[1] A. Sayenko, O. Alanen, J. Karhula and T. Hämäläinen,” Ensuring the QoS Requirements in 802.16
Scheduling”, Proceedings of IEEE/ACM MSWiM 2006, Torremolinos, Spain, Oct. 2006.
[2] M. Shreedhar and G.Varghese,”Efficient fair queuing using deficit Round Robin”, in Proc.
SIDCOMM ’95 Boston, MA, Aug 1995.
[3] Demers,A.S Keshavand S.Shenkar,1989,”Analysis and simulation of a fair queuing problem”,
Proceedings of the Symposium and Communications Architectures and protocols, September 25-
27,A.C.M NewYork, USA pp:1-12.
[4] Bennet , J.C.R and H.Zhang,1996,”WF2Q: Worst –case fair weighted fair queuing”, Proceedings of
the INFOCOM, March 24-28,San Fransisco,CA, pp:1-9
[5] Golestani,S.J.1994,”A self clocked fair queuing scheme for broad band applications”, Proceedings of
the 13th
IEEE INFOCOM’94, Networking for Global Communications, June 12-16, Toronto, Ont,
Canada, pp: 636-646.
[6] L. Zhang, “A new architecture for Packet switched network protocols”, PhD dissertation,
Massachesets Institute of technology, July 1989
[7] Lenzini, L., Mingozzi, E., and Stea, G. Aliquem: “a novel DRR implementation to achieve better
latency and fairness at O(1) complexity,” In IWQoS’02 (2002).
[8] “The Smoothed Round-Robin Scheduler”, Paul Southerington, Member, IEEE, ECE742, 28 APRIL
2005.
8. International Journal of Wireless & Mobile Networks (IJWMN), Vol 1, No 2, November 2009
125
[9] B. Bensaou, K. Chan, and D. Tsang, “Credit-based fair queuing (CBFQ): A simple and feasible
scheduling algorithm for packet networks”, IEEE ATM97 Workshop, pp. 589594, May 1997.
[10] Dessislava Nikolova and Chris Blondia, “Last-Backlogged First-Served Deficit Round Robin
(LBFS-DRR) Packet Scheduling Algorithm”, 15th
IEEE International conference on networks,Nov.2007.
[11] Deng Pan, Yuanyuan Yang, “Credit Based Fair Scheduling for Packet Switched Networks”, IEEE
INFOCOM’05.
[12] S. Cheung and C. Pencea, “BSFQ: bin sort fair queuing,” IEEE INFOCOM ’02, pp. 1640-1649, New
York, Jun. 2002.
[13] S. Ramabhadran, J. Pasquale, “Stratified round robin: a low complexity packet scheduler with
bandwidth fairness and bounded delay,” ACM SIGCOMM ’03, pp. 239-250, Karlsruhe, Germany, Aug.
2003.
[14] Riggio, R. Miorandi, D. Chlamtac, “Airtime Deficit Round Robin (ADRR) packet scheduling
algorithm,” 5th
IEEE International conference on Mobile Ad Hoc and Sensor Systems-MASS’08.
[15] Tsung-Yu Tsai, Zsehong Tsai, “Design of a Packet Scheduling Scheme for Downlink Channel in
IEEE 802.16 BWA Systems”, in WCNC’08 (2008).
Authors
Prof. P.V.G.D Prasad Reddy has a teaching
experience of over twenty years. He is currently
serving as the Registrar at the Andhra
University. He has 14 publications in
International Journals and 18 papers in
conferences. His Research areas include Soft
Computing, Software Architectures, Knowledge
Discovery from Databases , Image Processing ,
Number theory & Cryptosystems.
C.Kalyana Chakravarthy has a teaching
experience of over nine years and is currently
working as Associate prof. in M.V.G.R.College
of Engineering, Vizianagaram. He has been
actively working on diverse areas of network
caching, MANETs routing protocols, resource
allocation and scheduling in WiMAX, Mesh
networks