11.
    发明专利
    未知

    公开(公告)号:BRPI0520288A2

    公开(公告)日:2009-09-15

    申请号:BRPI0520288

    申请日:2005-06-14

    Abstract: A method and arrangement for failure handling in a tree-structured communications network having interconnected edge nodes and switching nodes. VLANs may be established by using spanning trees to provide connectivity in case of a failure in the network. Emitters in the edge nodes periodically broadcast alive messages on the VLANs, and notifiers note the alive messages. A missing alive message indicates a failure on one of the VLANs, and the notifier broadcasts corresponding failure messages on the VLANs. When the alive messages are restored, the notifier broadcasts corresponding repair messages. If a notifier fails to note a failure, one of the edge nodes performs a similar function although somewhat slower.

    12.
    发明专利
    未知

    公开(公告)号:AT546922T

    公开(公告)日:2012-03-15

    申请号:AT04809138

    申请日:2004-12-22

    Abstract: In the area of network provisioning, there is a problem of selecting a suitable traffic-provisioning model for large networks due to the high management complexity of the resource-efficient trunk model and the poor bandwidth efficiency of the easy-to-configure hose model. The invention is based on the idea of partitioning at least part of the network into multi-node clusters, and defining traffic limitations on at least two levels, including the intra-cluster level and the inter-cluster level, where the traffic limitations include one or more node-to-cluster traffic limitations for inter-cluster traffic. Subsequently, cluster-based provisioning of the network is performed based on the traffic limitations. The novel node-to-cluster limitations proposed by the invention are preferably applied in a cluster-based trunk or hose model on the inter-cluster level. In other words, for the description of the inter-cluster traffic (traffic between the clusters) cluster-based trunk or hose models can be used, preferably depending on the available information about the traffic. The cluster-based provisioning makes it possible to find a trade-off between management complexity and overprovisioning.

    13.
    发明专利
    未知

    公开(公告)号:DE602004023885D1

    公开(公告)日:2009-12-10

    申请号:DE602004023885

    申请日:2004-11-10

    Abstract: For efficient and fast admission control with respect to a new session and for exchange of data stream packets between an edge router (14) and a packet gateway (10) it is proposed to execute, at the edge router (14), selection of traffic streams of certain types from specific source nodes and target nodes and to also execute related traffic conditioning. Then, having selected specific data packet streams, the edge router (16) remarks data packets when the data packet streams are not in conformance with a predetermined traffic profile. This remarking serves as a performance indication for the packet gateway session admission control mechanism. In other words, the packet gateway (10) considers the number of remarked packets and determines on admission control for a new data packet stream session as a function of the number of remarked packets.

    A PROVISIONING METHOD AND A DESIGN TOOL FOR A COMMUNICATION NETWORK AND A CORRESPONDING ADMISSION CONTROLLER

    公开(公告)号:HK1100810A1

    公开(公告)日:2007-09-28

    申请号:HK07105931

    申请日:2007-06-05

    Abstract: In the area of network provisioning, there is a problem of selecting a suitable traffic-provisioning model for large networks due to the high management complexity of the resource-efficient trunk model and the poor bandwidth efficiency of the easy-to-configure hose model. The invention is based on the idea of partitioning at least part of the network into multi-node clusters, and defining traffic limitations on at least two levels, including the intra-cluster level and the inter-cluster level, where the traffic limitations include one or more node-to-cluster traffic limitations for inter-cluster traffic. Subsequently, cluster-based provisioning of the network is performed based on the traffic limitations. The novel node-to-cluster limitations proposed by the invention are preferably applied in a cluster-based trunk or hose model on the inter-cluster level. In other words, for the description of the inter-cluster traffic (traffic between the clusters) cluster-based trunk or hose models can be used, preferably depending on the available information about the traffic. The cluster-based provisioning makes it possible to find a trade-off between management complexity and overprovisioning.

    15.
    发明专利
    未知

    公开(公告)号:SE0302321D0

    公开(公告)日:2003-08-28

    申请号:SE0302321

    申请日:2003-08-28

    Abstract: A call admission control system and method for Internet Protocol (IP) Differentiated Services (DiffServ) network having at least one node for interpreting signaling messages and controlling traffic load in the network. The method consists of an initialization (601) and a real-time phase (602). In initialization phase (601), coefficients of the approximating hyperplanes are computed (61) and stored (62). This phase is repeated when the descriptor of a traffic class changes (63), which usually happens when nodes are configured or reconfigured. A traffic mix is admissible (67), if for each real-time traffic class both the stability (65) and the delay (66) constraints are fulfilled. Stability is tested by evaluating the number of lost packets and comparing it to the tolerated packet loss ratio for each class in that queue. Delay constraint is tested by checking if the traffic mix is below at least one of the approximating hyperplanes in the space of number of sessions for each class.

    Method and apparatus for Ethernet protection with local re-routing

    公开(公告)号:AU2009226921B2

    公开(公告)日:2013-03-07

    申请号:AU2009226921

    申请日:2009-03-16

    Abstract: A method is provided for use at a first node of a network. The first node (B) has an input path for receiving Ethernet frames destined for a second node of the network. The first node (B) also has a first output (working) path for forwarding the received Ethernet frames towards the second node. A failure along the first output (working) path is detected at the first node. Following such failure detection, the received Ethernet frames are caused, at the first node, to be re-routed along a second output (backup) path, different to the first output (working) path, towards the second node. The re-routing is performed by using (e.g. referring to and/or changing) respective indications (VLAN1) applied to the Ethernet frames to distinguish those Ethernet frames to be forwarded along the first output (working) path from those Ethernet frames to be forwarded along the second output (backup) path.

Patent Agency Ranking