SlideShare uma empresa Scribd logo
1 de 3
GLOBALSOFT TECHNOLOGIES 
Stochastic Bandwidth Estimation in Networks With 
Random Service 
ABSTRACT: 
Numerous methods for available bandwidth estimation have been developed for 
wireline networks, and their effectiveness is well-documented. However, most methods 
fail to predict bandwidth availability reliably in a wireless setting. It is accepted that the 
increased variability of wireless channel conditions makes bandwidth estimation more 
difficult. However, a (satisfactory) explanation why these methods are failing ismissing. 
This paper seeks to provide insights into the problem of bandwidth estimation in 
wireless networks or, more broadly, in networks with random service. We express 
bandwidth availability in terms of bounding functions with a defined violation 
probability. Exploiting properties of a stochastic min-plus linear system theory, the task 
of bandwidth estimation is formulated as inferring an unknown bounding function from 
measurements of probing traffic. We present derivations showing that simply using the 
expected value of the available bandwidth in networks with random service leads to a 
systematic overestimation of the traffic departures. Furthermore, we show that in a 
multihop setting with random service at each node, available bandwidth estimates 
requires observations over (in principle infinitely) long time periods. We propose a new 
estimation method for random service that is based on iterative constant-rate probes 
that take advantage of statistical methods. We show how our estimation method can be 
realized to achieve both good accuracy and confidence levels. We evaluate our method 
for wired single-and multihop networks, as well as for wireless networks. 
EXISTING SYSTEM: 
IEEE PROJECTS & SOFTWARE DEVELOPMENTS 
IEEE FINAL YEAR PROJECTS|IEEE ENGINEERING PROJECTS|IEEE STUDENTS PROJECTS|IEEE 
BULK PROJECTS|BE/BTECH/ME/MTECH/MS/MCA PROJECTS|CSE/IT/ECE/EEE PROJECTS 
CELL: +91 98495 39085, +91 99662 35788, +91 98495 57908, +91 97014 40401 
Visit: www.finalyearprojects.org Mail to:ieeefinalsemprojects@gmail.com
This paper seeks to provide insights into the problem of bandwidth estimation in 
wireless networks or, more broadly, in networks with random service. We express 
bandwidth availability in terms of bounding functions with a defined violation 
probability. Exploiting properties of a stochastic min-plus linear system theory, the task 
of bandwidth estimation is formulated as inferring an unknown bounding function from 
measurements of probing traffic. We present derivations showing that simply using the 
expected value of the available bandwidth in networks with random service leads to a 
systematic overestimation of the traffic departures. Most existing bandwidth estimation 
methods seek to find the long-term available bandwidth as defined in Section 
II.Wepresent an example to illustrate that the long-term availablebandwidth only 
presents part of the information on the availableservice in a network. 
PROPOSED SYSTEM: 
Proposed approaches in the literature have addressed these issues by adapting or 
revising bandwidth estimation methods developed for wireline networks. We propose a 
new estimation method for random service that isbased on iterative constant-rate 
probes that take advantage ofstatistical methods. We show how our estimation method 
can berealized to achieve both good accuracy and confidence levels. Weevaluate our 
method for wired single-and multihop networks, aswell as for wireless networks 
CONCLUSION: 
We have presented a system-theoretic foundation for bandwidth estimation of networks 
with random service, where we used the framework of the stochastic network calculus 
to derive a method that estimates an -effective service curve from steady-state backlog 
or delay quantiles observed by packet train probes. The service curve model extends to 
networks of nodes, as well as to non-work-conserving systems. The -effective service 
curve characterizes service availability at different timescales and recovers the long-term 
available bandwidth as its limiting rate. While ideal measurements require an 
infinite repetition of infinitely long packet trains, we showed that practical estimation
methods can be achieved by applying statistical tests and using appropriate heuristics. 
We found that cross traffic variability, the number of bottleneck links, and the target 
accuracy of the estimate have a significant impact on the amount of probes required. 
We presented measurement examples, which showed that estimates of effective service 
curves can disclose essential characteristics of random service in wired and wireless 
networks, which are not reflected in the long-term available bandwidth. 
SYSTEM CONFIGURATION:- 
HARDWARE CONFIGURATION:- 
 Processor - Pentium –IV 
 Speed - 1.1 Ghz 
 RAM - 256 MB(min) 
 Hard Disk - 20 GB 
 Key Board - Standard Windows Keyboard 
 Mouse - Two or Three Button Mouse 
 Monitor - SVGA 
SOFTWARE CONFIGURATION:- 
 Operating System : Windows XP 
 Programming Language : JAVA 
 Java Version : JDK 1.6 & above.

Mais conteúdo relacionado

Mais de IEEEFINALSEMSTUDENTSPROJECTS

Mais de IEEEFINALSEMSTUDENTSPROJECTS (16)

2014 IEEE JAVA NETWORKING PROJECT Stars a statistical traffic pattern discove...
2014 IEEE JAVA NETWORKING PROJECT Stars a statistical traffic pattern discove...2014 IEEE JAVA NETWORKING PROJECT Stars a statistical traffic pattern discove...
2014 IEEE JAVA NETWORKING PROJECT Stars a statistical traffic pattern discove...
 
2014 IEEE JAVA NETWORKING PROJECT Secure continuous aggregation in wireless s...
2014 IEEE JAVA NETWORKING PROJECT Secure continuous aggregation in wireless s...2014 IEEE JAVA NETWORKING PROJECT Secure continuous aggregation in wireless s...
2014 IEEE JAVA NETWORKING PROJECT Secure continuous aggregation in wireless s...
 
2014 IEEE JAVA NETWORKING PROJECT Secure and efficient data transmission for ...
2014 IEEE JAVA NETWORKING PROJECT Secure and efficient data transmission for ...2014 IEEE JAVA NETWORKING PROJECT Secure and efficient data transmission for ...
2014 IEEE JAVA NETWORKING PROJECT Secure and efficient data transmission for ...
 
2014 IEEE JAVA NETWORKING PROJECT Receiver based flow control for networks in...
2014 IEEE JAVA NETWORKING PROJECT Receiver based flow control for networks in...2014 IEEE JAVA NETWORKING PROJECT Receiver based flow control for networks in...
2014 IEEE JAVA NETWORKING PROJECT Receiver based flow control for networks in...
 
2014 IEEE JAVA NETWORKING PROJECT Qos aware geographic opportunistic routingi...
2014 IEEE JAVA NETWORKING PROJECT Qos aware geographic opportunistic routingi...2014 IEEE JAVA NETWORKING PROJECT Qos aware geographic opportunistic routingi...
2014 IEEE JAVA NETWORKING PROJECT Qos aware geographic opportunistic routingi...
 
2014 IEEE JAVA NETWORKING PROJECT Optimal multicast capacity and delay tradeo...
2014 IEEE JAVA NETWORKING PROJECT Optimal multicast capacity and delay tradeo...2014 IEEE JAVA NETWORKING PROJECT Optimal multicast capacity and delay tradeo...
2014 IEEE JAVA NETWORKING PROJECT Optimal multicast capacity and delay tradeo...
 
2014 IEEE JAVA NETWORKING PROJECT On the excess bandwidth allocation in isp t...
2014 IEEE JAVA NETWORKING PROJECT On the excess bandwidth allocation in isp t...2014 IEEE JAVA NETWORKING PROJECT On the excess bandwidth allocation in isp t...
2014 IEEE JAVA NETWORKING PROJECT On the excess bandwidth allocation in isp t...
 
2014 IEEE JAVA NETWORKING PROJECT Mobile data offloading how much can wi-fi d...
2014 IEEE JAVA NETWORKING PROJECT Mobile data offloading how much can wi-fi d...2014 IEEE JAVA NETWORKING PROJECT Mobile data offloading how much can wi-fi d...
2014 IEEE JAVA NETWORKING PROJECT Mobile data offloading how much can wi-fi d...
 
2014 IEEE JAVA NETWORKING PROJECT Hop by-hop routing in wireless mesh network...
2014 IEEE JAVA NETWORKING PROJECT Hop by-hop routing in wireless mesh network...2014 IEEE JAVA NETWORKING PROJECT Hop by-hop routing in wireless mesh network...
2014 IEEE JAVA NETWORKING PROJECT Hop by-hop routing in wireless mesh network...
 
2014 IEEE JAVA NETWORKING PROJECT Hop by-hop message Authentication and sourc...
2014 IEEE JAVA NETWORKING PROJECT Hop by-hop message Authentication and sourc...2014 IEEE JAVA NETWORKING PROJECT Hop by-hop message Authentication and sourc...
2014 IEEE JAVA NETWORKING PROJECT Hop by-hop message Authentication and sourc...
 
2014 IEEE JAVA NETWORKING PROJECT Hop by-hop message uthenticationand source ...
2014 IEEE JAVA NETWORKING PROJECT Hop by-hop message uthenticationand source ...2014 IEEE JAVA NETWORKING PROJECT Hop by-hop message uthenticationand source ...
2014 IEEE JAVA NETWORKING PROJECT Hop by-hop message uthenticationand source ...
 
2014 IEEE JAVA NETWORKING PROJECT Fair scheduling in cellular systems in the ...
2014 IEEE JAVA NETWORKING PROJECT Fair scheduling in cellular systems in the ...2014 IEEE JAVA NETWORKING PROJECT Fair scheduling in cellular systems in the ...
2014 IEEE JAVA NETWORKING PROJECT Fair scheduling in cellular systems in the ...
 
2014 IEEE JAVA NETWORKING PROJECT Cost effective resource allocation of overl...
2014 IEEE JAVA NETWORKING PROJECT Cost effective resource allocation of overl...2014 IEEE JAVA NETWORKING PROJECT Cost effective resource allocation of overl...
2014 IEEE JAVA NETWORKING PROJECT Cost effective resource allocation of overl...
 
2014 IEEE JAVA NETWORKING PROJECT Compactdfa scalable pattern matching usingl...
2014 IEEE JAVA NETWORKING PROJECT Compactdfa scalable pattern matching usingl...2014 IEEE JAVA NETWORKING PROJECT Compactdfa scalable pattern matching usingl...
2014 IEEE JAVA NETWORKING PROJECT Compactdfa scalable pattern matching usingl...
 
2014 IEEE JAVA NETWORKING PROJECT Boundary cutting for packet classification
2014 IEEE JAVA NETWORKING PROJECT Boundary cutting for packet classification2014 IEEE JAVA NETWORKING PROJECT Boundary cutting for packet classification
2014 IEEE JAVA NETWORKING PROJECT Boundary cutting for packet classification
 
2014 IEEE JAVA NETWORKING PROJECT Automatic test packet generation
2014 IEEE JAVA NETWORKING PROJECT Automatic test packet generation2014 IEEE JAVA NETWORKING PROJECT Automatic test packet generation
2014 IEEE JAVA NETWORKING PROJECT Automatic test packet generation
 

Último

FULL ENJOY Call Girls In Mahipalpur Delhi Contact Us 8377877756
FULL ENJOY Call Girls In Mahipalpur Delhi Contact Us 8377877756FULL ENJOY Call Girls In Mahipalpur Delhi Contact Us 8377877756
FULL ENJOY Call Girls In Mahipalpur Delhi Contact Us 8377877756
dollysharma2066
 
Integrated Test Rig For HTFE-25 - Neometrix
Integrated Test Rig For HTFE-25 - NeometrixIntegrated Test Rig For HTFE-25 - Neometrix
Integrated Test Rig For HTFE-25 - Neometrix
Neometrix_Engineering_Pvt_Ltd
 
VIP Call Girls Ankleshwar 7001035870 Whatsapp Number, 24/07 Booking
VIP Call Girls Ankleshwar 7001035870 Whatsapp Number, 24/07 BookingVIP Call Girls Ankleshwar 7001035870 Whatsapp Number, 24/07 Booking
VIP Call Girls Ankleshwar 7001035870 Whatsapp Number, 24/07 Booking
dharasingh5698
 
Call Girls in Ramesh Nagar Delhi 💯 Call Us 🔝9953056974 🔝 Escort Service
Call Girls in Ramesh Nagar Delhi 💯 Call Us 🔝9953056974 🔝 Escort ServiceCall Girls in Ramesh Nagar Delhi 💯 Call Us 🔝9953056974 🔝 Escort Service
Call Girls in Ramesh Nagar Delhi 💯 Call Us 🔝9953056974 🔝 Escort Service
9953056974 Low Rate Call Girls In Saket, Delhi NCR
 

Último (20)

(INDIRA) Call Girl Aurangabad Call Now 8617697112 Aurangabad Escorts 24x7
(INDIRA) Call Girl Aurangabad Call Now 8617697112 Aurangabad Escorts 24x7(INDIRA) Call Girl Aurangabad Call Now 8617697112 Aurangabad Escorts 24x7
(INDIRA) Call Girl Aurangabad Call Now 8617697112 Aurangabad Escorts 24x7
 
University management System project report..pdf
University management System project report..pdfUniversity management System project report..pdf
University management System project report..pdf
 
Call Girls Pimpri Chinchwad Call Me 7737669865 Budget Friendly No Advance Boo...
Call Girls Pimpri Chinchwad Call Me 7737669865 Budget Friendly No Advance Boo...Call Girls Pimpri Chinchwad Call Me 7737669865 Budget Friendly No Advance Boo...
Call Girls Pimpri Chinchwad Call Me 7737669865 Budget Friendly No Advance Boo...
 
FULL ENJOY Call Girls In Mahipalpur Delhi Contact Us 8377877756
FULL ENJOY Call Girls In Mahipalpur Delhi Contact Us 8377877756FULL ENJOY Call Girls In Mahipalpur Delhi Contact Us 8377877756
FULL ENJOY Call Girls In Mahipalpur Delhi Contact Us 8377877756
 
DC MACHINE-Motoring and generation, Armature circuit equation
DC MACHINE-Motoring and generation, Armature circuit equationDC MACHINE-Motoring and generation, Armature circuit equation
DC MACHINE-Motoring and generation, Armature circuit equation
 
Generative AI or GenAI technology based PPT
Generative AI or GenAI technology based PPTGenerative AI or GenAI technology based PPT
Generative AI or GenAI technology based PPT
 
Integrated Test Rig For HTFE-25 - Neometrix
Integrated Test Rig For HTFE-25 - NeometrixIntegrated Test Rig For HTFE-25 - Neometrix
Integrated Test Rig For HTFE-25 - Neometrix
 
Bhosari ( Call Girls ) Pune 6297143586 Hot Model With Sexy Bhabi Ready For ...
Bhosari ( Call Girls ) Pune  6297143586  Hot Model With Sexy Bhabi Ready For ...Bhosari ( Call Girls ) Pune  6297143586  Hot Model With Sexy Bhabi Ready For ...
Bhosari ( Call Girls ) Pune 6297143586 Hot Model With Sexy Bhabi Ready For ...
 
Unleashing the Power of the SORA AI lastest leap
Unleashing the Power of the SORA AI lastest leapUnleashing the Power of the SORA AI lastest leap
Unleashing the Power of the SORA AI lastest leap
 
COST-EFFETIVE and Energy Efficient BUILDINGS ptx
COST-EFFETIVE  and Energy Efficient BUILDINGS ptxCOST-EFFETIVE  and Energy Efficient BUILDINGS ptx
COST-EFFETIVE and Energy Efficient BUILDINGS ptx
 
Double Revolving field theory-how the rotor develops torque
Double Revolving field theory-how the rotor develops torqueDouble Revolving field theory-how the rotor develops torque
Double Revolving field theory-how the rotor develops torque
 
Block diagram reduction techniques in control systems.ppt
Block diagram reduction techniques in control systems.pptBlock diagram reduction techniques in control systems.ppt
Block diagram reduction techniques in control systems.ppt
 
Unit 1 - Soil Classification and Compaction.pdf
Unit 1 - Soil Classification and Compaction.pdfUnit 1 - Soil Classification and Compaction.pdf
Unit 1 - Soil Classification and Compaction.pdf
 
Hostel management system project report..pdf
Hostel management system project report..pdfHostel management system project report..pdf
Hostel management system project report..pdf
 
VIP Call Girls Ankleshwar 7001035870 Whatsapp Number, 24/07 Booking
VIP Call Girls Ankleshwar 7001035870 Whatsapp Number, 24/07 BookingVIP Call Girls Ankleshwar 7001035870 Whatsapp Number, 24/07 Booking
VIP Call Girls Ankleshwar 7001035870 Whatsapp Number, 24/07 Booking
 
Call Girls in Ramesh Nagar Delhi 💯 Call Us 🔝9953056974 🔝 Escort Service
Call Girls in Ramesh Nagar Delhi 💯 Call Us 🔝9953056974 🔝 Escort ServiceCall Girls in Ramesh Nagar Delhi 💯 Call Us 🔝9953056974 🔝 Escort Service
Call Girls in Ramesh Nagar Delhi 💯 Call Us 🔝9953056974 🔝 Escort Service
 
KubeKraft presentation @CloudNativeHooghly
KubeKraft presentation @CloudNativeHooghlyKubeKraft presentation @CloudNativeHooghly
KubeKraft presentation @CloudNativeHooghly
 
chapter 5.pptx: drainage and irrigation engineering
chapter 5.pptx: drainage and irrigation engineeringchapter 5.pptx: drainage and irrigation engineering
chapter 5.pptx: drainage and irrigation engineering
 
(INDIRA) Call Girl Meerut Call Now 8617697112 Meerut Escorts 24x7
(INDIRA) Call Girl Meerut Call Now 8617697112 Meerut Escorts 24x7(INDIRA) Call Girl Meerut Call Now 8617697112 Meerut Escorts 24x7
(INDIRA) Call Girl Meerut Call Now 8617697112 Meerut Escorts 24x7
 
Introduction to Serverless with AWS Lambda
Introduction to Serverless with AWS LambdaIntroduction to Serverless with AWS Lambda
Introduction to Serverless with AWS Lambda
 

2014 IEEE JAVA NETWORKING PROJECT Stochastic bandwidth estimation in networks with random service

  • 1. GLOBALSOFT TECHNOLOGIES Stochastic Bandwidth Estimation in Networks With Random Service ABSTRACT: Numerous methods for available bandwidth estimation have been developed for wireline networks, and their effectiveness is well-documented. However, most methods fail to predict bandwidth availability reliably in a wireless setting. It is accepted that the increased variability of wireless channel conditions makes bandwidth estimation more difficult. However, a (satisfactory) explanation why these methods are failing ismissing. This paper seeks to provide insights into the problem of bandwidth estimation in wireless networks or, more broadly, in networks with random service. We express bandwidth availability in terms of bounding functions with a defined violation probability. Exploiting properties of a stochastic min-plus linear system theory, the task of bandwidth estimation is formulated as inferring an unknown bounding function from measurements of probing traffic. We present derivations showing that simply using the expected value of the available bandwidth in networks with random service leads to a systematic overestimation of the traffic departures. Furthermore, we show that in a multihop setting with random service at each node, available bandwidth estimates requires observations over (in principle infinitely) long time periods. We propose a new estimation method for random service that is based on iterative constant-rate probes that take advantage of statistical methods. We show how our estimation method can be realized to achieve both good accuracy and confidence levels. We evaluate our method for wired single-and multihop networks, as well as for wireless networks. EXISTING SYSTEM: IEEE PROJECTS & SOFTWARE DEVELOPMENTS IEEE FINAL YEAR PROJECTS|IEEE ENGINEERING PROJECTS|IEEE STUDENTS PROJECTS|IEEE BULK PROJECTS|BE/BTECH/ME/MTECH/MS/MCA PROJECTS|CSE/IT/ECE/EEE PROJECTS CELL: +91 98495 39085, +91 99662 35788, +91 98495 57908, +91 97014 40401 Visit: www.finalyearprojects.org Mail to:ieeefinalsemprojects@gmail.com
  • 2. This paper seeks to provide insights into the problem of bandwidth estimation in wireless networks or, more broadly, in networks with random service. We express bandwidth availability in terms of bounding functions with a defined violation probability. Exploiting properties of a stochastic min-plus linear system theory, the task of bandwidth estimation is formulated as inferring an unknown bounding function from measurements of probing traffic. We present derivations showing that simply using the expected value of the available bandwidth in networks with random service leads to a systematic overestimation of the traffic departures. Most existing bandwidth estimation methods seek to find the long-term available bandwidth as defined in Section II.Wepresent an example to illustrate that the long-term availablebandwidth only presents part of the information on the availableservice in a network. PROPOSED SYSTEM: Proposed approaches in the literature have addressed these issues by adapting or revising bandwidth estimation methods developed for wireline networks. We propose a new estimation method for random service that isbased on iterative constant-rate probes that take advantage ofstatistical methods. We show how our estimation method can berealized to achieve both good accuracy and confidence levels. Weevaluate our method for wired single-and multihop networks, aswell as for wireless networks CONCLUSION: We have presented a system-theoretic foundation for bandwidth estimation of networks with random service, where we used the framework of the stochastic network calculus to derive a method that estimates an -effective service curve from steady-state backlog or delay quantiles observed by packet train probes. The service curve model extends to networks of nodes, as well as to non-work-conserving systems. The -effective service curve characterizes service availability at different timescales and recovers the long-term available bandwidth as its limiting rate. While ideal measurements require an infinite repetition of infinitely long packet trains, we showed that practical estimation
  • 3. methods can be achieved by applying statistical tests and using appropriate heuristics. We found that cross traffic variability, the number of bottleneck links, and the target accuracy of the estimate have a significant impact on the amount of probes required. We presented measurement examples, which showed that estimates of effective service curves can disclose essential characteristics of random service in wired and wireless networks, which are not reflected in the long-term available bandwidth. SYSTEM CONFIGURATION:- HARDWARE CONFIGURATION:-  Processor - Pentium –IV  Speed - 1.1 Ghz  RAM - 256 MB(min)  Hard Disk - 20 GB  Key Board - Standard Windows Keyboard  Mouse - Two or Three Button Mouse  Monitor - SVGA SOFTWARE CONFIGURATION:-  Operating System : Windows XP  Programming Language : JAVA  Java Version : JDK 1.6 & above.