Jamhour, 2011 - Google Patents
A symbolic model to traffic engineering in wireless mesh networksJamhour, 2011
- Document ID
- 10807005336121824187
- Author
- Jamhour E
- Publication year
- Publication venue
- Proceedings of the 44th Annual Simulation Symposium
External Links
Snippet
In this section we describe the algorithm that permits to determine the effective traffic load in each link in the network. In a wired network, the traffic load through a link is simply the summation of the traffic of all paths that traverse the link. In a WMN however, the traffic …
- 230000005540 biological transmission 0 abstract description 20
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATIONS NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
- H04W40/14—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality based on stability
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
- H04L45/123—Evaluation of link metrics
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATIONS NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATIONS NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/20—Communication route or path selection, e.g. power-based or shortest path routing based on geographic position or location
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
- H04L45/121—Minimizing delay
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/30—Special provisions for routing multiclass traffic
- H04L45/302—Route determination based on requested QoS
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
- H04L45/124—Shortest path evaluation using a combination of metrics
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATIONS NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organizing networks, e.g. ad-hoc networks or sensor networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATIONS NETWORKS
- H04W72/00—Local resource management, e.g. wireless traffic scheduling or selection or allocation of wireless resources
- H04W72/04—Wireless resource allocation
- H04W72/044—Wireless resource allocation where an allocation plan is defined based on the type of the allocated resource
- H04W72/0446—Wireless resource allocation where an allocation plan is defined based on the type of the allocated resource the resource being a slot, sub-slot or frame
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/54—Store-and-forward switching systems
- H04L12/56—Packet switching systems
- H04L12/5695—Admission control; Resource allocation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATIONS NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATIONS NETWORKS
- H04W28/00—Network traffic or resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/04—Interdomain routing, e.g. hierarchical routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic regulation in packet switching networks
- H04L47/10—Flow control or congestion control
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/20—Hop count for routing purposes, e.g. TTL
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATIONS NETWORKS
- H04W28/00—Network traffic or resource management
- H04W28/16—Central resource management; Negotiation of resources or communication parameters, e.g. negotiating bandwidth or QoS [Quality of Service]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATIONS NETWORKS
- H04W72/00—Local resource management, e.g. wireless traffic scheduling or selection or allocation of wireless resources
- H04W72/12—Dynamic Wireless traffic scheduling; Dynamically scheduled allocation on shared channel
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATIONS NETWORKS
- H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B7/00—Radio transmission systems, i.e. using radiation field
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101218794B (en) | Method and device for determining and selecting routing cost using link interaction | |
| Mohsenian-Rad et al. | Joint logical topology design, interface assignment, channel allocation, and routing for multi-channel wireless mesh networks | |
| Potti et al. | Adopting Multi-radio Channel Approach in TCP Congestion Control Mechanisms to Mitigate Starvation in Wireless Mesh Networks | |
| Behzad et al. | High transmission power increases the capacity of ad hoc wireless networks | |
| Kompella et al. | On optimal SINR-based scheduling in multihop wireless networks | |
| Ancillotti et al. | Load-aware routing in mesh networks: Models, algorithms and experimentation | |
| Sarasvathi et al. | QoS guaranteed intelligent routing using hybrid PSO-GA in wireless mesh networks | |
| Kralevska et al. | A load balancing algorithm for resource allocation in IEEE 802.15. 4e networks | |
| Shigueta et al. | A strategy for opportunistic cognitive channel allocation in wireless Internet of Things | |
| Choi et al. | Efficient load-aware routing scheme for wireless mesh networks | |
| Cui et al. | On distributed scheduling in wireless networks exploiting broadcast and network coding | |
| Jamhour | A symbolic model to traffic engineering in wireless mesh networks | |
| Bazan et al. | A conflict analysis framework for QoS-aware routing in contention-based wireless mesh networks with beamforming antennas | |
| Prathviraj et al. | Rough set based QoS enabled multipath source routing in MANET | |
| Yuan et al. | Interference minimization routing and scheduling in cognitive radio wireless mesh networks | |
| Dai et al. | Efficient channel assignment under dynamic source routing in cognitive radio networks | |
| Nguyen et al. | A dynamic vehicle-ranking approach for online virtual network embedding in internet of vehicles | |
| Cicioğlu et al. | An effective routing algorithm for spectrum allocations in cognitive radio based internet of things | |
| Cacciapuoti et al. | On the route priority for cognitive radio networks | |
| Middleton et al. | A flexible framework for polynomial-time resource allocation in streaming multiflow wireless networks | |
| Shakeri et al. | Improvement of network throughput by providing CAODV-based routing algorithm in cognitive radio ad hoc networks | |
| Dai et al. | Effective Channel Assignment Based on Dynamic Source Routing in Cognitive Radio Networks. | |
| CN115103420A (en) | Deterministic routing decision method based on real-time performance analysis of wireless multi-hop network | |
| Singh et al. | A distributed algorithm for D2D communication in 5G using stochastic model | |
| Esmat et al. | Outage-Aware Multi-Domain Network Slicing for Satellite-Airborne-Terrestrial Networks with Multiple Configurations |