EP1183618A1 - Communication network method and apparatus - Google Patents
Communication network method and apparatusInfo
- Publication number
- EP1183618A1 EP1183618A1 EP00918043A EP00918043A EP1183618A1 EP 1183618 A1 EP1183618 A1 EP 1183618A1 EP 00918043 A EP00918043 A EP 00918043A EP 00918043 A EP00918043 A EP 00918043A EP 1183618 A1 EP1183618 A1 EP 1183618A1
- Authority
- EP
- European Patent Office
- Prior art keywords
- record
- processing units
- state information
- processing unit
- service connection
- Prior art date
- Legal status (The legal status 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 status listed.)
- Withdrawn
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
- G06F9/5027—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
- H04L43/0805—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters by checking availability
- H04L43/0811—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters by checking availability by checking connectivity
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2209/00—Indexing scheme relating to G06F9/00
- G06F2209/50—Indexing scheme relating to G06F9/50
- G06F2209/503—Resource availability
-
- 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/06—Management of faults, events, alarms or notifications
Definitions
- the present invention generally relates to communication systems
- failure of a service connection is a
- FIG. 1 a conceptual block diagram of a communication
- 101 has a general connection 150 with a distributed network 190 that includes a
- Home server 101 includes network
- connection 140-1 may be assigned with at least one of the servers 120-1 through
- M for example a server 120-1 , to provide the requested service connection.
- server 120-1 normally is identified by a network address. Subsequently, client 110-
- Clients 110-1 through N may include any combination
- computing device such as a computer
- communication devices such as a
- an interactive display device such as a television, or a combination of
- the service may include service
- connection for transporting data, video or voice information for transporting data, video or voice information.
- the client 110-1 communicates with the home server 101 to receive an address of another server, selected from the servers 120-1 through M, to continue
- communication network system is to assign two servers to a communication service
- connection such that one server functions as the active server and another as a
- the standby server in this case has an
- CPU central processing unit
- the interruption may last for a range of 1-3 mSec. This method may
- a service connection 240-1 available for service connection at a time. For example, a service connection 240-1
- connection 220 If an initially assigned
- the common cluster 210 assigns a new address of the selected server to the
- the client 110-1 communicates with the common cluster
- a fault tolerant network communication system is implemented at very
- BTS base station transceiver sites
- BSC base station controllers
- MSC mobile station controllers
- BSC and MSC resources that have rigidly provided support services to that BTS.
- a distributed network may nevertheless be very expensive to
- FIG. 1 depicts a conceptual block diagram of a communication network according to a prior art.
- FIG. 2 depicts a conceptual block diagram of a communication network
- FIG. 3 depicts a conceptual block diagram of a communication network according to one or more aspects of the invention.
- FIG. 4 depicts an example of records stored at a memory unit.
- FIG. 5 depicts a conceptual block diagram of a distributed communication system network.
- FIG. 6 depicts a logical connection of various processing units according to
- FIG. 7 depicts a logical connection of various processing units according to
- processing units to a plurality K of clients, and a plurality N of memory units each
- a method includes
- the service connection is between a first of the K clients and a first of the
- the service connection may be between any of the K clients
- the record of state information associates, in a
- the associated record of state information stores at a first of the N memory units corresponding to the first
- the associated record of state information multicasts over the area network to be received by at least one of a second through N of the N processing
- the associated record of state information stores at one of the N memory
- the associated record of state information takes ownership in one of the
- the owner of the record may be the least one of the second
- N processing units or the first of the N processing units that initially
- the owner of the record of state information may
- the ownership may be relinquished by the least one of the second through N processing units, or the first of the N processing units.
- method may include identifying one of N processing units to take ownership of the
- storing may include at least one of retrieving, comparing, adding, updating, and
- a communication system network is improved at low cost and complexity.
- system includes an area network connecting a plurality N of processing units to a
- Each of the N memory units is partitioned to
- N memory segments by way of a step of recording various records.
- Each of the N memory segments corresponds to a processing unit of the N processing units.
- segments are not necessarily predefined in size or location in each memory unit.
- the size and location may change depending on the amount and specific record
- the N memory segments may or may not be
- Each memory segment may further include a number of memory
- Each segment may be defined
- a record of state information associated with a service connection is
- the service connection may be between a first of the K clients and a
- the record of state information is stored at a first of the N memory segments of one of the N memory units that corresponds to the first
- the first of the N memory segments corresponds to the first of the
- Partitioning the memory units to N memory segments may be by way of
- processing units each support at least one service
- each memory unit would have a record of state information being
- the memory units are like being partitioned to store records associated
- Memory segments thus, may or may not be fixed.
- each processing unit may be providing services to more than one service
- FIG. 3 one or more aspects of the invention are shown by way
- Block diagram 300 shows an area network 310
- Area network 310 connects a plurality N of processing
- the processing units 320-1 through 320-N has corresponding memory units, such as memory units 340-1 through 340-N.
- memory units 340-1 through 340-N Each of the N memory units 340-1 through
- 340-N is partitioned to N memory segments. Each memory segment corresponds to
- a processing unit and its associated records of state information. For example,
- memory unit 340-1 is partitioned to four segments, A, B, C and n, where segment
- segment B corresponds to processing unit
- the service connection may be between a first of the K clients, client
- processing unit 320-1 a first of the N processing units, processing unit 320-1.
- the state information 360 is stored at a first of the N memory unit 340-1.
- the record is
- the record of state information 360 is stored at the first of N memory
- Segmentation of the memory units may be by
- the record of state information 360 may include at least one of an owner of
- the owner of record identifies at least one of the N processing units, 320-1
- the record of state information 360 may be the first processing unit 320-1 ;
- the handle of record is a key identifier for owner of the record
- the version of record identifies a version of the
- the leader of record identifies the owner of the state record
- the state record information is in an inactivated state or off-line, owner of the state
- processing units A, B, C, and n are identified as processing units A, B, C, and n.
- Processing units A, B and n have more than one associated records.
- the memory unit 400 effectively is partitioned to
- each segment storing at least one record associated with a
- service connection may be made at any time or an existing one may be updated at
- processing unit 320-2 was the least one of the processing units that received the
- record of state information 360 may include at least one of retrieving, comparing,
- the record of state information may be performed for retrieving the record, adding
- a multicast of the record of state information may be done to a selected
- the processing unit may compare the record with one already exists in
- the leader of the record identifies which processing unit has the most up to
- a search routine may be implemented to find the most up-to-
- This may include a
- processing units may take the ownership. Furthermore, leading an ownership of a
- record may involve relinquishing ownership of the record of state information by a
- processing unit that currently owns the record.
- the processing unit that currently owns the record.
- state of information may be shared in asynchronous manner to allow updating and
- the invention includes asynchronous operation, it eliminates a need for synchronous
- a processing unit may be added or taken off line without effecting
- the invention supports operation of asynchronous networks.
- Such network systems allow messages from one processing unit to be send and
- a message may multicast from a single processing unit to a subset of
- processing units that form the network. Additionally, at least one processing unit
- the processing units set P: ⁇ A, B, ... n ⁇ is a set of processing units that
- a computing device may share information according to one or more aspects of the invention.
- a computing device may share information according to one or more aspects of the invention.
- processing unit may be defined as a hardware processing unit or a software processing unit or a combination of both as commonly known in relevant arts.
- members of the process set P are not limited to be co-located at a specific node in
- processing units of set P may be located as a set of
- Each member of the set may have two
- Each member also support multicast communication.
- processing unit from the set is able to send a message directly to another processing
- processing unit or alternatively, two processing units may communicate directly with each
- one processing unit can take over functionality of another
- each record is associated with a processing unit, the ownership and leadership of
- processing units such as providing communication services to a number of service
- Processing units A, B, C ... n, of the processing units set P shared among
- Each processing unit also maintain
- the shared data pass between the processing units whenever this data is updated and or changed.
- Each processing unit keeps an ordered list of the record.
- the record may include a header.
- the header may include owner of the record, handle
- the data field may
- the size of the data field may be optional. There are two
- the data field may or may not be
- the data field is not
- a record may be retrieved from
- the record owner is assigned as the same processing unit that is attempting
- the handle of the record is incremented by one, and the
- the leader of the record is the owner of the record.
- the record owner When updating a record, the record owner is or becomes the processing unit that is updating the record.
- the handle of the record may remain the same. However, the
- a record can be added by any processing unit by creating a record that
- the record can be updated by its owner by
- This updated record then multicasts to all of the processing units in the set P.
- the record can be deleted by its owner, which is done by deleting
- processing unit broadcasts its current known list of record, and every time it
- the processing unit may need to do nothing.
- all of the processing units in the process set P will have the same list of record in its local
- algorithm may include sending a message that may contain information that
- the processing unit when receiving the message, the processing unit
- record may either change the leader of the record or relinquish the leader of the record.
- processing unit in the process set P may be updated.
- a processing unit in the process set P may be updated.
- processing unit may take ownership of a record. This procedure will work in both
- a record owner may
- number of records may be distributed to a specific processing unit or a group of
- processing units In case a processing unit is down or inactivated, its entire record
- processing unit must be aware of its own capacity and performance limitation so it
- Such network may be used for
- IP internet protocol
- N of processing units such as radio network controller (RNC) processing units
- BTS base station transceiver site
- gateway feature server (FS) processing units 540-1 through 540-M, gateway
- a record of state information is generated that is associated with
- the first of the K clients may be the mobile station 570-1 , and the first of the
- N processing units may be BTS 530-1.
- the record of state information is associated
- N of the N processing units preferably, the BTS 530-2 through 530-J.
- the processing units may relate to various attributes of the processing units, in this case the BTSs,
- a selected processing unit takes ownership
- the selected processing unit may be any processing unit
- the owner of the record may relinquish ownership of the record of state
- the selected processing unit may be the processing unit that is relinquishing ownership, because another processing unit with better characteristic
- Selection of a processing unit may be extended to other types of processing
- a VC, RNC, GTWY and SDU may be selected to provide related services to complete the service connection, for
- BTS base-station transceiver station
- radio radio
- RNC network controller
- SDU selection and distribution controller
- VC coder
- GTWY gateway
- GTWY one of the secondary owners of BTS, RNC, SDU, VC and GTWY is
- BTS 601-J BTS 601-J
- SDU 602-R SDU 602-R
- VC 603-P GTWY 604-N
- FS 605-M FS
- 606-S is shown to collectively show the various primary processing units selected
- SDU 602-R This substitution may be made when characteristic of SDU 602-1
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Environmental & Geological Engineering (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
Description
Claims
Applications Claiming Priority (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US312099 | 1994-11-17 | ||
US09/312,099 US6324572B1 (en) | 1999-05-14 | 1999-05-14 | Communication network method and apparatus |
PCT/US2000/007010 WO2000070480A1 (en) | 1999-05-14 | 2000-03-16 | Communication network method and apparatus |
Publications (2)
Publication Number | Publication Date |
---|---|
EP1183618A1 true EP1183618A1 (en) | 2002-03-06 |
EP1183618A4 EP1183618A4 (en) | 2005-02-02 |
Family
ID=23209883
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
EP00918043A Withdrawn EP1183618A4 (en) | 1999-05-14 | 2000-03-16 | Communication network method and apparatus |
Country Status (3)
Country | Link |
---|---|
US (1) | US6324572B1 (en) |
EP (1) | EP1183618A4 (en) |
WO (1) | WO2000070480A1 (en) |
Families Citing this family (10)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6766369B1 (en) * | 1998-03-09 | 2004-07-20 | Net Zero, Inc. | Internet service error tracking |
US6928615B1 (en) * | 1999-07-07 | 2005-08-09 | Netzero, Inc. | Independent internet client object with ad display capabilities |
GB2362064A (en) * | 2000-05-04 | 2001-11-07 | Marconi Comm Ltd | Switching of software in a communications system |
US6816912B1 (en) * | 2000-12-01 | 2004-11-09 | Utstarcom, Inc. | Method and system for tunnel optimized call setup for mobile nodes |
US7099666B1 (en) * | 2001-07-30 | 2006-08-29 | Bellsouth Intellectual Property Corporation | Automated reconciliation of directed retry lists |
US6721907B2 (en) * | 2002-06-12 | 2004-04-13 | Zambeel, Inc. | System and method for monitoring the state and operability of components in distributed computing systems |
US20050036623A1 (en) * | 2003-08-15 | 2005-02-17 | Ming-Jye Sheu | Methods and apparatus for distribution of global encryption key in a wireless transport network |
US7535827B2 (en) * | 2003-10-09 | 2009-05-19 | Alcatel Lucent | High availability of resources in telecommunications network using synchronized redundancy mechanism |
US20100161145A1 (en) * | 2008-12-18 | 2010-06-24 | Yahoo! Inc | Search engine design and computational cost analysis |
US10122604B2 (en) * | 2014-02-28 | 2018-11-06 | Cisco Technology, Inc. | Emergency network services by an access network computing node |
Citations (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO1997025673A1 (en) * | 1996-01-11 | 1997-07-17 | Cabletron Systems, Inc. | Replicated resource management system for a distributed application maintaining a relativistic view of state |
Family Cites Families (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP0537903A2 (en) * | 1991-10-02 | 1993-04-21 | International Business Machines Corporation | Distributed control system |
US5566297A (en) * | 1994-06-16 | 1996-10-15 | International Business Machines Corporation | Non-disruptive recovery from file server failure in a highly available file system for clustered computing environments |
US6163866A (en) * | 1994-07-29 | 2000-12-19 | Sun Microsystems, Inc. | System level IC testing arrangement and method |
US5566225A (en) * | 1994-11-21 | 1996-10-15 | Lucent Technologies Inc. | Wireless data communications system for detecting a disabled condition and simulating a functioning mode in response to detection |
US5696895A (en) * | 1995-05-19 | 1997-12-09 | Compaq Computer Corporation | Fault tolerant multiple network servers |
US5774668A (en) * | 1995-06-07 | 1998-06-30 | Microsoft Corporation | System for on-line service in which gateway computer uses service map which includes loading condition of servers broadcasted by application servers for load balancing |
US5774660A (en) * | 1996-08-05 | 1998-06-30 | Resonate, Inc. | World-wide-web server with delayed resource-binding for resource-based load balancing on a distributed resource multi-node network |
-
1999
- 1999-05-14 US US09/312,099 patent/US6324572B1/en not_active Expired - Fee Related
-
2000
- 2000-03-16 EP EP00918043A patent/EP1183618A4/en not_active Withdrawn
- 2000-03-16 WO PCT/US2000/007010 patent/WO2000070480A1/en not_active Application Discontinuation
Patent Citations (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO1997025673A1 (en) * | 1996-01-11 | 1997-07-17 | Cabletron Systems, Inc. | Replicated resource management system for a distributed application maintaining a relativistic view of state |
Non-Patent Citations (2)
Title |
---|
POWELL D: "DISTRIBUTED FAULT TOLERANCE: LESSONS FROM DELTA-4" IEEE MICRO, IEEE INC. NEW YORK, US, vol. 14, no. 1, 1 February 1994 (1994-02-01), pages 36-47, XP000433307 ISSN: 0272-1732 * |
See also references of WO0070480A1 * |
Also Published As
Publication number | Publication date |
---|---|
US6324572B1 (en) | 2001-11-27 |
WO2000070480A1 (en) | 2000-11-23 |
EP1183618A4 (en) | 2005-02-02 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US7599328B2 (en) | System and method for efficient selection of a packet data servicing node | |
EP2122966B1 (en) | Consistent and fault tolerant distributed hash table (dht) overlay network | |
US20030009558A1 (en) | Scalable server clustering | |
EP1192545B1 (en) | Internet server session backup apparatus | |
EP2347563B1 (en) | Distributed master election | |
EP4178134A1 (en) | Data transmission method, proxy server, storage medium, and electronic device | |
US6754220B1 (en) | System and method for dynamically assigning routers to hosts through a mediator | |
US7272653B2 (en) | System and method for implementing a clustered load balancer | |
US20020152293A1 (en) | Dynamic server directory for distributed computing system | |
US20070105555A1 (en) | System and Method for Identifying a Wireless Serving Node for a Mobile Unit | |
EP0880741A1 (en) | Method and apparatus for connecting a client node to a server node based on load levels | |
CN102025630A (en) | Load balancing method and load balancing system | |
EP1351527B1 (en) | Unique repository server in an operations and maintenance center for a telecommunications system | |
US6324572B1 (en) | Communication network method and apparatus | |
US7882226B2 (en) | System and method for scalable and redundant COPS message routing in an IP multimedia subsystem | |
JP4459999B2 (en) | Non-stop service system using voting and information updating and providing method in the system | |
US20050066014A1 (en) | Method and apparatus for reconfiguring a server system | |
JP2003078541A (en) | Network connecting device, system, and method | |
Lin et al. | An efficient fault-tolerant approach for Mobile IP in wireless systems | |
CN113485821A (en) | High-reliability video conference system, control method thereof and storage medium | |
CN112214377A (en) | Equipment management method and system | |
EP3955649A1 (en) | Multi-link terminal and method and apparatus thereof for executing link switching, and storage medium | |
KR100970212B1 (en) | Method and System of Dual Authentication Service for Measuring Obstacle using Dynamic Query Switch of Heterogeneous DB | |
US20050198022A1 (en) | Apparatus and method using proxy objects for application resource management in a communication network | |
CN113206754B (en) | Method and device for realizing load sharing |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PUAI | Public reference made under article 153(3) epc to a published international application that has entered the european phase |
Free format text: ORIGINAL CODE: 0009012 |
|
17P | Request for examination filed |
Effective date: 20011214 |
|
AK | Designated contracting states |
Kind code of ref document: A1 Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LI LU MC NL PT SE |
|
RBV | Designated contracting states (corrected) |
Designated state(s): DE FI GB |
|
A4 | Supplementary search report drawn up and despatched |
Effective date: 20041216 |
|
RIC1 | Information provided on ipc code assigned before grant |
Ipc: 7H 04L 29/06 B Ipc: 7H 04L 12/56 B Ipc: 7G 06F 11/20 B Ipc: 7G 06F 15/177 A Ipc: 7G 06F 9/46 B |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: THE APPLICATION IS DEEMED TO BE WITHDRAWN |
|
18D | Application deemed to be withdrawn |
Effective date: 20060415 |
|
P01 | Opt-out of the competence of the unified patent court (upc) registered |
Effective date: 20230524 |