Abstract: The present invention relates to an access node (2a, 2b) comprising: a forwarding mean (31) adapted to forward data traffic according to a forwarding table (32) that comprises one-to-one associations between destination hardware addresses and respective egress interfaces, a forwarding configuration means (33) adapted to configure forwarding entries into the forwarding table, a capturing means (34) adapted to capture auto-configuration messages exchanged between an auto-configuration server (4) and subscriber devices for assigning network addresses thereto. An access node according to the invention is characterized in that the forwarding configuration means is coupled to the capturing means, and is further adapted to synchronize the configuration of a particular forwarding entry related to a particular hardware address (MAC@1) of a particular subscriber device (1) with the lease of a particular network address (IP@1) to the particular subscriber device.

Abstract: Customer triggered resource reservation requests (131) are granted or refused in an access node (104) on the basis of available resources on downlinks (102) between the access node (104) and customer premises, and eventually uplinks (105) between the access node (104) and an aggregation network (106). Network triggered resource reservation requests (121) are granted or refused in a central resource admission control device (108) on the basis of knowledge of available resources in the aggregation network (106) and the contents of an admission control report (123) received from the access node (104). The admission control report (123) is generated by the access node (104) on the basis of available resources on downlinks (102) between the access node (104) and customer premises, and eventually uplinks (105) between the access node (104) and an aggregation network (106).

Abstract: A method and apparatus is disclosed for differentiating service in a data network which supports a plurality of service classes, by implementing a pricing strategy such that revenue for the ISP in non-busy hours in increased. An edge router assigns a predetermined packet service class value, which is either an artificial packet loss probability or an artificial packet delay, to each one of an associated plurality of service classes, of packets in a data stream, the predetermined packet service class value decreasing with the increasing importance degree of each of its associated plurality of service classes. The packets are delayed or dropped according to the predetermined packet service class value and according to a load on the data network.

Abstract: The present invention relates to an access node (2a, 2b) comprising: a forwarding mean (31) adapted to forward data traffic according to a forwarding table (32) that comprises one-to-one associations between destination hardware addresses and respective egress interfaces, a forwarding configuration means (33) adapted to configure forwarding entries into the forwarding table, a capturing means (34) adapted to capture auto-configuration messages exchanged between an auto-configuration server (4) and subscriber devices for assigning network addresses thereto. An access node according to the invention is characterized in that the forwarding configuration means is coupled to the capturing means, and is further adapted to synchronize the configuration of a particular forwarding entry related to a particular hardware address (MAC@1) of a particular subscriber device (1) with the lease of a particular network address (IP@1) to the particular subscriber device.

Abstract: Method for securing communication in a local area network switch (AN) comprising a user interface (UI) and a network interface (NI), comprises the steps of extracting a source address (MACi) from each packet received by said Local area network switch (AN) and storing said address (MACi) together with associated information into a address forwarding table (FT) comprised in said Local area network switch (AN) is characterised in that a distinction is made between source addresses received from the user interface (UI) and the network interface (NI), such that upon detecting that a source address (MACi) contained within a newly received packet at the user interface (UI) was already stored as a source address received at the network interface (NI), said newly received packet will be discarded and its source address contained therein will not be stored within said address forwarding table (FT).

Abstract: The present invention discloses a solution which delivers routing systems with less path setup latency and causes them to be less susceptible to network loading, by providing them the ability to setup diverse paths as a result of specifying network resources to exclude as part of a path setup. The invention proposes an extension to RSVP-TE in the form of a new RSVP-TE object, known as an Exclude Route Object, which will allow, in a path setup request, the specification of a set of abstract nodes and resources to be explicitly excluded from the path. Additionally, the invention introduces a second type of exclusion which is achieved through a modification to the existing Explicit Route Object (ERO) by allowing a node to specify, in a path setup request, the exclusion of certain abstract nodes and resources between a specific pair of abstract nodes within an Explicit Route Object.

Abstract: A telecommunication network with fast-reroute features wherein a method is used to release, by means of a “Path_Tear Message”, a Label Switched Path [LSP] established between linked routers (A, B, C, D, E). The routers are linked in cascade according to a Main Path (AB, BC, CD, DE) and are further linked in another order according to at least one Detour Path (ac, ce; bd). The Path_Tear Message includes a tag indicating, in each router, whether this Path_Tear Message should be immediately forwarded towards a downstream-located router or not. It is thereby possible to obtain a faster release of any unused Label Switched Path [LSP] than waiting for a timeout of 1 to 2 minutes, as it is currently the case.

Abstract: The present invention relates to a communication method, and related buffering and line termination elements to be used in a communication network. The communication network includes a buffering element, a line termination element and several network termination elements. The buffering element is coupled to the line termination element, and the line termination element is coupled to each of the network termination elements over a shared medium. The buffering element and the line termination element interact in such a way that the line termination element adjusts a cell input/output rate of the buffering element to bandwidth related conditions of the network termination elements, or vice versa.

Abstract: A method for controlling the transmission of messages (Emails) from a first user (User A) to a second user (User B) in order to detect the transmission of unwanted Emails or spam. The transmission of an Email from User A to User B occurs via a first mail server, associated to a first Internet Service Provider (ISP A) of user A, and a second mail server, associated to a second Internet Service Provider (ISP B) of user B. In this method, ISP A transmits identification parameters to a legal user database provided with an “Email Name Service” (ENS). The parameters comprise trustworthy level of the User A. At the reception of the Email, the second mail server checks the legal user database and transfers the Email to User B only if User A is identified by the Email Name Service and if his/her trustworthy level is acceptable.

Abstract: A method for allocating a bandwidth between a plurality of network terminals (NTx) coupled, via a common link (L), to a main network station (LT) in a communication network. A medium access controller (MC) forwards permits to the network terminals, each permit containing a terminal identifier and allowing a predetermined share of bandwidth. It comprises two sets of counters, each set including one counter (Gx or Fx) for each terminal. The bandwidth is split into a guarantee bandwidth that is shared by operating the first set of counters and an excess bandwidth that is shared by operating the second set of counters. The guaranteed bandwidth is allocated according to fixed weights, and the excess bandwidth is also allocated according to weights. The weights for the excess bandwidth are either fixed or varying according to the load status of the terminals.

Abstract: The shaping method buffers data packets of the incoming data flow and determines a leaking time moment for a buffered data packet. The leaking time moment is when the buffer should leaks a data packet. Determining the leaking time moment is a function of traffic contract parameters related to the incoming data flow. Status information is received from a marker that is downstream from the shaper, and a conform time moment is determined according to the status information and to a predefined drop priority. When the buffer leaks a data packet at the conform time moment, upon reception, the buffered data packet receives the predefined drop priority from the marker. The conform time moment is compared with the leaking time moment, and when the conform time moment is earlier, the leaking time moment is constituted with the conform time moment to leak the buffered data packet at that time moment.

Abstract: The present invention discloses a solution which delivers routing systems with less path setup latency and causes them to be less susceptible to network loading, by providing them the ability to setup diverse paths as a result of specifying network resources to exclude as part of a path setup. The invention proposes an extension to RSVP-TE in the form of a new RSVP-TE object, known as an Exclude Route Object, which will allow, in a path setup request, the specification of a set of abstract nodes and resources to be explicitly excluded from the path. Additionally, the invention introduces a second type of exclusion which is achieved through a modification to the existing Explicit Route Object (ERO) by allowing a node to specify, in a path setup request, the exclusion of certain abstract nodes and resources between a specific pair of abstract nodes within an Explicit Route Object.

Abstract: A telecommunication network with fast-reroute features wherein a method is used to release, by means of a “Path_Tear Message”, a Label Switched Path [LSP] established between linked routers (A, B, C, D, E). The routers are linked in cascade according to a Main Path (AB, BC, CD, DE) and are further linked in another order according to at least one Detour Path (ac, ce; bd). The Path_Tear Message includes a tag indicating, in each router, whether this Path_Tear Message should be immediately forwarded towards a downstream-located router or not. It is thereby possible to obtain a faster release of any unused Label Switched Path [LSP] than waiting for a timeout of 1 to 2 minutes, as it is currently the case.

Abstract: A method and apparatus is disclosed for differentiating service in a data network which supports a plurality of service classes, by implementing a pricing strategy such that revenue for the ISP in non-busy hours in increased. An edge router assigns a predetermined packet service class value, which is either an artificial packet loss probability or an artificial packet delay, to each one of an associated plurality of service classes, of packets in a data stream, the predetermined packet service class value decreasing with the increasing importance degree of each of its associated plurality of service classes. The packets are delayed or dropped according to the predetermined packet service class value and according to a load on the data network.

Abstract: Network-units like routers generate indication signals—defining qualities for flow signals each comprising packet signals—by detecting specifiers (classifiers, identifiers, addresses) in said flow signals and by generating said indication signals in dependence of said specifiers. In this case in the network-unit all flow signals belonging to a session are treated equally. By storing flow-information in a memory and generating said indication signals further in dependence of flow-information of previous flow signals, within a session certain flow signals can be treated individually, for rewarding flow signals with a higher quality (less delay) in case a session takes longer, and taking into account a certain threshold being exceeded or not. This can be done by adjusting quality indicators in flow signals (Diffserv) and by requesting qualities for flow signals (Intserv). Said flow-information preferably comprises information about a number of flow signals per session and/or time-interval.

Abstract: A method for allocating a bandwidth between a plurality of network terminals (NTx) coupled, via a common link (L), to a main network station (LT) in a communication network.

Abstract: The present invention relates to a communication method, related buffering element and line termination element to be used in a communication network. The communication network consists of a buffering element a line termination element and a plurality of network termination elements. The buffering element is coupled to the line termination element, and the line termination element in its turn is coupled to each of the network termination elements over a shared medium. The buffering element and the line termination element interact in such a way that the line termination element adjusts a cell input/output rate of the buffering element to bandwidth related conditions of the network termination elements, or vice versa.