Communications system

Electrical computers and digital processing systems: multicomput – Computer network managing – Computer network access regulating

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C709S241000, C709S217000, C709S232000, C370S252000, C370S389000, C380S279000, C713S152000

Reexamination Certificate

active

06816899

ABSTRACT:

BACKGROUND OF THE INVENTION
The present invention relates to the field of communications and in particular communications systems wherein one or more clients are connected to one or more servers and ways of detecting failures occurring therein.
Clients and servers exist in many different kinds of communications systems including intelligent networks which play an increasingly important role in modern telecommunications networks. In intelligent networks servers, known as service data points (SDP), provide service data to the intelligent network separate from service control functions provided by clients, known as service control points (SCP). Instead of storing data locally, SCP clients have to contact remote SDP servers for all data functions. Since the SDP is separate from the SCP, the SCP requires a reliable and rapid method of detecting system failures affecting its ability to contact and retrieve data from SDPs. These failures include failure of communications links between the SCP and an associated SDP and partial or total failure of an SDP.
Acknowledgement based systems currently in use depend on window-based flow (or congestion) control. The window method of flow control works by a client limiting the number of packets it will send to a particular server before receiving a response from that server. If the limit is set at “n” packets, and if “n” packets have been sent with no response, then the client will not send another packet until a response is received to one of the packets already sent. Further packets will then be sent as further responses are received. However if a failure has occurred, either in the destination server or in the route used to access it, all the packets sent in the window will be lost.
The client may also set a timer to a certain time period during which a response is expected. If no response is received before the expiry of the time period, an error is detected. However communication speed is such that a large number of other packets may be sent before the time period associated with the first packet has expired. These other packets could therefore be lost in addition to the original packet by being sent along a faulty route or to a faulty server before the fault had been detected.
The timer method described above can only detect a single failure (i.e. in a single route or SDP interface) at a time. Normally, each SDP has two interfaces to each SCP. If an SDP fails, both interfaces would have to be tried in turn before the SCP will know that it is the SDP that has failed and not merely one of the routes to it. As a result, an increased number of packets could be lost before the failure of the SDP is detected by the SCP. If a pair of SDPs fail at about the same time then four interfaces would have to be tried by a SCP before it will be possible to identify the extent of the fault. As a result of the accumulated delay in identifying such multiple faults the number of packets that could be lost rises even further. There is therefore a need for a way of rapidly detecting such failures.
SUMMARY OF THE INVENTION
The present invention provides a communications system comprising one or more servers and one or more clients; the servers for connection to the clients, for the provision of information to the clients; each server comprising means for sending control messages to the clients at or above a set rate; each client comprising means for detecting the control messages and monitor means for determining a fault condition if the control messages are not received from each one of the servers at less than predetermined time intervals.


REFERENCES:
patent: 5459837 (1995-10-01), Caccavale
patent: 5563941 (1996-10-01), Stademann
patent: 5754787 (1998-05-01), Dedrick
patent: 5796934 (1998-08-01), Bhanot et al.
patent: 6003136 (1999-12-01), Schanze
patent: 6021443 (2000-02-01), Bracho et al.
patent: 6047327 (2000-04-01), Tso et al.
patent: 6182139 (2001-01-01), Brendel
patent: 6205479 (2001-03-01), Dulai et al.
patent: 6442598 (2002-08-01), Wright et al.
patent: 6456597 (2002-09-01), Bare
patent: 6496580 (2002-12-01), Chack
patent: 6570849 (2003-05-01), Skemer et al.
patent: 6594765 (2003-07-01), Sherman et al.
patent: 2245463 (1999-03-01), None
patent: 7056838 (1995-03-01), None
patent: WO 96/30841 (1986-10-01), None
patent: WO 98/27753 (1998-06-01), None
Kanakia et al., “The VMP Network Adapter Board (NAB): High-Performance Network Communication for Multiprocessors”, 1998 ACM 0-89791-279, pp. 175-187.*
Yen et al., “On Efficiently Tolerating General Failures in Autonomous Decentralized Multiserver Systems”., 1995, IEEE 0-8186-7087, pp. 288-296.*
Ravindran., “Application-specific Group Communications in Distributed Servers”, 1991, IEEE 0-87942-694-2, pp. 3vol. xx+1515.*
Kanakia et al., “The VMP Network Adapter Board (NAB): High-Performance Network Communication for Multiprocessors”, 1998 ACM 0-89791-279, pp. 175-187.*
Yen et al., “On Efficiently Tolerating General Failures in Autonomous Decentralized Multiserver Systems”., 1995, IEEE 0-8186-7087, pp. 288-296.*
Ravindran., “Application-specific Group Communications in Distributed Servers”, 1991, IEEE 0-87942-694-2, pp. 3vol. xx+1515.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Communications system does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Communications system, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Communications system will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3333163

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.