Back-Pressure-Based Packet-by-Packet Adaptive Routing in Communication Networks.

Slides:

Advertisements

Similar presentations

The Transmission Control Protocol (TCP) carries most Internet traffic, so performance of the Internet depends to a great extent on how well TCP works.

Advertisements

A DISTRIBUTED CSMA ALGORITHM FOR THROUGHPUT AND UTILITY MAXIMIZATION IN WIRELESS NETWORKS.

Abstract Shortest distance query is a fundamental operation in large-scale networks. Many existing methods in the literature take a landmark embedding.

On the Node Clone Detection inWireless Sensor Networks.

Optimizing Cloud Resources for Delivering IPTV Services Through Virtualization.

Toward a Statistical Framework for Source Anonymity in Sensor Networks.

Energy-Optimum Throughput and Carrier Sensing Rate in CSMA-Based Wireless Networks.

Annotating Search Results from Web Databases. Abstract An increasing number of databases have become web accessible through HTML form-based search interfaces.

Abstract Load balancing in the cloud computing environment has an important impact on the performance. Good load balancing makes cloud computing more.

A Secure Protocol for Spontaneous Wireless Ad Hoc Networks Creation.

Personalized QoS-Aware Web Service Recommendation and Visualization.

Discovering Emerging Topics in Social Streams via Link Anomaly Detection.

IP-Geolocation Mapping for Moderately Connected Internet Regions.

Secure Encounter-based Mobile Social Networks: Requirements, Designs, and Tradeoffs.

Minimum Cost Blocking Problem in Multi-path Wireless Routing Protocols.

Cross-Domain Privacy-Preserving Cooperative Firewall Optimization.

A Survey of Mobile Cloud Computing Application Models

Dynamic Resource Allocation Using Virtual Machines for Cloud Computing Environment.

Security Evaluation of Pattern Classifiers under Attack.

Vampire Attacks: Draining Life from Wireless Ad Hoc Sensor Networks.

Incentive Based Data Sharing in Delay Tolerant Mobile Networks.

BestPeer++: A Peer-to-Peer Based Large-Scale Data Processing Platform.

Improving Network I/O Virtualization for Cloud Computing.

Privacy Preserving Data Sharing With Anonymous ID Assignment

Mobile Relay Configuration in Data-Intensive Wireless Sensor Networks.

m-Privacy for Collaborative Data Publishing

PACK: Prediction-Based Cloud Bandwidth and Cost Reduction System

EAACK—A Secure Intrusion-Detection System for MANETs

A Fast Clustering-Based Feature Subset Selection Algorithm for High- Dimensional Data.

Combining Cryptographic Primitives to Prevent Jamming Attacks in Wireless Networks.

Optimal Client-Server Assignment for Internet Distributed Systems.

Protecting Sensitive Labels in Social Network Data Anonymization.

LARS*: An Efficient and Scalable Location-Aware Recommender System.

Cooperative Caching for Efficient Data Access in Disruption Tolerant Networks.

Anonymization of Centralized and Distributed Social Networks by Sequential Clustering.

Accuracy-Constrained Privacy-Preserving Access Control Mechanism for Relational Data.

Content Sharing over Smartphone-Based Delay- Tolerant Networks.

Abstract Link error and malicious packet dropping are two sources for packet losses in multi-hop wireless ad hoc network. In this paper, while observing.

A System for Denial-of- Service Attack Detection Based on Multivariate Correlation Analysis.

Modeling the Pairwise Key Predistribution Scheme in the Presence of Unreliable Links.

Scalable Distributed Service Integrity Attestation for Software-as-a-Service Clouds.

Anomaly Detection via Online Over-Sampling Principal Component Analysis.

A Method for Mining Infrequent Causal Associations and Its Application in Finding Adverse Drug Reaction Signal Pairs.

A Generalized Flow-Based Method for Analysis of Implicit Relationships on Wikipedia.

A Highly Scalable Key Pre- Distribution Scheme for Wireless Sensor Networks.

Towards Online Shortest Path Computation. Abstract The online shortest path problem aims at computing the shortest path based on live traffic circumstances.

Bandwidth Distributed Denial of Service: Attacks and Defenses.

Facilitating Document Annotation using Content and Querying Value.

Traffic Pattern-Based Content Leakage Detection for Trusted Content Delivery Networks.

Clustering Sentence-Level Text Using a Novel Fuzzy Relational Clustering Algorithm.

Preventing Private Information Inference Attacks on Social Networks.

Video Dissemination over Hybrid Cellular and Ad Hoc Networks.

Abstract We propose two novel energy-aware routing algorithms for wireless ad hoc networks, called reliable minimum energy cost routing (RMECR) and reliable.

DCIM: Distributed Cache Invalidation Method for Maintaining Cache Consistency in Wireless Mobile Networks.

Supporting Privacy Protection in Personalized Web Search.

Twitsper: Tweeting Privately. Abstract Although online social networks provide some form of privacy controls to protect a user's shared content from other.

Opportunistic MANETs: Mobility Can Make Up for Low Transmission Power.

m-Privacy for Collaborative Data Publishing

Multiparty Access Control for Online Social Networks : Model and Mechanisms.

A New Algorithm for Inferring User Search Goals with Feedback Sessions.

Securing Broker-Less Publish/Subscribe Systems Using Identity-Based Encryption.

Dynamic Control of Coding for Progressive Packet Arrivals in DTNs.

Privacy-Preserving and Content-Protecting Location Based Queries.

Whole Test Suite Generation. Abstract Not all bugs lead to program crashes, and not always is there a formal specification to check the correctness of.

Distributed Processing of Probabilistic Top-k Queries in Wireless Sensor Networks.

Load Rebalancing for Distributed File Systems in Clouds.

Facilitating Document Annotation Using Content and Querying Value.

Fast Transmission to Remote Cooperative Groups: A New Key Management Paradigm.

Dynamic Query Forms for Database Queries. Abstract Modern scientific databases and web databases maintain large and heterogeneous data. These real-world.

Spatial Approximate String Search. Abstract This work deals with the approximate string search in large spatial databases. Specifically, we investigate.

Presentation transcript:

Back-Pressure-Based Packet-by-Packet Adaptive Routing in Communication Networks

Abstract Back-pressure-based adaptive routing algorithms where each packet is routed alongapossiblydifferent path have been extensively studied in the literature. However, such algo¬rithms typically result in poor delay performance and involve high implementation complexity. In this paper, we develop a new adap¬tive routing algorithm built upon the widely studied back-pressure algorithm. We decouple the routing and scheduling components of the algorithm by designing a probabilistic routing table that is used to route packets to per- destination queues. The scheduling decisions in the case of wireless networks aremadeusing counters called shadow queues. The results are also extended to the case of networks that employ simple forms of network coding. In that case, our algorithm provides a low- complexity solution to optimally exploit the routing-coding tradeoff.

Existing System THE BACK-PRESSURE algorithm introduced in [1] has been widely studied in the literature. While the ideas be¬hind scheduling using the weights suggested in that paper have been successful in practice in base stations and routers, the adap¬tive routing algorithm is rarely used. The main reason for this is that the routing algorithm can lead to poor delay performance due to routing loops. Additionally, the implementation of the back-pressure algorithm requires each node to maintain per-destination queues that can be burdensome for a wireline or wire¬less router. Motivated by these considerations, we reexamine the back-pressure routing algorithm in this paper and design a new algorithm that has much superior performance and low im¬plementation complexity.

Architecture Diagram

System Specification HARDWARE REQUIREMENTS Processor : Intel Pentium IV Ram : 512 MB Hard Disk : 80 GB HDD SOFTWARE REQUIREMENTS Operating System : Windows XP / Windows 7 FrontEnd : Java BackEnd : MySQL 5

C ONCLUSION The back-pressure algorithm, while being throughput-op¬timal, is not useful in practice for adaptive routing since the delay performance can be really bad. In this paper, we have presented an algorithm that routes packets on shortest hops when possible and decouples routing and scheduling using a probabilistic splitting algorithm built on the concept of shadow. Now we focus on the real traffic.

THANK YOU