公开(公告)号：EP2201730A4

公开(公告)日：2012-02-29

申请号：EP07835346

申请日：2007-10-19

Applicant: ERICSSON TELEFON AB L M

Inventor： HARMATOS JANOS

IPC: H04L12/56

CPC classification number: H04L47/215 ,  H04L47/2441 ,  H04L47/525 ,  H04L47/527 ,  H04L47/528 ,  H04L47/6215 ,  H04L47/629

公开(公告)号：WO2013053403A9

公开(公告)日：2013-06-06

申请号：PCT/EP2011068021

申请日：2011-10-14

Applicant: ERICSSON TELEFON AB L M ,  RACZ SANDOR ,  NADAS SZILVESZTER ,  GEROE BALAZS PETER ,  HARMATOS JANOS

Inventor： RACZ SANDOR ,  NADAS SZILVESZTER ,  GEROE BALAZS PETER ,  HARMATOS JANOS

IPC: H04W28/10

CPC classification number: H04W28/0278 ,  H04L47/20 ,  H04L47/2416 ,  H04L47/31 ,  H04L47/32 ,  H04W28/10

Abstract: A method is presented of transporting data packets over a telecommunications transport network. The data packets are carried by a plurality of bearers. For each of the bearers, independently of the other bearers, bandwidth profiling is applied to the data packets of the bearer to designate as 'green' data packets that are conformant with a predetermined maximum Information Rate for the bearer. One or more data packets is buffered for up to a predetermined maximum 'green' buffer time, during which if transporting the data packet would not cause the maximum information rate of the bearer to be exceeded, the data packet is designated as a 'green' data packet. The data packets are forwarded for transporting over the transport network. If there is insufficient bandwidth available in the transport network to transport all data packets, data packets that are not designated as 'green' data packets are discarded, so as not to be transported through the transport network.

Abstract translation: 介绍了一种通过电信传输网络传输数据分组的方法。 数据分组由多个承载携带。 对于每个承载，独立于其他承载，将带宽分析应用于承载的数据分组，以指定与承载的预定最大信息速率一致的“绿色”数据分组。 一个或多个数据分组被缓存达到预定的最大“绿色”缓冲时间，在此期间，如果传输数据分组不会导致超过载波的最大信息速率，则数据分组被指定为“绿色” 数据包。 数据包被转发通过传输网络传输。 如果传输网络中的可用带宽不足以传输所有数据包，则未被指定为“绿色”数据包的数据包将被丢弃，以免通过传输网络传输。

公开(公告)号：WO2012019629A8

公开(公告)日：2012-04-12

申请号：PCT/EP2010004997

申请日：2010-08-13

Applicant: ERICSSON TELEFON AB L M ,  MIKLOS GYOERGY ,  HARMATOS JANOS

Inventor： MIKLOS GYOERGY ,  HARMATOS JANOS

IPC: H04W80/04

CPC classification number: H04W40/00 ,  H04W8/06 ,  H04W76/022 ,  H04W80/02 ,  H04W80/04

Abstract: The present disclosure relates to a technique for maintaining communication established between a mobile node (20) and a home network (100) of the mobile node (20). A method embodiment comprises the step of: determining whether the mobile node 20 has moved to a foreign network (120) different from the home network (100); wherein, when it is determined in the step of determining that the mobile node (20) has moved to the foreign network (120), the method embodiment further comprises the steps of: signalling, by the mobile node (20), a foreign address assigned by the foreign network (120), to a home agent (10) of the home network (100); and maintaining the communication between the mobile node (20) and the home network (100) by establishing communication between the mobile node (20) and the home agent (10) of the home network (10) for transmission of Data Link Layer (" DLL") frames through an Internet Protocol ("IP") based network (140), wherein the mobile node (20) is addressed by the home agent (10) by means of the foreign address assigned by the foreign network (120).

Abstract translation: 本公开涉及一种用于维护在移动节点（20）和移动节点（20）的家庭网络（100）之间建立的通信的技术。 方法实施例包括以下步骤：确定移动节点20是否移动到与家庭网络不同的外部网络（120）; 其特征在于，在确定所述移动节点（20）已经移动到所述外部网络（120）的步骤中确定的情况下，所述方法实施例还包括以下步骤：由所述移动节点（20）向所述移动节点（20）发送外部地址 由所述外部网络（120）分配给所述家庭网络（100）的归属代理（10）; 以及通过建立所述移动节点（20）和所述归属网络（10）的所述归属代理（10）之间的通信来维护所述移动节点（20）和所述归属网络（100）之间的通信以传输数据链路层（“ DLL“）帧，其中移动节点（20）由归属代理（10）通过由外部网络（120）分配的外部地址来寻址。

公开(公告)号：BRPI0418497A

公开(公告)日：2007-06-19

申请号：BRPI0418497

申请日：2004-12-22

Applicant: ERICSSON TELEFON AB L M

Inventor： WESTBERG LARS ,  ANTAL CSABA ,  HARMATOS JANOS ,  JUETTNER ALPAR

IPC: H04L12/56 ,  H04L12/24 ,  H04L12/46

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.

公开(公告)号：AT546922T

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

申请号：AT04809138

申请日：2004-12-22

Applicant: ERICSSON TELEFON AB L M

Inventor： WESTBERG LARS ,  ANTAL CSABA ,  HARMATOS JANOS ,  JUETTNER ALPAR

IPC: H04L12/56 ,  H04L12/24 ,  H04L12/46

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.

公开(公告)号：HK1100810A1

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

申请号：HK07105931

申请日：2007-06-05

Applicant: ERICSSON TELEFON AB L M

Inventor： WESTBERG LARS ,  ANTAL CSABA ,  HARMATOS JANOS ,  JUETTNER ALPAR

IPC: H04L20060101 ,  H04L12/24

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.