WO2002078260A1 - Method and arrangement for automatic configuration of node in a timeslot oriented network - Google Patents

Method and arrangement for automatic configuration of node in a timeslot oriented network Download PDF

Info

Publication number
WO2002078260A1
WO2002078260A1 PCT/SE2002/000521 SE0200521W WO02078260A1 WO 2002078260 A1 WO2002078260 A1 WO 2002078260A1 SE 0200521 W SE0200521 W SE 0200521W WO 02078260 A1 WO02078260 A1 WO 02078260A1
Authority
WO
WIPO (PCT)
Prior art keywords
new node
node
request message
link layer
timeslot group
Prior art date
Application number
PCT/SE2002/000521
Other languages
French (fr)
Inventor
Akbar Yassarati
Original Assignee
Telefonaktiebolag L M Ericsson (Publ)
WALDENFJORD, Mårten
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
Priority claimed from SE0101036A external-priority patent/SE0101036D0/en
Application filed by Telefonaktiebolag L M Ericsson (Publ), WALDENFJORD, Mårten filed Critical Telefonaktiebolag L M Ericsson (Publ)
Publication of WO2002078260A1 publication Critical patent/WO2002078260A1/en

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/08—Configuration management of networks or network elements
    • H04L41/0803—Configuration setting
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q3/00—Selecting arrangements
    • H04Q3/0016—Arrangements providing connection between exchanges
    • H04Q3/0062—Provisions for network management
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
    • H04L69/30—Definitions, standards or architectural aspects of layered protocol stacks
    • H04L69/32—Architecture of open systems interconnection [OSI] 7-layer type protocol stacks, e.g. the interfaces between the data link level and the physical level
    • H04L69/322—Intralayer communication protocols among peer entities or protocol data unit [PDU] definitions
    • H04L69/324—Intralayer communication protocols among peer entities or protocol data unit [PDU] definitions in the data link layer [OSI layer 2], e.g. HDLC

Definitions

  • the present invention refers to a method and an arrangement for implementing a new node in a network, the new node in the network being adapted to be connected to an installed node via a timeslot oriented transmission link, and the installed node network being adapted to be configured to establish a connection with the new node using a pre-arranged timeslot group.
  • the booting nodes To get the initial IP-connectivity, that is necessary in order to access the configuration servers, the booting nodes must configure the link layer automatically. This is usually no problem in the case the link-layer protocol is Ethernet. However, when the IP network consists of PPP connections built on timeslot oriented transmission links, it is not possible to start the link-layer protocol without knowledge about the timeslot configuration on the link. For detailed information on the PPP, we refer to "The Point-to-Point protocol (PPP) RFC 1661".
  • PPP Point-to-Point protocol
  • an installed node is pre-configured and that a new node is about to set up its PPP connection with the network. Because the installed node is already configured and working it has tried to set up the PPP session with the new node. It has sent configure request messages but has not received any response, because the new node has been non-active.
  • the installed node is now in Idle-state, in which it keeps sending HDLC Flags and listen to the line for a con- figuration request from the peer. When the installed node is in idle state there is a possibility that it stops transmitting HDLC flags and is active only on receiving side.
  • a way to solve the problem for the new node would be to analyze all the timeslots of the incoming link and categorize the traffic. This would require the new node knowing exactly what types of traffic it may receive on the links, which could be anything, i.e. not only PPP. This method is thus not feasible for implementation, be- cause of the high complexity in the algorithm. It is thus not considered a solution to our problem.
  • the object is met by a method and an arrangement for implementing a new node in a network, at which the new node sends a link layer configure request message on a selected attempt timeslot group.
  • the installed node repeatedly sends, on the pre-arranged timeslot group, identical configure request messages. If the new node does not receive a response or, alternatively, a configure request message, it selects a different attempt timeslot group and repeats the procedure. If the new node receives a response or, alternatively, a configure request message it is determined that the attempt timeslot group is identical to the pre-arranged timeslot group.
  • the invention eliminates the need for manual specification of the timeslot configuration at installation time.
  • the method according to the invention could be used as a fallback or secondary alternative to manual configuration, at which it would be possible to recover from manual miss-configurations.
  • the method according to the invention can be used to install a node before the network is up and running, the new node being located at the edge of the network.
  • the new node and other nodes at the edge of the network can establish the PPP sessions automatically.
  • - fig. 1 shows schematically an IP network
  • - fig. 2 is a flow chart depicting steps in a method according to a first embodiment of the invention.
  • - fig. 3 is a flow chart depicting steps in a method according to a second embodiment of the invention.
  • Fig. 1 shows schematically a part of an IP network NW comprising an installed node A, a new node B and a third node C.
  • the network NW is adapted to establish PPP (Point-to-Point Protocol) connections built on timeslot oriented transmission links, and comprises a configuration data server CDS storing data for implementa- tion of new nodes in the network.
  • the configuration data server CDS could be a DHCP, LDAP or FTP type of server.
  • installed node should be understood as a node being physically installed. It could also be configured to establish the PPP sessions, but as will be described below, the invention is also adapted to a situation where the installed node A is not yet configured to establish the PPP sessions, for example, where the implementation of the new node B is commenced before the network is up and running, the new node B being located at the edge of the network.
  • the new node B and the third node C are to be implemented in the network NW.
  • a time slot switch TSS in the new node B is responsible to switch the timeslots to the correct destinations.
  • the timeslots switched to the third node C does not belong to the new node B.
  • the installed node A is pre-configured and that the new node B is about to set up its PPP connection with the network. Because the new node B is not aware of the configuration of the installed node A, a method is required to determine which timeslots it must use in order to set up the PPP connection with the network.
  • the installed node A is configured to establish a connection with the new node B using an established group of timeslots, here referred to as a pre-arranged timeslot group PTG.
  • the connecting node selects an attempt timeslot group ATG on which to send a link layer configure request message, on the form of a PPP configure request message CRM, (see block 101).
  • the new node B sends the link layer configure request message CRM on the selected attempt timeslot group ATG, (block 102), and listens, during a predetermined listening time interval, for a PPP response from the configured node, i.e. the installed node A in fig. 1, (block 103).
  • the new node B If the new node B does not receive a response to the link layer configure request message CRM during the listening time interval, it selects a different attempt time- slot group ATG on which to send the link layer configure request message CRM, (block 104), and repeats the procedure. If the new node B receives a response to the link layer configure request message CRM during the listening time interval, it can be determined that the attempt time- slot group ATG is identical to the pre-arranged timeslot group PTG, (see block 105). Thereby, it has found the timeslot group that can be used to establish the connection the installed node A.
  • the attempt timeslot group ATG are selected according to a scheme stored in non- volatile memory of the connecting node, i.e. the new node B.
  • the scheme is chosen to be suited for the network.
  • the scheme is adapted to reduce the number of possible timeslot groups by allowing only timeslot groups that contains multiples of a certain number of consecutive timeslots.
  • the scheme is adapted to protect some timeslots on the link that are destined to another node, e.g. the third node C in fig. 1.
  • the new/connecting node For the new/connecting node to be sure to find its peer, it loops through the scheme indefinitely.
  • the reason for this is that, although the number of possible attempt timeslot groups is finite, and moreover, limited by the scheme for selecting them, there is a possibility of the connecting node not finding the pre-arranged time- slot group, despite having tried all timeslot groups indicated by the scheme.
  • the reason could be, for example, a temporary non-availability of the installed node A.
  • Another reason could be that, in the case the connecting node is installed before the network is up and running and the connecting node is located at the edge of the network, the peer of the connecting node is not yet properly configured.
  • the installed node A is configured with a pre-arranged timeslot group PTG, intended to be used to establish a connection to a node being added to the network, the new node B.
  • the installed node A is configured to continuously send PPP configure request messages. More specifically, the installed node A repeatedly sends, on the pre-arranged timeslot group PTG, identical link layer configure request messages CRM, separated by a predetermined sending time interval.
  • the new connecting node selects an attempt timeslot group ATG on which to listen for the link layer configure request message CRM, see block 201.
  • the new node B listens for the configure request message CRM on the selected attempt timeslot group, (block 202), during a predetermined listening time interval, being at least as long as the sending time interval. If it does not receive the link layer configure request message during the listening time interval, the new node B selects a different attempt timeslot group on which to listen for the link layer configure request message, (block 204), and repeats the procedure.
  • the new node B receives the link layer configure request message CRM during the listening time interval, it can be determined that the attempt timeslot group is identical to the pre-arranged timeslot group, (see block 205). Thereby, it has found the timeslot group that can be used to set up the connection with the installed node A.

Abstract

The invention presents a method for implementing a new node (B) in a network. An installed node (A) is adapted to be connected to the new node (B) via a timeslot oriented transmission link, and configured to establish a connection with the new node (B) using a pre-arranged timeslot group (PTG). The new node (B) sends a link layer configure request message (CRM) on a selected attempt timeslot group (ATG). Alternatively, the installed node (A) repeatedly sends, on the pre-arranged timeslot group (PTG), identical configure request messages. If the new node (B) does not receive a response or, alternatively, a configure request message, it selects a different attempt timeslot group (ATG). If the new node (B) receives a response or, alternatively, a configure request message it is determined that the attempt timeslot group (ATG) is identical to the pre-arranged timeslot group (PTG).

Description

Method and arrangement for automatic configuration of node in a timeslot oriented network .
TECHNICAL FIELD OF THE INVENTION
The present invention refers to a method and an arrangement for implementing a new node in a network, the new node in the network being adapted to be connected to an installed node via a timeslot oriented transmission link, and the installed node network being adapted to be configured to establish a connection with the new node using a pre-arranged timeslot group.
DESCRIPTION OF RELATED ART
Future implementations of wireless IP networks will consist of an increasing amount of routers, many of them embedded in radio base stations. The large amount of in- stallation operations resulting from this requires new approaches to be applied to automatic address and node configuration. Routers that are introduced in the network must require a minimum amount of manually entered configuration information.
It is known to use central network servers, such as DHCP-, LDAP- and FTP-servers, to hold configuration data, making it possible for the introduction of new nodes in the network to be prepared for in advance. This way the introduction of new nodes is simplified. Booting nodes will fetch their configuration from servers in the IP- network.
To get the initial IP-connectivity, that is necessary in order to access the configuration servers, the booting nodes must configure the link layer automatically. This is usually no problem in the case the link-layer protocol is Ethernet. However, when the IP network consists of PPP connections built on timeslot oriented transmission links, it is not possible to start the link-layer protocol without knowledge about the timeslot configuration on the link. For detailed information on the PPP, we refer to "The Point-to-Point protocol (PPP) RFC 1661".
In order to accomplish automatic set-up of PPP connections on fractional links, e.g. links where a number of timeslots are grouped together to constitute a channel, it is necessary to have a method making it possible to detect the timeslot configuration of the link automatically.
Currently, to start a PPP session requires knowledge about the timeslot confϊgura- tion of the link. Today, every time a new node is introduced in the network, the configuration of the PCM fraction to be used by PPP must be configured in the node manually. The connecting node will send out configure request messages on the defined fraction and await an answer from the peer node. If no response is received from the peer node, the new, i.e. the connecting node will assume that the peer is temporarily down. In this state the new node will idle and wait for the peer node to re-start the link negotiation. The new node will stay in this state, even if the lack of response is due to a miss-configuration of timeslots on its own interface.
To illustrate the problem, we assume that an installed node is pre-configured and that a new node is about to set up its PPP connection with the network. Because the installed node is already configured and working it has tried to set up the PPP session with the new node. It has sent configure request messages but has not received any response, because the new node has been non-active. The installed node is now in Idle-state, in which it keeps sending HDLC Flags and listen to the line for a con- figuration request from the peer. When the installed node is in idle state there is a possibility that it stops transmitting HDLC flags and is active only on receiving side.
Because the new node is not aware of the configuration of the installed node, a method is required to determine what timeslots it must use in order to set up the PPP connection with the network. A way to solve the problem for the new node would be to analyze all the timeslots of the incoming link and categorize the traffic. This would require the new node knowing exactly what types of traffic it may receive on the links, which could be anything, i.e. not only PPP. This method is thus not feasible for implementation, be- cause of the high complexity in the algorithm. It is thus not considered a solution to our problem.
SUMMARY
It is an object of the present invention to decrease the amount of manual operations when installing a new node in a telecommunications network.
The object is met by a method and an arrangement for implementing a new node in a network, at which the new node sends a link layer configure request message on a selected attempt timeslot group. Alternatively, the installed node repeatedly sends, on the pre-arranged timeslot group, identical configure request messages. If the new node does not receive a response or, alternatively, a configure request message, it selects a different attempt timeslot group and repeats the procedure. If the new node receives a response or, alternatively, a configure request message it is determined that the attempt timeslot group is identical to the pre-arranged timeslot group.
The invention eliminates the need for manual specification of the timeslot configuration at installation time.
The method according to the invention could be used as a fallback or secondary alternative to manual configuration, at which it would be possible to recover from manual miss-configurations.
Also, the method according to the invention can be used to install a node before the network is up and running, the new node being located at the edge of the network. At the time the network is configured, the new node and other nodes at the edge of the network can establish the PPP sessions automatically.
BRIEF DESCRIPTION OF THE DRAWINGS
The invention will now be described in greater detail, with the aid of the accompanying drawings, on which
- fig. 1 shows schematically an IP network,
- fig. 2 is a flow chart depicting steps in a method according to a first embodiment of the invention, and
- fig. 3 is a flow chart depicting steps in a method according to a second embodiment of the invention.
DETAILED DESCRIPTION OF EMBODIMENTS
Fig. 1 shows schematically a part of an IP network NW comprising an installed node A, a new node B and a third node C. The network NW is adapted to establish PPP (Point-to-Point Protocol) connections built on timeslot oriented transmission links, and comprises a configuration data server CDS storing data for implementa- tion of new nodes in the network. The configuration data server CDS could be a DHCP, LDAP or FTP type of server.
The term "installed node" should be understood as a node being physically installed. It could also be configured to establish the PPP sessions, but as will be described below, the invention is also adapted to a situation where the installed node A is not yet configured to establish the PPP sessions, for example, where the implementation of the new node B is commenced before the network is up and running, the new node B being located at the edge of the network. The new node B and the third node C are to be implemented in the network NW. In a link LI between the installed node A and the new node B, only some of the time- slots transmitted by the installed node A are destined for the new node B. The rest of the timeslots are intended to be received by the third node C. A time slot switch TSS in the new node B is responsible to switch the timeslots to the correct destinations. The timeslots switched to the third node C does not belong to the new node B.
As an example, we assume that the installed node A is pre-configured and that the new node B is about to set up its PPP connection with the network. Because the new node B is not aware of the configuration of the installed node A, a method is required to determine which timeslots it must use in order to set up the PPP connection with the network.
We here refer to fig. 2. The installed node A is configured to establish a connection with the new node B using an established group of timeslots, here referred to as a pre-arranged timeslot group PTG. According to a first embodiment of the invention, the connecting node, the new node B in fig. 1, selects an attempt timeslot group ATG on which to send a link layer configure request message, on the form of a PPP configure request message CRM, (see block 101).
The new node B sends the link layer configure request message CRM on the selected attempt timeslot group ATG, (block 102), and listens, during a predetermined listening time interval, for a PPP response from the configured node, i.e. the installed node A in fig. 1, (block 103).
If the new node B does not receive a response to the link layer configure request message CRM during the listening time interval, it selects a different attempt time- slot group ATG on which to send the link layer configure request message CRM, (block 104), and repeats the procedure. If the new node B receives a response to the link layer configure request message CRM during the listening time interval, it can be determined that the attempt time- slot group ATG is identical to the pre-arranged timeslot group PTG, (see block 105). Thereby, it has found the timeslot group that can be used to establish the connection the installed node A.
Preferably, the attempt timeslot group ATG are selected according to a scheme stored in non- volatile memory of the connecting node, i.e. the new node B. The scheme is chosen to be suited for the network. According to a first aspect of the first embodiment, the scheme is adapted to reduce the number of possible timeslot groups by allowing only timeslot groups that contains multiples of a certain number of consecutive timeslots. According to a second aspect of the first embodiment, the scheme is adapted to protect some timeslots on the link that are destined to another node, e.g. the third node C in fig. 1.
Preferably, for the new/connecting node to be sure to find its peer, it loops through the scheme indefinitely. The reason for this is that, although the number of possible attempt timeslot groups is finite, and moreover, limited by the scheme for selecting them, there is a possibility of the connecting node not finding the pre-arranged time- slot group, despite having tried all timeslot groups indicated by the scheme. The reason could be, for example, a temporary non-availability of the installed node A. Another reason could be that, in the case the connecting node is installed before the network is up and running and the connecting node is located at the edge of the network, the peer of the connecting node is not yet properly configured.
We here refer to fig. 3. As mentioned above, the installed node A is configured with a pre-arranged timeslot group PTG, intended to be used to establish a connection to a node being added to the network, the new node B. According to a second embodiment of the invention, the installed node A is configured to continuously send PPP configure request messages. More specifically, the installed node A repeatedly sends, on the pre-arranged timeslot group PTG, identical link layer configure request messages CRM, separated by a predetermined sending time interval.
According to the second embodiment of the invention, the new connecting node, the new node B selects an attempt timeslot group ATG on which to listen for the link layer configure request message CRM, see block 201. The new node B listens for the configure request message CRM on the selected attempt timeslot group, (block 202), during a predetermined listening time interval, being at least as long as the sending time interval. If it does not receive the link layer configure request message during the listening time interval, the new node B selects a different attempt timeslot group on which to listen for the link layer configure request message, (block 204), and repeats the procedure.
If the new node B receives the link layer configure request message CRM during the listening time interval, it can be determined that the attempt timeslot group is identical to the pre-arranged timeslot group, (see block 205). Thereby, it has found the timeslot group that can be used to set up the connection with the installed node A.
The scheme defining what fractions to test, which was described above in connec- tion to the first embodiment of the invention, is applicable also in the second embodiment. Also, in a manner corresponding to what was described in connection to the first embodiment, the connecting node can loop through the scheme indefinitely.

Claims

1. A method for implementing a new node in a network, the new node (B) in the network being adapted to be connected to an installed node (A) via a timeslot oriented transmission link, and the installed node (A) network being adapted to be configured to establish a connection with the new node (B) using a prearranged timeslot group (PTG), characterized in that it comprises the steps of a) selecting an attempt timeslot group (ATG), b) sending a link layer configure request message (CRM) on the selected attempt timeslot group (ATG), or on the pre-arranged timeslot group (PTG), c) listening for a response to the link layer configure request message (CRM), or for the link layer configure request message (CRM) itself, respectively, d) selecting, if a response to the link layer configure request message (CRM) or the link layer configure request message (CRM) itself, respectively, is not received, a different attempt timeslot group (ATG), and e) determining, if a response to the link layer configure request message (CRM) or the link layer configure request message (CRM) itself, respectively, is received, that the attempt timeslot group (ATG) is identical to the pre-arranged timeslot group (PTG).
2. A method for implementing a new node in a network, according to claim 1, characterized by a) the new node (B) selecting an attempt timeslot group (ATG), b) the new node (B) sending a link layer configure request message (CRM) on the selected attempt timeslot group (ATG), c) the new node (B) listening, during a predetermined listening time interval, for a response to the link layer configure request message (CRM), d) the new node (B), if it does not receive a response to the link layer configure request message (CRM) during the listening time interval, selecting a different at- tempt timeslot group (ATG), and repeating the steps b - d, and e) the new node (B), if it receives a response to the link layer configure request message (CRM) during the listening time interval, determining that the attempt timeslot group (ATG) is identical to the pre-arranged timeslot group (PTG).
3. A method for implementing a new node in a network, according to claim 1, characterized by a) the installed node (A) repeatedly sending, on the pre-arranged timeslot group (PTG), identical link layer configure request messages, separated by a predetermined sending time interval, . b) the new node (B) selecting an attempt timeslot group (ATG), c) the new node (B) listening for the link layer configure request message (CRM) on the selected attempt timeslot group (ATG) during a predetermined listening time interval, being at least as long as the sending time interval, d) the new node (B), if it does not receive the link layer configure request message (CRM) during the listening time interval, selecting a different attempt timeslot group (ATG), and repeating the steps c - d, and e) the new node (B), if it receives the link layer configure request message (CRM) during the listening time interval, determining that the attempt timeslot group (ATG) is identical to the pre-arranged timeslot group (PTG).
4. An arrangement for implementing a new node in a network, the new node (B) in the network being adapted to be connected to an installed node (A) via a timeslot oriented transmission link, and the installed node (A) network being adapted to be configured to establish a connection with the new node (B) using a pre- arranged timeslot group (PTG), characterized by a) the new node (B) being adapted to select an attempt timeslot group (ATG), b) the new node (B) being adapted to send a link layer configure request message (CRM) on the selected attempt timeslot group (ATG), c) the new node (B) being adapted to listen, during a predetermined listening time interval, for a response to the link layer configure request message (CRM), d) the new node (B) being adapted to, if it does not receive a response to the link layer configure request message (CRM) during the listening time interval, select a different attempt timeslot group (ATG), send a link layer configure request message (CRM) on the selected attempt timeslot group (ATG) and listen, during the predetermined listening time interval, for a response to the link layer configure request message (CRM), and e) the new node (B) being adapted to, if it receives a response to the link layer configure request message (CRM) during the listening time interval, determine that the attempt timeslot group (ATG) is identical to the pre-arranged timeslot group (PTG).
5. An arrangement for implementing a new node in a network, the new node (B) in the network being adapted to be connected to an installed node (A) via a timeslot oriented transmission link, and the installed node (A) network being adapted to be configured to establish a connection with the new node (B) using a prearranged timeslot group (PTG), characterized by a) the installed node (A) being adapted to repeatedly send, on the pre-arranged timeslot group (PTG), identical link layer configure request messages, separated by a predetermined sending time interval, b) the new node (B) being adapted to select an attempt timeslot group (ATG), c) the new node (B) being adapted to listen for the link layer configure request message (CRM) on the selected attempt timeslot group (ATG) during a predetermined listening time interval, being at least as long as the sending time interval, d) the new node (B) being adapted to, if it does not receive the link layer configure request message (CRM) during the listening time interval, select a different attempt timeslot group (ATG), and listen for the link layer configure request message (CRM) on the selected attempt timeslot group (ATG) during the predetermined listening time interval, and the new node (B) being adapted to, if it receives the link layer configure request message (CRM) during the listening time interval, determine that the attempt timeslot group (ATG) is identical to the pre-arranged timeslot group (PTG).
PCT/SE2002/000521 2001-03-23 2002-03-19 Method and arrangement for automatic configuration of node in a timeslot oriented network WO2002078260A1 (en)

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
SE0101036A SE0101036D0 (en) 2001-03-23 2001-03-23 PPP dection on timeslot oriented links
SE0101036-2 2001-03-23
SE0102075-9 2001-06-12
SE0102075A SE0102075D0 (en) 2001-03-23 2001-06-12 A method in a telecommunication network

Publications (1)

Publication Number Publication Date
WO2002078260A1 true WO2002078260A1 (en) 2002-10-03

Family

ID=26655417

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/SE2002/000521 WO2002078260A1 (en) 2001-03-23 2002-03-19 Method and arrangement for automatic configuration of node in a timeslot oriented network

Country Status (2)

Country Link
SE (1) SE0102075D0 (en)
WO (1) WO2002078260A1 (en)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1460859A1 (en) * 2003-03-19 2004-09-22 Siemens Aktiengesellschaft Method, system and apparatus for managing signaling connections in a telecommunications network
EP1460860A1 (en) * 2003-03-19 2004-09-22 Siemens Aktiengesellschaft Method, system and apparatus for managing bearer connections in a telecommunications network
WO2007118383A1 (en) * 2006-04-19 2007-10-25 Huawei Technologies, Co., Ltd. A method and device for feeding back link parameter configuration result
US8819200B2 (en) 2007-07-25 2014-08-26 International Business Machines Corporation Automated cluster node configuration

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5453977A (en) * 1994-02-08 1995-09-26 Metricom, Inc. Method for network configuration via third party query
WO2000079738A1 (en) * 1999-06-18 2000-12-28 Telefonaktiebolaget Lm Ericsson (Publ) Method and system for communication

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5453977A (en) * 1994-02-08 1995-09-26 Metricom, Inc. Method for network configuration via third party query
WO2000079738A1 (en) * 1999-06-18 2000-12-28 Telefonaktiebolaget Lm Ericsson (Publ) Method and system for communication

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
FIGUEROA JUAN, GUZEK BILL: "Cable modems-broadband highway to the home", ERICSSON REVIEW, vol. 1, 2001, pages 37 *

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1460859A1 (en) * 2003-03-19 2004-09-22 Siemens Aktiengesellschaft Method, system and apparatus for managing signaling connections in a telecommunications network
EP1460860A1 (en) * 2003-03-19 2004-09-22 Siemens Aktiengesellschaft Method, system and apparatus for managing bearer connections in a telecommunications network
WO2007118383A1 (en) * 2006-04-19 2007-10-25 Huawei Technologies, Co., Ltd. A method and device for feeding back link parameter configuration result
US8050190B2 (en) 2006-04-19 2011-11-01 Huawei Technologies Co., Ltd. Method and device for feeding back link parameter configuration result
US8819200B2 (en) 2007-07-25 2014-08-26 International Business Machines Corporation Automated cluster node configuration

Also Published As

Publication number Publication date
SE0102075D0 (en) 2001-06-12

Similar Documents

Publication Publication Date Title
RU2199834C2 (en) Mobile radio communication protocol transmission from one point to plurality of points
KR100866931B1 (en) Identification of unused resources in a packet data network
RU2419230C2 (en) Method and device to detect neighbouring units with support by end units
CN100574332C (en) Support the method and system that moves of portable terminal
JP3984763B2 (en) Communication method and apparatus
WO2009039012A1 (en) Method and device for providing an alternative backhaul portal in a mesh network
EP1249106A2 (en) Ad hoc networks comprising a plurality of terminals as controllers of sub-networks
WO2004021126A9 (en) Automatic channel selection in a radio access network
WO2001015387A1 (en) Direct mode communication method between two mobile terminals in access point controlled wireless lan systems
KR20040071131A (en) A method for setting up a ipoa channel based default administration channel
JP2001231082A (en) Method for transmitting encrypted number in communication system, and mobile communication system
US6907247B2 (en) Transfer of data packets in a wireless telecommunications system
US20040017769A1 (en) Method of establishing a route redundancy in a data transmission system using static routes
KR20020020848A (en) Reconfiguration of an ad hoc network
US7006478B1 (en) Communicating over one or more paths in an interface between a base station and a system controller
EP1821454B1 (en) Method, network and IP device for accelerating the propagation of an information concerning a detected server failure
WO2002078260A1 (en) Method and arrangement for automatic configuration of node in a timeslot oriented network
US7420951B1 (en) Packet-switched communications in a mobile network
KR20090119006A (en) A method and network connectivity device for opening a network link
US20030211847A1 (en) Managing transition of a mobile station to an idle state upon call release
CN100450278C (en) Method of access of radio network netgate for user's terminal
JP3936193B2 (en) Establishment of control channel in communication network
US7403475B1 (en) Method and apparatus for allocating data packet pathways
US20020018462A1 (en) Handling of data packets and voice calls in a wireless telecommunications system
US20060045087A1 (en) Method and apparatus for sending IP multicast packets in a wireless communication system

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A1

Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BY BZ CA CH CN CO CR CU CZ DE DK DM DZ EC EE ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NO NZ OM PH PL PT RO RU SD SE SG SI SK SL TJ TM TN TR TT TZ UA UG US UZ VN YU ZA ZM ZW

AL Designated countries for regional patents

Kind code of ref document: A1

Designated state(s): GH GM KE LS MW MZ SD SL SZ TZ UG ZM ZW AM AZ BY KG KZ MD RU TJ TM AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE TR BF BJ CF CG CI CM GA GN GQ GW ML MR NE SN TD TG

121 Ep: the epo has been informed by wipo that ep was designated in this application
DFPE Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101)
REG Reference to national code

Ref country code: DE

Ref legal event code: 8642

122 Ep: pct application non-entry in european phase
NENP Non-entry into the national phase

Ref country code: JP

WWW Wipo information: withdrawn in national office

Country of ref document: JP