SlideShare a Scribd company logo
1 of 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.

More Related Content

More from IEEEFINALSEMSTUDENTSPROJECTS

More from 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
 

Recently uploaded

Final DBMS Manual (2).pdf final lab manual
Final DBMS Manual (2).pdf final lab manualFinal DBMS Manual (2).pdf final lab manual
Final DBMS Manual (2).pdf final lab manual
BalamuruganV28
 

Recently uploaded (20)

Involute of a circle,Square, pentagon,HexagonInvolute_Engineering Drawing.pdf
Involute of a circle,Square, pentagon,HexagonInvolute_Engineering Drawing.pdfInvolute of a circle,Square, pentagon,HexagonInvolute_Engineering Drawing.pdf
Involute of a circle,Square, pentagon,HexagonInvolute_Engineering Drawing.pdf
 
Software Engineering - Modelling Concepts + Class Modelling + Building the An...
Software Engineering - Modelling Concepts + Class Modelling + Building the An...Software Engineering - Modelling Concepts + Class Modelling + Building the An...
Software Engineering - Modelling Concepts + Class Modelling + Building the An...
 
Research Methodolgy & Intellectual Property Rights Series 2
Research Methodolgy & Intellectual Property Rights Series 2Research Methodolgy & Intellectual Property Rights Series 2
Research Methodolgy & Intellectual Property Rights Series 2
 
"United Nations Park" Site Visit Report.
"United Nations Park" Site  Visit Report."United Nations Park" Site  Visit Report.
"United Nations Park" Site Visit Report.
 
Instruct Nirmaana 24-Smart and Lean Construction Through Technology.pdf
Instruct Nirmaana 24-Smart and Lean Construction Through Technology.pdfInstruct Nirmaana 24-Smart and Lean Construction Through Technology.pdf
Instruct Nirmaana 24-Smart and Lean Construction Through Technology.pdf
 
Operating System chapter 9 (Virtual Memory)
Operating System chapter 9 (Virtual Memory)Operating System chapter 9 (Virtual Memory)
Operating System chapter 9 (Virtual Memory)
 
Research Methodolgy & Intellectual Property Rights Series 1
Research Methodolgy & Intellectual Property Rights Series 1Research Methodolgy & Intellectual Property Rights Series 1
Research Methodolgy & Intellectual Property Rights Series 1
 
Electrostatic field in a coaxial transmission line
Electrostatic field in a coaxial transmission lineElectrostatic field in a coaxial transmission line
Electrostatic field in a coaxial transmission line
 
Seismic Hazard Assessment Software in Python by Prof. Dr. Costas Sachpazis
Seismic Hazard Assessment Software in Python by Prof. Dr. Costas SachpazisSeismic Hazard Assessment Software in Python by Prof. Dr. Costas Sachpazis
Seismic Hazard Assessment Software in Python by Prof. Dr. Costas Sachpazis
 
Multivibrator and its types defination and usges.pptx
Multivibrator and its types defination and usges.pptxMultivibrator and its types defination and usges.pptx
Multivibrator and its types defination and usges.pptx
 
How to Design and spec harmonic filter.pdf
How to Design and spec harmonic filter.pdfHow to Design and spec harmonic filter.pdf
How to Design and spec harmonic filter.pdf
 
Insurance management system project report.pdf
Insurance management system project report.pdfInsurance management system project report.pdf
Insurance management system project report.pdf
 
Supermarket billing system project report..pdf
Supermarket billing system project report..pdfSupermarket billing system project report..pdf
Supermarket billing system project report..pdf
 
Linux Systems Programming: Semaphores, Shared Memory, and Message Queues
Linux Systems Programming: Semaphores, Shared Memory, and Message QueuesLinux Systems Programming: Semaphores, Shared Memory, and Message Queues
Linux Systems Programming: Semaphores, Shared Memory, and Message Queues
 
Piping and instrumentation diagram p.pdf
Piping and instrumentation diagram p.pdfPiping and instrumentation diagram p.pdf
Piping and instrumentation diagram p.pdf
 
Final DBMS Manual (2).pdf final lab manual
Final DBMS Manual (2).pdf final lab manualFinal DBMS Manual (2).pdf final lab manual
Final DBMS Manual (2).pdf final lab manual
 
Lab Manual Arduino UNO Microcontrollar.docx
Lab Manual Arduino UNO Microcontrollar.docxLab Manual Arduino UNO Microcontrollar.docx
Lab Manual Arduino UNO Microcontrollar.docx
 
NEWLETTER FRANCE HELICES/ SDS SURFACE DRIVES - MAY 2024
NEWLETTER FRANCE HELICES/ SDS SURFACE DRIVES - MAY 2024NEWLETTER FRANCE HELICES/ SDS SURFACE DRIVES - MAY 2024
NEWLETTER FRANCE HELICES/ SDS SURFACE DRIVES - MAY 2024
 
BRAKING SYSTEM IN INDIAN RAILWAY AutoCAD DRAWING
BRAKING SYSTEM IN INDIAN RAILWAY AutoCAD DRAWINGBRAKING SYSTEM IN INDIAN RAILWAY AutoCAD DRAWING
BRAKING SYSTEM IN INDIAN RAILWAY AutoCAD DRAWING
 
Electrical shop management system project report.pdf
Electrical shop management system project report.pdfElectrical shop management system project report.pdf
Electrical shop management system project report.pdf
 

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.