专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明申请

WO2007032733A2 IMPROVED DIMENSIONING METHODS FOR HSDPA TRAFFIC 审中-公开
标题翻译：用于HSDPA交通的改进的尺寸方法
公开(公告)号：WO2007032733A2
公开(公告)日：2007-03-22
申请号：PCT/SE2006050320
申请日：2006-09-11
申请人： ERICSSON TELEFON AB L M , RACZ SANDOR , NADAS SZILVESZTER , MALOMSOKY SZABOLCS , GEROE BALAZS PETER , ROSBERG ULF
发明人： RACZ SANDOR , NADAS SZILVESZTER , MALOMSOKY SZABOLCS , GEROE BALAZS PETER , ROSBERG ULF
IPC分类号： H04W16/18
CPC分类号： H04W28/24 , H04W16/18 , H04W16/22 , H04W92/12
摘要： A method for determining the capacity that is needed on an lub link to fulfill Grade of Service (GoS) requirements in a Universal Mobile Telecommunications System (UMTS) Terrestrial Radio Access Network (UTRAN) for both Dedicated Channel (DCH) traffic and High-Speed Downlink Packet Access (HSDPA) traffic, the method comprising the steps of determining the bandwidth demand of the HSDPA traffic (ElasticDim); calculating an average bandwidth of the DCH traffic on the lub interface (BW
摘要翻译：一种用于在通用移动电信系统（UMTS）陆地无线电接入网络（UTRAN）中为确定专用信道（DCH）业务和高速业务（DCH）业务而确定业务链路上所需的容量以满足服务等级（GoS）要求的方法下行链路分组接入（HSDPA）业务，该方法包括确定HSDPA业务（ElasticDim）的带宽需求的步骤; 计算路由接口上的DCH流量的平均带宽（BW

2. 发明申请

WO2013053403A9 ENHANCED PERFORMANCE SERVICE-BASED PROFILING FOR TRANSPORT NETWORKS 审中-公开
标题翻译：增强的性能基于服务的交通网络分析
公开(公告)号：WO2013053403A9
公开(公告)日：2013-06-06
申请号：PCT/EP2011068021
申请日：2011-10-14
申请人： ERICSSON TELEFON AB L M , RACZ SANDOR , NADAS SZILVESZTER , GEROE BALAZS PETER , HARMATOS JANOS
发明人： RACZ SANDOR , NADAS SZILVESZTER , GEROE BALAZS PETER , HARMATOS JANOS
IPC分类号： H04W28/10
CPC分类号： H04W28/0278 , H04L47/20 , H04L47/2416 , H04L47/31 , H04L47/32 , H04W28/10
摘要： 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.
摘要翻译：介绍了一种通过电信传输网络传输数据分组的方法。数据分组由多个承载携带。对于每个承载，独立于其他承载，将带宽分析应用于承载的数据分组，以指定与承载的预定最大信息速率一致的“绿色”数据分组。一个或多个数据分组被缓存达到预定的最大“绿色”缓冲时间，在此期间，如果传输数据分组不会导致超过载波的最大信息速率，则数据分组被指定为“绿色” 数据包。数据包被转发通过传输网络传输。如果传输网络中的可用带宽不足以传输所有数据包，则未被指定为“绿色”数据包的数据包将被丢弃，以免通过传输网络传输。

3. 发明申请

WO2013127414A1 TECHNIQUE FOR BUNDLING IN LINK AGGREGATION 审中-公开
标题翻译：链接聚合中的绑定技术
公开(公告)号：WO2013127414A1
公开(公告)日：2013-09-06
申请号：PCT/EP2012002766
申请日：2012-06-28
申请人： ERICSSON TELEFON AB L M , GEROE BALAZS PETER , FARKAS JANOS , KHAN SHARYAR , SALTSIDIS PANAGIOTIS , VARGA BALAZS
发明人： GEROE BALAZS PETER , FARKAS JANOS , KHAN SHARYAR , SALTSIDIS PANAGIOTIS , VARGA BALAZS
IPC分类号： H04L12/24
CPC分类号： H04L41/0654 , H04L41/0663 , H04L45/245 , Y02D50/30
摘要： Methods and apparatus are disclosed for applying multiple Link Aggregation Group (LAG) entities on the same set of physical links, thus making bundling of individual services or conversations possible by the different LAG entities within Link Aggregation. Each LAG entity is configured such that a single physical link is Active and all the other links are Standby. Each LAG entity may be regarded as a "bundle." Thus the services/conversations are bundled into a LAG entity and are handed-off on the Active link during normal operation. If service hand-off is not possible on the Active link (e.g., due to a failure), then the LAG entity switches over to a Standby link thus the service/conversation is handed-off on that formerly Standby link. Bundling may simplify operations of control and signaling.
摘要翻译：公开了用于在同一组物理链路上应用多个链路聚合组（LAG）实体的方法和装置，由此通过链路聚合内的不同LAG实体实现各个服务或对话的捆绑。每个LAG实体都配置为使单个物理链路处于活动状态，并且所有其他链路均处于待机状态。每个LAG实体可被视为“捆绑”。因此，服务/会话被捆绑到LAG实体中并在正常操作期间在活动链路上被切断。如果在主动链路上不能进行服务切换（例如，由于故障），则LAG实体切换到备用链路，因此服务/对话在该以前的备用链路上被切换。捆绑可以简化控制和信令的操作。

4. 发明公开

EP1925177A4 IMPROVED DIMENSIONING METHODS FOR HSDPA TRAFFIC 有权
标题翻译： VERBESSERTE DIMENSIONIERUNGSVERFAHRENFÜRHSDPA-VERKEHR
公开(公告)号：EP1925177A4
公开(公告)日：2012-05-30
申请号：EP06784233
申请日：2006-09-11
申请人： ERICSSON TELEFON AB L M
发明人： RACZ SANDOR , NADAS SZILVESZTER , MALOMSOKY SZABOLCS , GEROE BALAZS PETER , ROSBERG ULF
IPC分类号： H04W28/16 , H04W16/18
CPC分类号： H04W28/24 , H04W16/18 , H04W16/22 , H04W92/12

5. 发明专利

DE602004005242T2 未知
公开(公告)号：DE602004005242T2
公开(公告)日：2007-12-20
申请号：DE602004005242
申请日：2004-11-09
申请人： ERICSSON TELEFON AB L M
发明人： MOLNAR GERGELY , TOTH GABOR , GEROE BALAZS PETER , NOHL ATTILA RAJMUND
IPC分类号： H04L12/24
摘要： A method of configuring link-scope-type managed objects in IP-based networks from a centralized management node. An IP-based network includes at least one management station, a set of network nodes, and communication links between the network nodes and between the management station and the network nodes. Preferably, an Open Shortest Path First (OSPF) topology graph of the network is prepared, and a set of target links to be configured is identified. The target links are then classified into N disjoint subsets, T 1 -T N . The links in each subset are then configured in parallel, starting with subset T 1 and sequentially handling each subset one-by-one. The target links may be classified by removing non-target links that are not to be configured from the OSPF topology graph, building a LinkGraph to determine the dependencies between the links remaining in the OSPF topology graph, and building a LinkTree from the LinkGraph to classify the target links into the subsets based upon the dependencies between the links.

6. 发明专利

AT356488T 未知
公开(公告)号：AT356488T
公开(公告)日：2007-03-15
申请号：AT04800300
申请日：2004-11-09
申请人： ERICSSON TELEFON AB L M
发明人： MOLNAR GERGELY , TOTH GABOR , GEROE BALAZS PETER , NOHL ATTILA RAJMUND
IPC分类号： H04L12/24
摘要： A method of configuring link-scope-type managed objects in IP-based networks from a centralized management node. An IP-based network includes at least one management station, a set of network nodes, and communication links between the network nodes and between the management station and the network nodes. Preferably, an Open Shortest Path First (OSPF) topology graph of the network is prepared, and a set of target links to be configured is identified. The target links are then classified into N disjoint subsets, T 1 -T N . The links in each subset are then configured in parallel, starting with subset T 1 and sequentially handling each subset one-by-one. The target links may be classified by removing non-target links that are not to be configured from the OSPF topology graph, building a LinkGraph to determine the dependencies between the links remaining in the OSPF topology graph, and building a LinkTree from the LinkGraph to classify the target links into the subsets based upon the dependencies between the links.

7. 发明专利

DE602004005242D1 未知
公开(公告)号：DE602004005242D1
公开(公告)日：2007-04-19
申请号：DE602004005242
申请日：2004-11-09
申请人： ERICSSON TELEFON AB L M
发明人： MOLNAR GERGELY , TOTH GABOR , GEROE BALAZS PETER , NOHL ATTILA RAJMUND
IPC分类号： H04L12/24
摘要： A method of configuring link-scope-type managed objects in IP-based networks from a centralized management node. An IP-based network includes at least one management station, a set of network nodes, and communication links between the network nodes and between the management station and the network nodes. Preferably, an Open Shortest Path First (OSPF) topology graph of the network is prepared, and a set of target links to be configured is identified. The target links are then classified into N disjoint subsets, T 1 -T N . The links in each subset are then configured in parallel, starting with subset T 1 and sequentially handling each subset one-by-one. The target links may be classified by removing non-target links that are not to be configured from the OSPF topology graph, building a LinkGraph to determine the dependencies between the links remaining in the OSPF topology graph, and building a LinkTree from the LinkGraph to classify the target links into the subsets based upon the dependencies between the links.

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式