WO2009135981A1 - Procédé, appareil et produit de programme d'ordinateur pour assurer un routage dans un réseau - Google Patents

Procédé, appareil et produit de programme d'ordinateur pour assurer un routage dans un réseau Download PDF

Info

Publication number
WO2009135981A1
WO2009135981A1 PCT/FI2008/000057 FI2008000057W WO2009135981A1 WO 2009135981 A1 WO2009135981 A1 WO 2009135981A1 FI 2008000057 W FI2008000057 W FI 2008000057W WO 2009135981 A1 WO2009135981 A1 WO 2009135981A1
Authority
WO
WIPO (PCT)
Prior art keywords
user
router
selecting
graph
routing
Prior art date
Application number
PCT/FI2008/000057
Other languages
English (en)
Inventor
Juho MÄÄTTÄ
Timo BRÄYSY
Original Assignee
Nokia Corporation
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Nokia Corporation filed Critical Nokia Corporation
Priority to PCT/FI2008/000057 priority Critical patent/WO2009135981A1/fr
Publication of WO2009135981A1 publication Critical patent/WO2009135981A1/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION 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/42—Centralised routing

Definitions

  • Embodiments of the present invention relate generally to the provision of routing services to electronic devices and, more particularly, relate to an apparatus, method and computer program product for providing routing services for mobile terminals in a network such as, for example, a wireless mesh network.
  • a wireless mesh network is an example of a network that may include a plurality of wireless routers in communication with various other wireless routers to provide network connectivity to mobile stations (e.g., mobile communication devices such as cellular phones or other mobile terminals) that are within a coverage area of the respective routers.
  • the routers may form an ad hoc network among themselves to relay traffic to and from mobile stations, often in a multi-hop environment.
  • Some of the routers may even serve as a gateway between the WMN and wired network including, for example, resources such as file servers, Internet gateways, application servers, etc.
  • Physical links between network nodes such as the gateways, routers and/or mobile stations may be provided by Institute of Electrical and Electronics Engineers (IEEE) 802.1 1 or 802.16 wireless links.
  • IEEE Institute of Electrical and Electronics Engineers
  • Routing of communications transmitted in a WMN can be accomplished using ad hoc network routing algorithms, e.g., ad hoc on demand distance vector (AODV).
  • AODV ad hoc on demand distance vector
  • WMNs often suffer from poor network resource utilization due in part to a skewed nature of the traffic that is typically communicated over the WMN (e.g., most of the traffic is to/from a gateway or access point (AP)).
  • AP access point
  • CA channel assignment
  • Exemplary routing mechanisms used in wireless networks include the use of heuristics or an optimization problem.
  • Heuristics typically lack the ability to evaluate how well the solution works and optimization problems tend to make overly simplified assumptions or are relatively complex.
  • Certain conventional methods have introduced fairness in their optimization problems, which they have formulated as a linear programming (LP) framework that maximizes the sum of user rates with fairness and capacity constraints..
  • LP linear programming
  • a problem may occur related to the division of user data into pieces and the potential for sending the data along every possible path from source to destination.
  • traditional mechanisms generally attempt to solve an optimization problem rather than properly addressing routing in consideration of the characteristics of the WMN.
  • a method, computer program product and apparatus are therefore provided that may enable improved routing in a network such as a WMN.
  • embodiments of the present invention may enable the routing of data based on a determined routing order that considers user or mobile station position for use in channel assignment and routing decisions.
  • traffic loads on links relative to collision domain concepts may be used to make routing decisions.
  • a method of enabling improved routing is provided. The method may include receiving position information for a plurality of network nodes, determining possible paths between a user and a destination and traffic information related to each determined possible path, and selecting a router for connection by the user based on the position information and the traffic information.
  • an apparatus for enabling improved routing may include a processor.
  • the processor may be configured to receive position information for a plurality of network nodes, determine possible paths between a user and a destination and traffic information related to each determined possible path, and select a router for connection by the user based on the position information and the traffic information.
  • a computer program product for enabling improved routing may include at least one computer-readable storage medium having computer-executable program code portions stored therein.
  • the computer-executable program code portions may include a first program code portion, a second program code portion and a third program code portion.
  • the first program code portion may be for receiving position information for a plurality of network nodes.
  • the second program code portion may be for determining possible paths between a user and a destination and traffic information related to each determined possible path.
  • the third program code portion may be for selecting a router for connection by the user based on the position information and the traffic information.
  • an apparatus for enabling improved routing is provided.
  • the apparatus may include means for receiving position information for a plurality of network nodes, means for determining possible paths between a user and a destination and traffic information related to each determined possible path, and means for selecting a router for connection by the user based on the position information and the traffic information.
  • FIG. 1 is a schematic block diagram of a mobile terminal according to an exemplary embodiment of the present invention.
  • FIG. 2 is a schematic block diagram of a wireless communications system according to an exemplary embodiment of the present invention.
  • FIG. 3 illustrates a block diagram showing an apparatus for enabling routing in a network according to an exemplary embodiment of the present invention
  • FIG. 4 is a flowchart according to another exemplary method of enabling routing in a network according to an exemplary embodiment of the present invention.
  • FIG. 1 one aspect of the invention, illustrates a block diagram of a mobile terminal 10 that would benefit from embodiments of the present invention.
  • a mobile telephone as illustrated and hereinafter described is merely illustrative of one type of mobile terminal that would benefit from embodiments of the present invention and, therefore, should not be taken to limit the scope of embodiments of the present invention. While several embodiments of the mobile terminal 10 are illustrated and will be hereinafter described for purposes of example, other types of mobile terminals, such as portable digital assistants (PDAs), pagers, mobile televisions, gaming devices, laptop computers, cameras, video recorders, audio/video player, radio, GPS devices, or any combination of the aforementioned, and other types of voice and text communications systems, can readily employ embodiments of the present invention.
  • PDAs portable digital assistants
  • pagers mobile televisions
  • gaming devices gaming devices
  • laptop computers cameras
  • video recorders audio/video player
  • radio GPS devices
  • the mobile terminal 10 may include an antenna 12 (or multiple antennas) in operable communication with a transmitter 14 and a receiver 16.
  • the mobile terminal 10 may further include an apparatus, such as a controller 20 or other processing element, that provides signals to and receives signals from the transmitter 14 and receiver 16, respectively.
  • the signals include signaling information in accordance with the air interface standard of the applicable cellular system, and also user speech, received data and/or user generated data.
  • the mobile terminal 10 is capable of operating with one or more air interface standards, communication protocols, modulation types, and access types.
  • the mobile terminal 10 is capable of operating in accordance with any of a number of first, second, third and/or fourth-generation communication protocols or the like.
  • the mobile terminal 10 may be capable of operating in accordance with second-generation (2G) wireless communication protocols IS-136 (time division multiple access (TDMA)), GSM (global system for mobile communication), and IS-95 (code division multiple access (CDMA)), or with third-generation (3G) wireless communication protocols, such as Universal Mobile Telecommunications System (UMTS), CDMA2000, wideband CDMA (WCDMA) and time division-synchronous CDMA (TD-SCDMA), with fourth-generation (4G) wireless communication protocols or the like.
  • 2G wireless communication protocols IS-136 (time division multiple access (TDMA)
  • GSM global system for mobile communication
  • IS-95 code division multiple access
  • third-generation (3G) wireless communication protocols such as Universal Mobile Telecommunications System (UMTS), CDMA2000, wideband CDMA (WCDMA) and time division-synchronous CDMA (TD-SCDMA), with fourth-generation (4G) wireless communication protocols or the like.
  • 3G wireless communication protocols such as Universal Mobile Telecommunications System (UMTS), CDMA2000, wideband CDMA (WC
  • the apparatus may include circuitry desirable for implementing audio and logic functions of the mobile terminal 10.
  • the controller 20 may be comprised of a digital signal processor device, a microprocessor device, and various analog to digital converters, digital to analog converters, and other support circuits. Control and signal processing functions of the mobile terminal 10 are allocated between these devices according to their respective capabilities.
  • the controller 20 thus may also include the functionality to use convolution encoding and interleave message and data prior to modulation and transmission.
  • the controller 20 can additionally include an internal voice coder, and may include an internal data modem. Further, the controller 20 may include functionality to operate one or more software programs, which may be stored in memory.
  • the controller 20 may be capable of operating a connectivity program, such as a conventional Web browser.
  • the connectivity program may then allow the mobile terminal 10 to transmit and receive Web content, such as location-based content and/or other web page content, according to a Wireless Application Protocol (WAP), Hypertext Transfer Protocol (HTTP) and/or the like, for example.
  • WAP Wireless Application Protocol
  • HTTP Hypertext Transfer Protocol
  • the mobile terminal 10 may also comprise a user interface including an output device such as a conventional earphone or speaker 24, a ringer 22, a microphone 26, a display 28, and a user input interface, all of which are coupled to the controller 20.
  • the user input interface which allows the mobile terminal 10 to receive data, may include any of a number of devices allowing the mobile terminal 10 to receive data, such as a keypad 30, a touch display (not shown) or other input device.
  • the keypad 30 may include the conventional numeric (0-9) and related keys (#, *), and other hard and soft keys used for operating the mobile terminal 10.
  • the keypad 30 may include a conventional QWERTY keypad arrangement.
  • the keypad 30 may also include various soft keys with associated functions.
  • the mobile terminal 10 may include an interface device such as a joystick or other user input interface.
  • the mobile terminal 10 further includes a battery 34, such as a vibrating battery pack, for powering various circuits that are required to operate the mobile terminal 10, as well as optionally providing mechanical vibration as a detectable output.
  • the mobile terminal 10 may include a positioning sensor 36.
  • the positioning sensor 36 may include, for example, a global positioning system (GPS) sensor, an assisted global positioning system (Assisted -GPS) sensor, a Bluetooth (BT)- GPS mouse, other GPS or positioning receivers or the like.
  • GPS global positioning system
  • Assisted -GPS assisted global positioning system
  • BT Bluetooth
  • the positioning sensor 36 may include a pedometer or inertial sensor.
  • the positioning sensor 36 may be capable of determining a location of the mobile terminal 10, such as, for example, longitudinal and latitudinal directions of the mobile terminal 10, or a position relative to a reference point such as a destination or start point.
  • the mobile terminal 10 may further include a user identity module (UIM) 38.
  • the UIM 38 is typically a memory device having a processor built in.
  • the UIM 38 may include, for example, a subscriber identity module (SIM), a universal integrated circuit card (UICC), a universal subscriber identity module (USIM), a removable user identity module (R-UIM), etc.
  • the UIM 38 typically stores information elements related to a mobile subscriber.
  • the mobile terminal 10 may be equipped with memory.
  • the mobile terminal 10 may include volatile memory 40, such as volatile Random Access Memory (RAM) including a cache area for the temporary storage of data.
  • RAM volatile Random Access Memory
  • the mobile terminal 10 may also include other non-volatile memory 42, which can be embedded and/or may be removable.
  • the non-volatile memory 42 can additionally or alternatively comprise an electrically erasable programmable read only memory (EEPROM), flash memory or the like, such as that available from the SanDisk Corporation of Sunnyvale, California, or Lexar Media Inc. of Fremont, California.
  • EEPROM electrically erasable programmable read only memory
  • the memories can store any of a number of pieces of information, and data, used by the mobile terminal 10 to implement the functions of the mobile terminal 10.
  • the memories can include an identifier, such as an international mobile equipment identification (IMEI) code, capable of uniquely identifying the mobile terminal 10.
  • IMEI international mobile equipment identification
  • the memories may store instructions for determining cell id information.
  • the memories may store an application program for execution by the controller 20, which determines an identity of the current cell, i.e., cell id identity or cell id information, with which the mobile terminal 10 is in communication. In conjunction with the positioning sensor 36, the cell id information may be used to more accurately determine a location of the mobile terminal 10.
  • FIG. 2 is a schematic block diagram of a wireless communications system according to an exemplary embodiment of the present invention.
  • data may be used interchangeably to refer to data capable of being transmitted, received and/or stored in accordance with embodiments of the present invention. Thus, use of any such terms should not be taken to limit the spirit and scope of embodiments of the present invention.
  • WSN wireless mesh network
  • one or more mobile terminals 10 for transmitting signals to and for receiving signals from a router 102 in whose coverage area the corresponding mobile terminals 10 are located.
  • the coverage area of two exemplary routers 102 and the respective mobile terminals 10 located therein are shown in FIG. 2 using dashed lines.
  • the system may further include multiple additional routers dispersed in various locations (e.g., fixed locations) throughout the network. As indicated above, some of the routers may themselves be, or may be in communication with, a gateway 104 providing an interface between the router or routers in communication with the gateway 104 and a wired network 106.
  • FIG. 2 illustrates an exemplary embodiment in which mobile terminals 10 are connected to border routers and to the gateways 104 only via other routers 102, it should be understood that FIG. 2 is merely exemplary and mobile terminals 10 could alternatively connect to routers other than border routers or even connect directly to the gateways 104.
  • the routers 102 may comprise essentially wireless access points (APs) that may be configured to communicate with the mobile terminal 10 in accordance with techniques such as, for example, radio frequency (RF), infrared (IrDA) or any of a number of different wireless networking techniques, including WLAN techniques such as IEEE 802.11 (e.g., 802.1 Ia, 802.1 Ib, 802.1 Ig, 802.1 In, etc.), world interoperability for microwave access (WiMAX) techniques such as IEEE 802.16, and/or wireless Personal Area Network (WPAN) techniques such as IEEE 802.15, BlueTooth (BT), ultra wideband (UWB) and/or the like.
  • the APs may be coupled to the Internet or other networks via the gateway 104.
  • the wired network 106 may include the Internet or other networks and various resources such as servers, databases and/or computing devices with respective storage mediums (fixed or removable) and/or processors.
  • Links between the gateways 104, the routers 102 and the mobile terminals 10 may all be wireless links 108. Meanwhile links between the wired network 106 and the gateways 104 may be wired links 109.
  • one of the resources of the wired network 106 that may be associated with the WMN 100 may be a routing manager 110, which may be part of or in communication with the wired network 106.
  • the routing manager 110 may be embodied some other device within the WMN 100 or even at one of the routers 102 or the gateways 104.
  • the routing manager 110 may not be a central node within the WMN 100, but may instead be distributed among various entities such as the routers 102 and/or the gateways 104.
  • the routing manager 110 may be in communication with a plurality or even all of the routers 102 and gateways 104.
  • the routing manager 110 may be any means such as a device or circuitry embodied in hardware, software, or a combination of hardware and software that is configured to carry out the functions of the routing manager 110 as described herein.
  • the routing manager 110 may be configured to execute a routing algorithm for directing routing of messaging within the WMN 100.
  • the routing manager 110 may be further configured to execute a channel assignment algorithm for assigning channels based on, for example, a traffic load estimation.
  • the routing manager 110 may also be configured to perform the traffic load estimation or maintain a graph or other representation of traffic loads for various links within the network on a dynamic basis.
  • content or data may be communicated over the system of FIG. 2 between a mobile terminal, which may be similar to the mobile terminal 10 of FIG. 1, a network device of the system of FIG. 2 in order to, for example, execute applications or establish communication (for example, for purposes of content or information sharing) between the mobile terminal 10 and the network device or other mobile terminals.
  • a mobile terminal which may be similar to the mobile terminal 10 of FIG. 1, a network device of the system of FIG. 2 in order to, for example, execute applications or establish communication (for example, for purposes of content or information sharing) between the mobile terminal 10 and the network device or other mobile terminals.
  • the system of FIG. 2 need not be employed for communication between mobile terminals or between a network device and 0057
  • FIG. 2 is merely provided for purposes of example.
  • embodiments of the present invention may be practiced in association with a communication device such as the mobile terminal 10, and/or may be resident on a network device such as a server or other device, absent any communication with the system of FlG. 2.
  • FIG. 3 illustrates a block diagram of an exemplary apparatus for providing routing in a WMN.
  • An exemplary embodiment of the invention will now be described with reference to FIG. 3, in which certain elements of an apparatus for enabling routing in a network such as a WMN are displayed.
  • the apparatus of FIG. 3 may be embodied as or otherwise employed, for example, on a network device such as a server, router or gateway.
  • a network device such as a server, router or gateway.
  • the apparatus of FIG. 3 (or portions of the apparatus of FIG. 3), may also be employed on a variety of other devices, both mobile and fixed, and therefore, embodiments of the present invention should not be limited to application on devices such as servers.
  • FIG. 3 illustrates one example of a configuration of an apparatus for enabling routing in a network such as a WMN, numerous other configurations may also be used to implement embodiments of the present invention.
  • the apparatus may include or otherwise be in communication with a processor 170, a user interface 172, a communication interface 174 and a memory device 176.
  • the memory device 176 may include, for example, volatile and/or non-volatile memory.
  • the memory device 176 may be configured to store information, data, applications, instructions or the like for enabling the apparatus to carry out various functions in accordance with exemplary embodiments of the present invention.
  • the memory device 176 could be configured to buffer input data for processing by the processor 170.
  • the memory device 176 could be configured to store instructions for execution by the processor 170.
  • the memory device 176 may be one of a plurality of databases that store information in the form of static and/or dynamic information.
  • the processor 170 may be embodied in a number of different ways.
  • the processor 170 may be embodied as a processing means such as a processing element, a coprocessor, a controller or various other processing devices including integrated circuits such as, for example, an ASIC (application specific integrated circuit) or FPGA (field programmable gate array).
  • the processor 170 may be configured to execute instructions stored in the memory device 176 or otherwise accessible to the processor 170.
  • the processor 170 may be embodied as, or otherwise control, the routing manager 1 10.
  • the communication interface 174 may be embodied as any device or means embodied in either hardware, software, or a combination of hardware and software that is configured to receive and/or transmit data from/to a network and/or any other device or module in communication with the apparatus.
  • the communication interface 174 may include, for example, an antenna and supporting hardware and/or software for enabling communications with a wireless communication network.
  • the user interface 172 may be in communication with the processor 170 to receive an indication of a user input at the user interface 172 and/or to provide an audible, visual, mechanical or other output to the user.
  • the user interface 172 may include, for example, a keyboard, a mouse, a joystick, a touch screen display, a conventional display, a microphone, a speaker, or other input/output mechanisms.
  • the user interface 172 may be limited, or even eliminated.
  • the processor 170 may include, be embodied as or otherwise control the routing manager 1 10.
  • the routing manager 110 may be configured to execute one or more algorithms in association with performing some of the functions of the routing manager 110.
  • the routing manager 110 may employ a channel assignment algorithm 112 such as a mesh-based traffic and interference aware channel assignment (MeshTiC).
  • the routing manager 110 may employ a routing algorithm 114 such as a subscriber aware fair routing in wireless mesh networks algorithm (SAFARI).
  • SAFARI subscriber aware fair routing in wireless mesh networks algorithm
  • the routing algorithm 114 may provide a solution to the unfairness problem in a typical multi-radio WMN that was described above by providing (e.g., in a centralized manner if the routing manager 110 is embodied as a central node) routing that may provide a feasible rate allocation.
  • embodiments of the present invention may perform channel assignment and/or routing at least in part based on position information (e.g., geographic 7
  • embodiments of the present invention may utilize position information (e.g., from the positioning sensor 36, or from information indicative of which routers are possible providers of coverage for a particular mobile terminal 10) for channel assignment by estimating (e.g., at the routing manager 110) traffic loads on various links (e.g., using collision domain theory). Position information may also be used to determine to which router a particular mobile terminal should connect in order to provide routing without overloading certain ones of the links. Position information may also be used at least in part for determining routing order (e.g., the order in which users are routed to destinations).
  • traffic load approximation may be performed.
  • the traffic load approximation may utilize collision domain theory by assuming that a user contributes to a certain link's traffic load if the user is within the link's interference range and uses the same channel or frequency.
  • the traffic load for each link in all possible paths between a user and a destination may be determined.
  • the MeshTiC algorithm or another channel assignment algorithm may then be utilized to perform channel assignment based on the traffic load approximation and/or position information.
  • position information may also be utilized by the routing manager 110 for router selection with regard to selecting a particular one of the routers 102 to which a particular mobile terminal 10 should attach.
  • a router from which there is a "best path" or a set of best paths to a particular destination may be selected.
  • the best path may be determined based, for example, upon the traffic load approximation for various links along the path.
  • the best path may be the path with the least other traffic and therefore the path that, if selected, would involve the lowest likelihood of causing interference with other traffic.
  • the best path could be determined based on an entirety of the path from source to destination (e.g., including a user, one or more routers, and a gateway), or the best path could merely include a next router, device or gateway to which a connection may be made in a path to an ultimate destination.
  • a best path could be a cumulative best path or merely a best path for a next hop in a path to an ultimate destination.
  • the routing order e.g., the order in which users are routed to destinations, may be determined so that users in low collision domain regions are routed first. Such ⁇ routing order selection may assist in providing guaranteed fairness (e.g., ensuring that all users get needed or equal rates) and increasing overall network throughput.
  • the routing algorithm 114 may actually employ at least portions of the channel assignment algorithm 112.
  • an exemplary embodiment of the present invention is shown below and explained in reference to Table 1.
  • the algorithm below is merely one example of an algorithm that may be employed for exemplary embodiments of the present invention.
  • K Sort users such that users in low CD regions are routed first.
  • network information V may be collected at line 1 in relation to the nodes and users of the network (e.g., routers, gateway routers, etc.), and the set of wireless links or edges E between the nodes and users.
  • the network information may serve as a basis for the routing algorithm 114 to work.
  • the position of routers 102 and gateways 104 may typically be easy to obtain (e.g., if the routers 102 and gateways 104 are stationary), and the positions of such entities are handled or determined by a centralized entity.
  • the position of each of the users can be obtained using the positioning sensor 36 as described above or, for example, by multilateration or simply by modeling the position by the routers 102 the each user can reach.
  • a link weight matrix G may be calculated based on the initial positions of the users, collision domain and transmitter-receiver (Tx-Rx) models.
  • the G may be a graph representing collision domain load on each link.
  • the G may ultimately determine routing path selection for the users and may be modified several times in SAFARI such that the G may reflect the current network condition at any given time.
  • the first calculation of G may not take into account channel assignment, since the used channel assignment algorithm 1 12 may need an estimate of the traffic demand. Accordingly, the traffic load may be estimated using collision domain based on the initial positions of the users.
  • channels may be assigned using a modified MeshTiC for one example of the channel assignment algorithm 112 and G may be updated to match the channel assignment.
  • Channels may be assigned to the links identified in E, since an estimate of traffic in the network is available at this point.
  • G may then be updated to match the channel assignment.
  • the Tx-Rx model may take into account the channel assignment such that, for example, links interfere only if the links are within the interference range and use the same channel.
  • the "best known paths” may be determined using G and an algorithm such as, for example, the Floyd-Warshall (FW) algorithm.
  • the best known paths may include every possible path for each user in the network.
  • the best known paths may be considered to be the 'shortest' paths from the users to gateways and the shortest paths may be used in the determination of the best router to which each user should attach in lines 6 to 8.
  • the shortest path may be considered the path for a particular user (e.g., user k among a set of users (S)) that has the least amount of other traffic associated therewith.
  • the shortest path for any user may be considered the path among all possible paths for the user that is least busy or offers the lowest potential for collision.
  • Line 5 begins a sequence in lines 6 to 8 in which, for each user, a router is selected that corresponds to the best known path to a gateway (e.g., a shortest path to a gateway from the user in terms of potential for collision).
  • the router associated with the shortest path may then be connected to by the user.
  • a modified FW algorithm may be used, since the modified FW algorithm may incorporate a collision domain metric and may perform necessary routing within a relatively short time, e.g., the running time of FW may be O(
  • the determination of the router to which each user attaches may be made by simply selecting the router for which the path to any gateway is shortest. With this kind of router selection, the randomness of user position may be diminished and overall network throughput may be increased since, for example, in most cases a router selection procedure may lead to a fewer number of hops between nodes for the user to reach a destination.
  • the routing order may be determined on line 10.
  • Low collision domain areas such as links and corresponding nodes with low collision domain load (C h ad) may be routed first since these areas are usually at the border of a network thus their routing may be considered essential since when the users are far away from gateways the number of hops typically increases. Thus, if far away users were routed last the number of hops may increase even more, which could make the capacity constraints may become increasingly strict and ultimately cause the throughput to decrease. Thus the aggregate number of hops in the network may be reduced, or even minimized in some cases, by routing far away users first.
  • the routing order (S ne w) may be stored at line 1 1.
  • every user may be routed in the decided order indicated by the routing order to the corresponding best gateway for the respective user and the G may be updated to reflect current network conditions.
  • Each user may be routed individually using FWs algorithm and the best gateway for the respective user may be selected according to a cumulative collision domain metric.
  • the FW algorithm may provide that even a large number of gateways may not increase the running time of the algorithm.
  • G may be updated according to and along the chosen path.
  • an LP-problem may be executed, which may allocate the highest possible rates subject to capacity and fairness constraints. Solving the LP-problem, optimal rate allocation with chosen paths is performed.
  • FIG. 4 is a flowchart of a system, method and program product according to exemplary embodiments of the invention. It will be understood that each block or step of the flowcharts, and combinations of blocks in the flowcharts, can be implemented by various means, such as hardware, firmware, and/or software including one or more computer program instructions. For example, one or more of the procedures described above may be embodied by computer program instructions.
  • the computer program instructions which embody the procedures described above may be stored by a memory device or server and executed by a processor.
  • any such computer program instructions may be loaded onto a computer or other programmable apparatus (i.e., hardware) to produce a machine, such that the instructions which execute on the computer or other programmable apparatus create means for implementing the functions specified in the flowcharts block(s) or step(s).
  • These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowcharts block(s) or step(s).
  • the computer program instructions may also be loaded onto a computer or other programmable apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer- implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowcharts block(s) or step(s).
  • blocks or steps of the flowcharts support combinations of means for performing the specified functions, combinations of steps for performing the specified functions and program instruction means for performing the specified functions. It will also be understood that one or more blocks or steps of the flowcharts, and combinations of blocks or steps in the flowcharts, can be implemented by special purpose hardware-based computer systems which perform the specified functions or steps, or combinations of special purpose hardware and computer instructions.
  • one embodiment of a method for enabling routing in a network as provided in FIG. 4 may include receiving position information for a plurality of network nodes at operation 200.
  • the method may further include determining possible paths between a user and a destination and traffic information related to each determined possible path.
  • the method may further include selecting a router for connection by the user based on the position information and the traffic information at operation 220.
  • an additional operation 215 may include generating a graph of collision domain load for each link in each of the possible paths.
  • the graph may include the traffic information.
  • determining possible paths may include determining the possible paths based on the graph.
  • the method may further include determining a routing order for a plurality of users based on the position information at operation 230.
  • the method may further include selecting a gateway for connection to each user via the respective router to which the user is connected at operation 240.
  • the method may further include updating the graph after completion of routing for each user based on the routing order or after selection of the gateway for each user at operation 250.
  • determining the routing order may include arranging users in low collision domain regions before users in high collision domain regions in the routing order.
  • selecting the router for connection may include selecting a router in a possible path that provides a lower likelihood of collision with other traffic, or selecting a router in a possible path that includes a lower amount of traffic than other possible paths.
  • the gateway may be selected based on a cumulative collision domain of the possible path.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

L'invention porte sur un appareil pour permettre un routage dans un réseau, lequel appareil peut inclure un processeur. Le processeur peut être configuré pour recevoir des informations de position pour une pluralité de nœuds de réseau, déterminer des trajets possibles entre un utilisateur et une destination et des informations de trafic relatives à chaque trajet possible déterminé, et sélectionner un routeur pour une connexion par l'utilisateur, sur la base des informations de position et des informations de trafic. L'invention porte également sur un procédé et un produit de programme d'ordinateur pour un routage dans un réseau.
PCT/FI2008/000057 2008-05-07 2008-05-07 Procédé, appareil et produit de programme d'ordinateur pour assurer un routage dans un réseau WO2009135981A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PCT/FI2008/000057 WO2009135981A1 (fr) 2008-05-07 2008-05-07 Procédé, appareil et produit de programme d'ordinateur pour assurer un routage dans un réseau

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/FI2008/000057 WO2009135981A1 (fr) 2008-05-07 2008-05-07 Procédé, appareil et produit de programme d'ordinateur pour assurer un routage dans un réseau

Publications (1)

Publication Number Publication Date
WO2009135981A1 true WO2009135981A1 (fr) 2009-11-12

Family

ID=41264466

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/FI2008/000057 WO2009135981A1 (fr) 2008-05-07 2008-05-07 Procédé, appareil et produit de programme d'ordinateur pour assurer un routage dans un réseau

Country Status (1)

Country Link
WO (1) WO2009135981A1 (fr)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP2448333A1 (fr) * 2010-10-27 2012-05-02 Vodafone Group PLC Procédé et dispositifs pour la fourniture d'un trafic local dans une cellule ou un groupe de cellules d'un réseau de communication cellulaire
EP2518950A4 (fr) * 2009-12-25 2017-11-01 Panasonic Intellectual Property Management Co., Ltd. Système de reconnaissance de position de réseau et dispositif de reconnaissance de position de terminal
US10425340B2 (en) 2016-04-05 2019-09-24 Teridion Technologies Ltd Global optimization and load balancing in networks

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1056246A2 (fr) * 1999-05-27 2000-11-29 AT&T Corp. Procédé d'achéminement pour le protocol Internet basse sur la classe de service
WO2002013023A1 (fr) * 2000-08-08 2002-02-14 Prominence Networks, Inc. Multiplexage de plusieurs sessions individuelles d'applications sur une session de protocole de reservation pre-allouee dans un systeme vocal sur internet (voip)
WO2005062580A1 (fr) * 2003-12-23 2005-07-07 Telefonaktiebolaget Lm Ericsson (Publ) Procede d'exploration des capacites d'un routeur d'acces candidat
US7009987B1 (en) * 1998-10-30 2006-03-07 Kabushiki Kaisha Toshiba Router device and cut-through path control method for realizing load balancing at intermediate routers

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7009987B1 (en) * 1998-10-30 2006-03-07 Kabushiki Kaisha Toshiba Router device and cut-through path control method for realizing load balancing at intermediate routers
EP1056246A2 (fr) * 1999-05-27 2000-11-29 AT&T Corp. Procédé d'achéminement pour le protocol Internet basse sur la classe de service
WO2002013023A1 (fr) * 2000-08-08 2002-02-14 Prominence Networks, Inc. Multiplexage de plusieurs sessions individuelles d'applications sur une session de protocole de reservation pre-allouee dans un systeme vocal sur internet (voip)
WO2005062580A1 (fr) * 2003-12-23 2005-07-07 Telefonaktiebolaget Lm Ericsson (Publ) Procede d'exploration des capacites d'un routeur d'acces candidat

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP2518950A4 (fr) * 2009-12-25 2017-11-01 Panasonic Intellectual Property Management Co., Ltd. Système de reconnaissance de position de réseau et dispositif de reconnaissance de position de terminal
EP2448333A1 (fr) * 2010-10-27 2012-05-02 Vodafone Group PLC Procédé et dispositifs pour la fourniture d'un trafic local dans une cellule ou un groupe de cellules d'un réseau de communication cellulaire
US8862132B2 (en) 2010-10-27 2014-10-14 Vodafone Ip Licensing Limited Providing local traffic in a cell or group of cells of a cellular communication network
US10425340B2 (en) 2016-04-05 2019-09-24 Teridion Technologies Ltd Global optimization and load balancing in networks

Similar Documents

Publication Publication Date Title
JP6096836B2 (ja) ネットワークアクセスを電子デバイスに提供するシステム及び方法
US9271179B2 (en) Customized coexistence management based on user behavior
US8489108B2 (en) Method and system for load-balancing across multiple access networks
JP4791378B2 (ja) 通信端末及びこれを備えた移動体通信システム
JP2004274741A (ja) 自動無線接続選択
JPWO2008004561A1 (ja) 無線基地局、負荷分散装置、集中制御装置、無線通信システム、負荷分散方法及び負荷分散プログラム
US8374165B2 (en) Method, apparatus, and computer program product for communication routing
CN114915653A (zh) 一种通信方法和通信装置
KR101194140B1 (ko) 라우트 메트릭을 결정하는 방법 및 장치
JP2007074011A (ja) 無線通信端末およびＱｏＳ情報収集方法
US7653391B2 (en) Mobile terminal and mobile communication method
WO2009135981A1 (fr) Procédé, appareil et produit de programme d'ordinateur pour assurer un routage dans un réseau
US9078202B2 (en) Apparatus and method for actively determining communication link in communication system
CN107006005B (zh) 用于处理无线电频谱中的信道的方法和模块
JP4712534B2 (ja) 移動体通信システム、無線制御サーバ、および無線通信端末
CN111757340A (zh) 一种确定服务区域的方法、装置及系统
WO2012073059A1 (fr) Procédés, appareils et produits programme d'ordinateur pour utiliser des liaisons descendante et montante sur canaux radio séparés ou opérateurs différents
JP5397331B2 (ja) 通信端末、経路選択方法及び通信方式
US8391208B1 (en) Methods of setting mobile internet protocol timer value
US20140314058A1 (en) Optimizing device service availability and usage in a wireless personal network
CN118337684A (zh) 一种软件定义网络多路径编排方法、装置、设备及介质
CN118300977A (zh) 一种软件定义网络路径切换方法、装置、设备及介质
JP2005136909A (ja) 無線通信装置
Yang et al. Multimedia Communications over Next Generation Wireless Networks

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 08761611

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 08761611

Country of ref document: EP

Kind code of ref document: A1