CN1136376A - Control of overload situations in frame relay network - Google Patents
Control of overload situations in frame relay network Download PDFInfo
- Publication number
- CN1136376A CN1136376A CN94194337.2A CN94194337A CN1136376A CN 1136376 A CN1136376 A CN 1136376A CN 94194337 A CN94194337 A CN 94194337A CN 1136376 A CN1136376 A CN 1136376A
- Authority
- CN
- China
- Prior art keywords
- frame
- buffer
- network
- node
- special use
- 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.)
- Granted
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/24—Traffic characterised by specific attributes, e.g. priority or QoS
- H04L47/2441—Traffic characterised by specific attributes, e.g. priority or QoS relying on flow classification, e.g. using integrated services [IntServ]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/12—Avoiding congestion; Recovering from congestion
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/16—Flow control; Congestion control in connection oriented networks, e.g. frame relay
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/30—Flow control; Congestion control in combination with information about buffer occupancy at either end or at transit nodes
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Train Traffic Observation, Control, And Security (AREA)
- Control Of Electric Motors In General (AREA)
Abstract
The invention relates to a method for congestion management in an FR network. The method comprises determining the virtual channel associated with a frame to be transmitted when it is received from a subscriber connection at a subscriber node. In order for the load in the network to be reduced, (a) data is buffered at the input boundary of the subscriber node to virtual-channel-specific buffers (621 . . . 62n), (b) the fill rate of said buffers is monitored continuously, and (c) when a frame is received in a virtual-channel-specific buffer which is full, substantially all the contents of the buffer are discarded.
Description
The present invention relates in frame-relay network, be used for the method according to claim 1 preamble of congestion management, and relate to user node according to claim 3 preamble.
Crowd and be meant such a case:, locate transmission request number at certain nexus (being called bottleneck) and surpass transmission capacity at special time.Crowded cause overload usually, consequently, for example buffer overflows, therefore will be by network or user transmission package again.The function of congestion management (CM) is the balance of keeping between transmission request and the transmission capacity, makes bottleneck work on optimal level, and to guarantee that just mode provides service to the user.
Congestion management can be divided into crowded (CA) and crowded recover (CR) of avoiding.The purpose of crowded avoiding method is: by the bandwidth according to network congestion state dynamic adjustments user, and/or by reporting to the police to the network route, make the partial service load transfer of bottleneck to idling-resource, prevent to produce in the network crowded.And the purpose of restoration methods is: crowded if avoiding method can not prevent to produce, then the work with bottleneck returns to optimal level.
Frame relay (frame relay FR) technology is a kind of packet network technology that is used to transmit elongated frame that currently used packet network connects that replaces.The agreement (X.25) that extensively adopts in the current packet network needs enough processing, and the transmission equipment costliness, and consequently speed is also low.These situations are because this fact: X.25 standard is to connect in used transmission to develop when still being very easy to error of transmission occur.The starting point of frame relay technology is quite low transmission line error probability.Therefore can abandon some the unnecessary function in the frame relay technology, this makes the frame transmission rapid and effective.Frame mode bearer service (Frame Mode Bearer Service) generally CCITT recommend view I.233 (list of references 1) with recommend view and Q.922 describe in the relevant agreement in (list of references 2).Crowded and congestion management mechanism in the FR network is recommended view at CCITT and is I.370 described in (list of references 3).In order to describe the FR technology in more detail, please refer to An Overviewof Frame Relay Technology (list of references 4) and the above-mentioned view of recommending of the Datapro Management of Data Commumications of in April, 1991 MeGrawHill company.
When in frame-relay network, extremely crowding, the forced frame of abandoning.When the buffer capacity that this situation occurs in network transmission capacity and individual node all is exceeded.In currently used congestion management mechanism, in the middle of (at the user node place) and the network (at the via node place), all almost abandon frame randomly in the network periphery.For example, if frame for want of can not obtain buffering in the space,, then abandon this frame if perhaps enough high and this frame of buffer filling rate contains a kind of indication of abandoning of allowing when crowding.Do not do anything to influence buffer itself; It continues as sky to the data link, as normal condition.If do not abandon this frame,, then vainly load other Internet resources up to a crowded node.Must exchange this frame up to the point of abandoning it in network, promptly crowded node this means the waste resource.
The objective of the invention is to eliminate above-mentioned defective, and a kind of novel congestion management method that is used for frame-relay network is provided, described method allows to avoid the unnecessary loading of network.This utilizes the method according to this invention to realize, it is characterized in that disclosed content in claim 1 characteristic.FR network user's node according to the present invention is characterised in that disclosed content in claim 3 characteristic.
Thought of the present invention is, the user node that is buffered to the tunnel private buffer at frame is in and is trapped among a moment outside the network and removes the content (tunnel be meant when virtual connection be the virtual coupling part that the end-to-end FR of actual packet exchange has a transmission link length when connecting) of whole tunnel private buffer.
The method according to this invention makes it possible to avoid abandoning random frame, therefore before this application system needn't resemble sequence of transport packets again frequently.
Below, the example shown in is described the present invention and preferred forms thereof in more detail with reference to the accompanying drawings, wherein
Fig. 1 illustrates the exemplary operation environment of the method according to this invention,
Fig. 2 illustrates according to FR network user's node of the present invention,
Fig. 3 illustrates the form of frame to be transmitted in the FR network, and
Fig. 4 illustrates the via node of the FR network that adopts the method according to this invention.
Frame-relay network can be used by several different application systems, and they do not need similar service.Therefore, consider two most important parameters (LOF probability and delay), service be divided in different types of network that it is favourable adopting the present invention's 1 method according to application system.A solution is disclosed in No. the 925671st, the Finnish patent application like this.In this application, propose service is divided into following three classes:
-the first service class (kind 1) provides interactive services, postpones weak point,
-the second service class (kind 2) provides low LOF probability, without any the delay of obviously discovering,
-the three service class (kind 3) not only provides short delay but also provide low LOF probability.
Each relaying of the network of Shi Xianing connects the buffer with type service special use, one of each type service by this way.And user node has the buffer of tunnel special use in user interface side.Below these solutions will be described in more detail; Please refer to the above Finnish patent application of quoting in addition.
Utilize (user) application system of frame-relay network to send data, general one next so-called window to network frame by frame.If lose by its a used application and protocol detection contained frame in the window, then resend whole window usually, rather than only send the frame of having lost.Like this, losing in the mode identical with losing of whole window of a frame influences application system in network.Under every kind of situation, this application protocol must resend the frame of whole window.
Fig. 1 illustrates the FR network that public network service is provided, promptly to the different A of office of single company or a plurality of companies ... the frame-relay network 12 that the LAN 11 of E interconnects.The LAN 11 of each office is through a local area network bridge 13 with respectively by label 14a ... the data link of 14e indication is used the FR service.At FR user A ... being connected between E and the FR network node N self is known, therefore do not do in more detail at this and describes.About the visible article of the more detailed information of LAN used in interconnection and bridge as Michael Grimshaw LAN InterconnectionsTechnology in February, 1991 " telecommunications ", and see Lahiverkko-opas in 1991, LeenaJaakonmaki, Suomen ATK-kustannus Oy, at this as a reference with them.
The general features of the known node structure of FR network is that all frames are used same buffer, supposes that they are routed to identical physical connection.On the contrary, according to the present invention, the output boundary of all-network node with have the input border that relaying is connected and preferably be provided with and above-mentioned type service corresponding buffers.Fig. 2 is illustrated in this class solution at a via node place in the network.This node be received in the bridge 13 (Fig. 1) that the user connects the FR frame of original assembling.In bridge 13, the frame of user LAN11 is inserted in the information field of FR frame (time tagmeme and other similar position exceptions).Fig. 3 is illustrated in and inserts LAN frame 38 in the information field of FR frame 39.A kind of general FR network frame form also is shown, and the address field before information field comprises two eight bit bytes (position 1 to 8).The position 5 to 8 of 3 to 8 and second eight bit bytes in position of first eight bit byte constitutes a data link connection identifier DLCI, and it is to node indication virtual connection and the tunnel under particular frame for example.Tunnel is distinguished mutually by data link connection identifier.Yet data link connection identifier only is non-ambiguousness on the single virtual passage, and in the transformation of next tunnel, it may change in node.The 2nd of the second address field eight bit byte is called DE position (abandoning qualified designator), for frame to abandon also be important.Recommend view according to CCITT, for example under congestion state,, then allow to abandon this frame if the DE position of a frame has been changed to 1.Because other positions in the FR frame are irrelevant with the present invention, so they are not done more detailed description at this.In order to describe in more detail, with reference to above-mentioned list of references 2 and 4.
User node (Fig. 2) in the network periphery is located, and the user connects (in example shown in Figure 2, they are connected to same node) such as 114a, 14b, at first is connected to a sign and control assembly 61, and these parts are received in formed FR frame in the bridge 13 (Fig. 1).This sign and control assembly 61 read data link connection identifier (CID DLCI from the address field of frame, and this frame delivered to indicated virtual of identifier be connected corresponding input buffer 62
162
nEvery data link has a special-purpose selector S3, it selects frame from the input buffer of each tunnel, and frame further delivered to centralized router one 6, this router is delivered to frame the classification element 43 of correct data link (output data link only is shown among the figure) again.Classification element 43 is read identifier DLCI from the address field of frame, and selects the corresponding type service of tunnel with the identifier indication from table T.On the basis that classification has been finished, classification element 43 is added to each frame and the corresponding output buffer 64a of the type service of this frame, 64b or 64c.Every therefore output data link has three output buffers, one of each type service.Selector S2 is from the output buffer 64a of type service special use ... 64c selects frame, and frame is delivered to the relaying connection.
So cushioned in the traffic of FR transmission over networks by the user at every virtual input side that connects special-purpose user node.Incoming frame 39 dynamically links in every virtual connection.According to the type service of virtual connection, chain length has predetermined allowed maximum; Less at type service 1 and 3 o'clock values of being somebody's turn to do, and when type service 2, should be worth bigger.Selector S3 for example reads and the proportional buffer 62 of the traffic of distributing to them
162
nDeng, thereby satisfy principle of justice.
When a node in the network was crowded, purpose was to reduce at the user node place of network source end by the traffic in the virtual connection of this node; Thereby each frame will not be carried in other Internet resources of only being abandoned when node is crowded in arrival.According to the present invention, this realizes in such a way, makes the sign of user node and the buffer 62 of control assembly 61 each tunnel special use of monitoring
162
nFilling rate (in this known on one's body mode), if a buffer that has filled up receives a frame, then abandon all the elements of this buffer.At this moment, sign and control assembly are abandoned this incoming frame (for example, it can be first frame of longer frame bag).The frame of Jie Shouing is stored in the buffer of emptying afterwards.In Fig. 2, the operation that is used to control with emptied buffer of sign and control assembly is identified by four-headed arrow FC.
Carve all the elements of abandoning buffer at a time, more can alleviate crowding in the network than only abandoning some frames.When the buffer emptying of whole tunnel special use, it is quite low that the degree of crowding in the network becomes, and the length of buffer is generally tens frames.Emptied buffer guarantees certain period, and the tunnel of discussing is load networks not almost.This also makes it possible to be avoided the unnecessary loading of network, because the level after is owing to crowded frame of having to abandon is not provided on the network.
Consider the application system of utilizing network, method of the present invention has LOF likelihood ratio little advantage in the past, therefore, has also reduced by transmitting the load that is caused again.Abandon whole buffer and cause very near the frame of abandoning whole window situation about must transmit again by application protocol.Therefore with the length adjustment of the buffer of tunnel special use corresponding substantially to the length of the frame of a window that is once sent with the application system of utilizing network be favourable.
Fig. 4 is illustrated in the processing of the via node of network to frame.At first receive the FR frame 39 of above-mentioned form by the classification element 43 of every data link special use.Classification element 43 is from the address field read data link connection identifier (CID of frame, and the corresponding type service of tunnel of selection and this identifier indication.Tunnel and respective service kind are stored among the table T.On the basis of the classification of having finished, classification element 43 is added to each frame and the corresponding input buffer 44a of the type service of this frame, 44b or 44c.Therefore every input data link has three input buffers, one of each type service.Every data link has the selector S1 of a special use, and it selects frame from the buffer of type service special use, and transmits them at intranodal.At the outlet side of via node, frame is connected with particular data link corresponding interface with them.At this interface, according to one among the output buffer 45a, the 45b that they are provided to three type service special uses at the selected type service of the input side of node or the 45c, thus, selector S2 further reads relaying with frame and connects.Therefore every output data link has three output buffers, one of each type service.Another program is, even at the outlet side of node, can classification element be set separately for every data link, in this case, needn't transmit grouped data at intranodal.
Although described the present invention with reference to the example shown in the accompanying drawing, obviously the present invention is not limited to these examples, and can revise in the scope of above disclosed inventive concept and claims.Specifically, even principle according to the present invention is abandoned frame, but for example the structure of user node can change in many ways.For example, the buffer of each tunnel special use can have independent filling rate control assembly, and described control assembly is sent to parts 61 with the data of relevant filling rate, and parts 61 (except the sign tunnel) are emptied buffer only.
Claims (4)
1. the method that in the FR network, is used for congestion management, this network comprises user node, user (A ... E) through data link (14a ... 14e) be connected on the user node, described method comprises: when determining and the relevant tunnel of the frame that will transmit (39) when the user receives a frame at user node, it is characterized in that:
-on the input border of user node with the buffer (62 of data buffering to the tunnel special use
162
n),
The filling rate of the described buffer of-continuous monitoring, and
-when in the buffer of full tunnel special use, receiving a frame, abandon all the elements of this buffer in fact.
2. according to the method for claim 1, it is characterized in that the buffer (62 of tunnel special use
162) length is adjusted to and utilizes the length of the frame bag that the application system of network once sent corresponding in fact.
3. the user node of frame-relay network, node users (the A of network ... E) through data link (14a ... 14e) be connected to user node, described node is included in the input buffer on node input border, with output buffer at the node output boundary, and be used for frame is transmitted to the device (16) of required output buffer from input buffer, it is characterized in that comprising:
-at the buffer (62 of tunnel special use on input border
162
n),
-be used to monitor first device (61) of filling rate of the buffer of described tunnel special use, and
-in response to described first device (61) and the frame received, be used to abandon the tunnel special use buffer content second install (62).
4. according to the user node of claim 1, it is characterized in that described first and second devices are arranged in identical sign and the control assembly (61), the frame of receiving at the user node place by these parts (61) offers the buffer (62 of tunnel special use
162
n).
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| FI935364 | 1993-11-30 | ||
| FI935364A FI94814C (en) | 1993-11-30 | 1993-11-30 | Procedure for managing congestion situations in a frame switching network and a subscriber node in a frame switching network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1136376A true CN1136376A (en) | 1996-11-20 |
| CN1073317C CN1073317C (en) | 2001-10-17 |
Family
ID=8539054
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN94194337A Expired - Fee Related CN1073317C (en) | 1993-11-30 | 1994-11-29 | Control of overload situations in frame relay network |
Country Status (9)
| Country | Link |
|---|---|
| US (1) | US5889762A (en) |
| EP (1) | EP0732019B1 (en) |
| JP (1) | JP3210344B2 (en) |
| CN (1) | CN1073317C (en) |
| AT (1) | ATE233454T1 (en) |
| AU (1) | AU689517B2 (en) |
| DE (1) | DE69432187D1 (en) |
| FI (1) | FI94814C (en) |
| WO (1) | WO1995015636A1 (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100336367C (en) * | 2003-10-02 | 2007-09-05 | 国际商业机器公司 | Shared buffer having hardware controlled buffer regions |
| CN100544351C (en) * | 2003-12-15 | 2009-09-23 | 国际商业机器公司 | Be used for system and method in value-added network business test difference business |
Families Citing this family (50)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6185223B1 (en) * | 1996-12-04 | 2001-02-06 | Conexant Systems, Inc. | Apparatus and method for providing fire wall protection for systems in communication with an a synchronous transfer mode system |
| JPH10257073A (en) * | 1997-01-10 | 1998-09-25 | Mitsubishi Electric Corp | Transmission buffer memory management method and atm communication equipment |
| US6144669A (en) * | 1997-12-12 | 2000-11-07 | Newbridge Networks Corporation | Prioritized PVC management queues for improved frame processing capabilities |
| US6469987B1 (en) | 1998-01-13 | 2002-10-22 | Enterasys Networks, Inc. | Virtual local area network with trunk stations |
| US6112251A (en) | 1998-01-13 | 2000-08-29 | Cabletron Systems, Inc. | Virtual local network for sending multicast transmissions to trunk stations |
| US6301224B1 (en) * | 1998-01-13 | 2001-10-09 | Enterasys Networks, Inc. | Network switch with panic mode |
| US6707792B1 (en) * | 1998-06-30 | 2004-03-16 | Cisco Technology, Inc. | Overload reduction in a communication system |
| US6570869B1 (en) | 1998-09-30 | 2003-05-27 | Cisco Technology, Inc. | Communicating voice over a packet-switching network |
| US6658022B1 (en) | 1998-09-30 | 2003-12-02 | Cisco Technology, Inc. | Signaling protocol for controlling voice calls in a packet switching network |
| US7212522B1 (en) | 1998-09-30 | 2007-05-01 | Cisco Technology, Inc. | Communicating voice over a packet-switching network |
| US6526052B1 (en) | 1998-12-23 | 2003-02-25 | Enterasys Networks, Inc. | Virtual local area networks having rules of precedence |
| US6680952B1 (en) | 1999-06-01 | 2004-01-20 | Cisco Technology, Inc. | Method and apparatus for backhaul of telecommunications signaling protocols over packet-switching networks |
| US20040160917A1 (en) * | 1999-06-22 | 2004-08-19 | Eliznd Ihab H. | Multibeam antenna for a wireless network |
| NO311060B1 (en) * | 1999-07-14 | 2001-10-01 | Ericsson Telefon Ab L M | Procedure for transmitting data in packet switched networks |
| US6728213B1 (en) * | 2001-03-23 | 2004-04-27 | Advanced Micro Devices, Inc. | Selective admission control in a network device |
| US7139280B2 (en) * | 2001-07-30 | 2006-11-21 | Yishay Mansour | Buffer management policy for shared memory switches |
| US7787458B2 (en) * | 2001-11-30 | 2010-08-31 | Alcatel-Lucent Canada Inc. | Method and apparatus for communicating data packets according to classes of service |
| US7102997B2 (en) * | 2002-03-04 | 2006-09-05 | Fujitsu Limited | Aggregate rate transparent LAN service for closed user groups over optical rings |
| US7778187B2 (en) * | 2004-06-29 | 2010-08-17 | Damaka, Inc. | System and method for dynamic stability in a peer-to-peer hybrid communications network |
| US7933260B2 (en) | 2004-06-29 | 2011-04-26 | Damaka, Inc. | System and method for routing and communicating in a heterogeneous network environment |
| US7570636B2 (en) | 2004-06-29 | 2009-08-04 | Damaka, Inc. | System and method for traversing a NAT device for peer-to-peer hybrid communications |
| US7656870B2 (en) * | 2004-06-29 | 2010-02-02 | Damaka, Inc. | System and method for peer-to-peer hybrid communications |
| US8050272B2 (en) | 2004-06-29 | 2011-11-01 | Damaka, Inc. | System and method for concurrent sessions in a peer-to-peer hybrid communications network |
| US8437307B2 (en) | 2007-09-03 | 2013-05-07 | Damaka, Inc. | Device and method for maintaining a communication session during a network transition |
| US20070078720A1 (en) * | 2004-06-29 | 2007-04-05 | Damaka, Inc. | System and method for advertising in a peer-to-peer hybrid communications network |
| US8009586B2 (en) | 2004-06-29 | 2011-08-30 | Damaka, Inc. | System and method for data transfer in a peer-to peer hybrid communication network |
| JP4334424B2 (en) * | 2004-07-09 | 2009-09-30 | 富士通株式会社 | Network resource, service discovery method, and relay node device |
| GB2416647B (en) * | 2004-07-26 | 2006-10-25 | Motorola Inc | Method and apparatus for resource allocation |
| US8862164B2 (en) * | 2007-09-28 | 2014-10-14 | Damaka, Inc. | System and method for transitioning a communication session between networks that are not commonly controlled |
| WO2009070718A1 (en) | 2007-11-28 | 2009-06-04 | Damaka, Inc. | System and method for endpoint handoff in a hybrid peer-to-peer networking environment |
| US8725895B2 (en) | 2010-02-15 | 2014-05-13 | Damaka, Inc. | NAT traversal by concurrently probing multiple candidates |
| US8892646B2 (en) | 2010-08-25 | 2014-11-18 | Damaka, Inc. | System and method for shared session appearance in a hybrid peer-to-peer environment |
| US8874785B2 (en) | 2010-02-15 | 2014-10-28 | Damaka, Inc. | System and method for signaling and data tunneling in a peer-to-peer environment |
| US8689307B2 (en) * | 2010-03-19 | 2014-04-01 | Damaka, Inc. | System and method for providing a virtual peer-to-peer environment |
| US9043488B2 (en) | 2010-03-29 | 2015-05-26 | Damaka, Inc. | System and method for session sweeping between devices |
| US9191416B2 (en) | 2010-04-16 | 2015-11-17 | Damaka, Inc. | System and method for providing enterprise voice call continuity |
| US8352563B2 (en) | 2010-04-29 | 2013-01-08 | Damaka, Inc. | System and method for peer-to-peer media routing using a third party instant messaging system for signaling |
| US8446900B2 (en) | 2010-06-18 | 2013-05-21 | Damaka, Inc. | System and method for transferring a call between endpoints in a hybrid peer-to-peer network |
| US8611540B2 (en) | 2010-06-23 | 2013-12-17 | Damaka, Inc. | System and method for secure messaging in a hybrid peer-to-peer network |
| US8468010B2 (en) | 2010-09-24 | 2013-06-18 | Damaka, Inc. | System and method for language translation in a hybrid peer-to-peer environment |
| US8743781B2 (en) | 2010-10-11 | 2014-06-03 | Damaka, Inc. | System and method for a reverse invitation in a hybrid peer-to-peer environment |
| US8407314B2 (en) | 2011-04-04 | 2013-03-26 | Damaka, Inc. | System and method for sharing unsupported document types between communication devices |
| US8694587B2 (en) | 2011-05-17 | 2014-04-08 | Damaka, Inc. | System and method for transferring a call bridge between communication devices |
| US8478890B2 (en) | 2011-07-15 | 2013-07-02 | Damaka, Inc. | System and method for reliable virtual bi-directional data stream communications with single socket point-to-multipoint capability |
| US9027032B2 (en) | 2013-07-16 | 2015-05-05 | Damaka, Inc. | System and method for providing additional functionality to existing software in an integrated manner |
| US9357016B2 (en) | 2013-10-18 | 2016-05-31 | Damaka, Inc. | System and method for virtual parallel resource management |
| WO2016022574A1 (en) | 2014-08-05 | 2016-02-11 | Damaka, Inc. | System and method for providing unified communications and collaboration (ucc) connectivity between incompatible systems |
| US10091025B2 (en) | 2016-03-31 | 2018-10-02 | Damaka, Inc. | System and method for enabling use of a single user identifier across incompatible networks for UCC functionality |
| US11902343B1 (en) | 2021-04-19 | 2024-02-13 | Damaka, Inc. | System and method for highly scalable browser-based audio/video conferencing |
| US11770584B1 (en) | 2021-05-23 | 2023-09-26 | Damaka, Inc. | System and method for optimizing video communications based on device capabilities |
Family Cites Families (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5140584A (en) * | 1989-03-01 | 1992-08-18 | Kabushiki Kaisha Toshiba | Packet communication system and method of controlling same |
| US5163046A (en) * | 1989-11-30 | 1992-11-10 | At&T Bell Laboratories | Dynamic window sizing in a data network |
| US5231633A (en) * | 1990-07-11 | 1993-07-27 | Codex Corporation | Method for prioritizing, selectively discarding, and multiplexing differing traffic type fast packets |
| AU8636391A (en) * | 1990-10-10 | 1992-05-20 | British Telecommunications Public Limited Company | Network traffic management |
| JPH04257145A (en) * | 1991-02-12 | 1992-09-11 | Hitachi Ltd | Method and device for packet flow rate control |
| US5233606A (en) * | 1991-08-02 | 1993-08-03 | At&T Bell Laboratories | Arrangement for controlling shared-buffer-memory overflow in a multi-priority environment |
| GB2261798B (en) * | 1991-11-23 | 1995-09-06 | Dowty Communications Ltd | Packet switching networks |
| US5426640A (en) * | 1992-01-21 | 1995-06-20 | Codex Corporation | Rate-based adaptive congestion control system and method for integrated packet networks |
| DE4328862A1 (en) * | 1993-08-27 | 1995-03-02 | Sel Alcatel Ag | Method and device for buffering data packets and switching center with such a device |
-
1993
- 1993-11-30 FI FI935364A patent/FI94814C/en active IP Right Grant
-
1994
- 1994-11-29 DE DE69432187T patent/DE69432187D1/en not_active Expired - Lifetime
- 1994-11-29 EP EP95901461A patent/EP0732019B1/en not_active Expired - Lifetime
- 1994-11-29 US US08/647,950 patent/US5889762A/en not_active Expired - Lifetime
- 1994-11-29 WO PCT/FI1994/000534 patent/WO1995015636A1/en active IP Right Grant
- 1994-11-29 AU AU10691/95A patent/AU689517B2/en not_active Ceased
- 1994-11-29 CN CN94194337A patent/CN1073317C/en not_active Expired - Fee Related
- 1994-11-29 JP JP51542395A patent/JP3210344B2/en not_active Expired - Fee Related
- 1994-11-29 AT AT95901461T patent/ATE233454T1/en not_active IP Right Cessation
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100336367C (en) * | 2003-10-02 | 2007-09-05 | 国际商业机器公司 | Shared buffer having hardware controlled buffer regions |
| US7356648B2 (en) | 2003-10-02 | 2008-04-08 | International Business Machines Corporation | Shared buffer having hardware controlled buffer regions |
| US7877548B2 (en) | 2003-10-02 | 2011-01-25 | International Business Machines Corporation | Shared buffer having hardware-controlled buffer regions |
| CN100544351C (en) * | 2003-12-15 | 2009-09-23 | 国际商业机器公司 | Be used for system and method in value-added network business test difference business |
Also Published As
| Publication number | Publication date |
|---|---|
| FI94814B (en) | 1995-07-14 |
| US5889762A (en) | 1999-03-30 |
| ATE233454T1 (en) | 2003-03-15 |
| CN1073317C (en) | 2001-10-17 |
| EP0732019B1 (en) | 2003-02-26 |
| WO1995015636A1 (en) | 1995-06-08 |
| JPH09507974A (en) | 1997-08-12 |
| DE69432187D1 (en) | 2003-04-03 |
| FI94814C (en) | 1995-10-25 |
| FI935364A (en) | 1995-05-31 |
| AU689517B2 (en) | 1998-04-02 |
| FI935364A0 (en) | 1993-11-30 |
| JP3210344B2 (en) | 2001-09-17 |
| EP0732019A1 (en) | 1996-09-18 |
| AU1069195A (en) | 1995-06-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN1073317C (en) | Control of overload situations in frame relay network | |
| JP3305326B2 (en) | Overload state control in frame relay networks | |
| CN102084627B (en) | By the method for transmitted data on network | |
| US6490631B1 (en) | Multiple processors in a row for protocol acceleration | |
| EP0535860B1 (en) | Congestion control for high speed packet networks | |
| JP2753468B2 (en) | Digital communication controller | |
| US6671256B1 (en) | Data channel reservation in optical burst-switched networks | |
| JP3321043B2 (en) | Data terminal in TCP network | |
| CN100596114C (en) | Credit based flow control system, apparatus and method | |
| US6122254A (en) | Method and apparatus for network flow control with perceptive parameters | |
| US7177268B2 (en) | Packet distributing device | |
| CN102090030A (en) | Method of data delivery across a network | |
| US20070070900A1 (en) | Method and processor for classifying data packet units | |
| US5777986A (en) | Method and apparatus for controlling quality of service in an ATM network | |
| CN1956359A (en) | Method for maintaining packet service quality in optical network when optical chain-circuit fault | |
| US5430710A (en) | Order preserving transmission of data streams | |
| EP0673573B1 (en) | A method for congestion management in a frame relay network and a node in a frame relay network | |
| JPH0267043A (en) | Data switching device | |
| JPH03234139A (en) | Picture packet multiplex system | |
| JPH09233077A (en) | Used amount parameter control circuit |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| C19 | Lapse of patent right due to non-payment of the annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |