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

61. 发明申请

US20090240817A1 System and method for transporting data units through a communication network 有权
标题翻译：通过通信网络传输数据单元的系统和方法
公开(公告)号：US20090240817A1
公开(公告)日：2009-09-24
申请号：US11909453
申请日：2005-03-23
申请人： Michael Meyer , Henning Wiemann , Reiner Ludwig , Joachim Sachs , Stephan Baucke
发明人： Michael Meyer , Henning Wiemann , Reiner Ludwig , Joachim Sachs , Stephan Baucke
IPC分类号： G06F15/82
CPC分类号： H04L69/16 , H04L47/10 , H04L47/193 , H04L47/263 , H04L47/35 , H04L47/40 , H04L69/08 , H04L69/163
摘要： A system and method for transporting data units for a communication network. In a communication between two peers a proxy and a network entity for controlling a partial communication are provided. One or both of the proxy and the network entity is arranged to modify one or more of the data units, in order to provide communication control related information that is different from communication control related information exchanged between the two peers The respective other or both of the proxy and the network entity is arranged to perform data unit transmission control based on the different communication control related information.
摘要翻译：一种用于传送通信网络的数据单元的系统和方法。在两个对等体之间的通信中，提供了用于控制部分通信的代理和网络实体。代理和网络实体中的一个或两个被布置成修改一个或多个数据单元，以便提供与两个对等体之间交换的与通信控制相关信息不同的通信控制相关信息。相应的其他或两者代理和网络实体被布置为基于不同的通信控制相关信息执行数据单元传输控制。

62. 发明申请

US20090154356A1 FLOW CONTROL MECHANISM USING LOCAL AND GLOBAL ACKNOWLEDGEMENTS 有权
标题翻译：使用本地和全球确认的流量控制机制
公开(公告)号：US20090154356A1
公开(公告)日：2009-06-18
申请号：US12279886
申请日：2006-02-27
申请人： Henning Wiemann , Joachim Sachs , Reiner Lugwig
发明人： Henning Wiemann , Joachim Sachs , Reiner Lugwig
IPC分类号： H04L12/56
CPC分类号： H04L1/1809 , H04L1/1635 , H04L1/1841 , H04L1/187 , H04L47/10 , H04L47/11 , H04L47/12 , H04L47/30 , H04L47/323 , H04L47/40 , H04L69/16 , H04L69/163 , H04L2001/0092
摘要： A method of sending data units from a sending node to a receiving node via at least one intermediate node, where: the data units are arranged in a sequence and each data unit is associated with a sequence position identifier; the intermediate node forwards received data units towards the receiving node and sends feedback messages towards the sending node, where in case of a correct receipt of a given data unit at said intermediate node, a corresponding feedback message comprises a first type receive information that indicates said correct receipt at said intermediate node; the receiving node sends feedback messages towards the sending node, where in case of a correct receipt of a given data unit at said receiving node, a corresponding feedback message comprises a second type receive information that indicates said correct receipt at said receiving node; the intermediate node forwards said second type of receipt information towards said sending node and conducts a data unit retransmission procedure in dependence on received receive information; and the sending node conducts a data unit retransmission procedure in dependence on received receipt information of the first and second type, and conducts a data unit flow control procedure for controlling an amount of data that can be sent at a given time in dependence on said first and second type receipt information.
摘要翻译：一种经由至少一个中间节点从发送节点向接收节点发送数据单元的方法，其中：数据单元按顺序排列，每个数据单元与序列位置标识符相关联; 中间节点将接收的数据单元转发到接收节点，并向发送节点发送反馈消息，其中在中间节点处给定数据单元的正确接收的情况下，相应的反馈消息包括指示所述中继节点的第一类型接收信息在所述中间节点处正确接收; 所述接收节点向所述发送节点发送反馈消息，其中在所述接收节点正确接收给定数据单元的情况下，相应的反馈消息包括在所述接收节点处指示所述正确接收的第二类型接收信息; 所述中间节点将所述第二类型的接收信息转发给所述发送节点，并根据所接收的接收信息进行数据单元重传过程; 并且发送节点根据接收到的第一和第二类型的接收信息进行数据单元重传过程，并且执行数据单元流控制过程，用于根据所述第一和第二类型在给定时间控制可以发送的数据量和第二类型收据信息。

63. 发明申请

US20080256091A1 Prioritising Data Elements of a Data Stream 有权
标题翻译：确定数据流的数据元素
公开(公告)号：US20080256091A1
公开(公告)日：2008-10-16
申请号：US10597453
申请日：2004-01-30
申请人： Markus Kampmann , Uwe Horn , Joachim Sachs , Jan Kritzner
发明人： Markus Kampmann , Uwe Horn , Joachim Sachs , Jan Kritzner
IPC分类号： G06F17/30
CPC分类号： H04N19/164 , H04N19/132 , H04N19/159 , H04N19/172 , H04N19/51
摘要： The invention relates to prioritising of data elements of a data stream for transmission to a receiving device including determining a decodability of data elements, wherein the decodability indicates the extent to which the current data element is decodable at the receiving device. Then, a priority is assigned to the data elements based on the determined decodabilities. A transmission of the data elements to a receiving device is then scheduled based on the priorities.
摘要翻译：本发明涉及数据流的数据元素的优先级，用于传输到接收设备，包括确定数据元素的可解码性，其中可解码性指示当前数据元素在接收设备处可解码的程度。然后，基于所确定的可解码性，将优先级分配给数据元素。然后基于优先级来调度数据元素到接收装置的传输。

64. 发明申请

US20080192925A1 Means and Method for Ciphering and Transmitting Data in Integrated Networks 有权
标题翻译：综合网络中数据加密和传输的手段和方法
公开(公告)号：US20080192925A1
公开(公告)日：2008-08-14
申请号：US11914292
申请日：2005-05-16
申请人： Joachim Sachs , Ian Herwono
发明人： Joachim Sachs , Ian Herwono
IPC分类号： H04L9/06
CPC分类号： H04L63/0428 , H04L9/0861 , H04L9/3236 , H04L12/5692 , H04L63/083 , H04L63/164 , H04L2209/80 , H04W12/02 , H04W80/02 , H04W84/12
摘要： The invention provides a method for ciphering and transmitting data, to be used by a communication device being arranged to transmit data through a first data port (241, 2002) according to a first transmission protocol, and to form ciphered exploiting a ciphering algorithm being fed with a first set of ciphering parameters, comprising a ciphering parameter CP5; said device being further arranged to transmit data through a second data port (242, 2003) according to an alternative transmission protocol, said method comprising the steps of: defining an alternative ciphering parameter, ACP, having a bit length equal to the bit length of CP5, forming a second set of ciphering parameters by substituting said CP5 with said ACP in said first set of ciphering parameters, forming ciphered data by subjecting the data to said ciphering algorithm being fed with said second set of ciphering parameters, transmitting said ciphered data through said second data port (242, 2003). The invention also provides a software program and communication devices realising said method.
摘要翻译：本发明提供了一种用于加密和发送数据的方法，由通信设备使用，被配置为根据第一传输协议通过第一数据端口（241,2002）传输数据，并且形成加密的加密算法被加密具有第一组加密参数，包括加密参数CP 5; 所述设备还被布置为根据替代传输协议通过第二数据端口（242,2003）传输数据，所述方法包括以下步骤：定义具有等于位长度的位长度的替代加密参数ACP CP 5，通过用所述第一组加密参数中的所述ACP代替所述CP5来形成第二组加密参数，通过使所述数据对所述加密算法进行加密，形成加密数据，所述加密算法被馈送所述第二组加密参数，传送所述加密参数数据通过所述第二数据端口（242,2003）。本发明还提供实现所述方法的软件程序和通信装置。

65. 发明申请

US20080095112A1 Method and Devices for Duplicated Packets Identification During Handover 有权
标题翻译：切换过程中重复数据包识别的方法和设备
公开(公告)号：US20080095112A1
公开(公告)日：2008-04-24
申请号：US11569107
申请日：2004-05-14
申请人： Henning Wiemann , Joachim Sachs , Ian Herwono
发明人： Henning Wiemann , Joachim Sachs , Ian Herwono
IPC分类号： H04Q7/00 , H04Q7/38
CPC分类号： H04W36/02 , H04W36/18
摘要： A method and devices for performing a handover of a data unit based communication that involves a sequence of data units from a first connection (51) between a first sender (10) and a receiver (4) to a second connection (52) between a second sender (20) and said receiver (4), which comprises indicating to thc receiver (4) a reference data unit among data units provided to both the first sender (10) and the second sender as a part of the handover, and where the receiver, based on the reference data unit, keeps a record for identifying such data units among those data units provided to both the first sender (10) and the second sender (20) that were sent over the first connection (51) and successfully.received by the receiver (4), prior to the communication having been passcd to the second communication (52).
摘要翻译：一种用于执行基于数据单元的通信的方法和设备，该通信涉及从第一发送器（10）和接收器（4）之间的第一连接（51）到第二连接（52）之间的数据单元序列，第二发送器（20）和所述接收器（4），其包括向接收器（4）指示作为切换的一部分提供给第一发送器（10）和第二发送器的数据单元中的参考数据单元，并且其中基于参考数据单元的接收器保存用于在通过第一连接（51）发送的第一发送器（10）和第二发送器（20）提供给提供给这两个数据单元的那些数据单元之间识别这样的数据单元的记录，并成功在通信被传递到第二通信（52）之前，由接收器（4）接收。

66. 发明授权

US07151936B2 Downlink scheduling using parallel code trees 有权
标题翻译：使用并行代码树的下行链路调度
公开(公告)号：US07151936B2
公开(公告)日：2006-12-19
申请号：US10470159
申请日：2002-01-08
申请人： Stefan Wager , Joachim Sachs , Henning Wiemann
发明人： Stefan Wager , Joachim Sachs , Henning Wiemann
IPC分类号： H04Q7/20 , H04J11/00
CPC分类号： H04W72/1273 , H04B2201/709709 , H04J13/16 , H04W72/0466 , H04W72/1242 , H04W72/1284
摘要： The present invention aims at avoiding code limitation in a CDMA cellular mobile communication network without decrease in data transmission quality. This object is achieved through a method of scheduling a transfer of data to at least one user in a cellular mobile communication network where the transfer of data is achieved via downlink channels using codes selected from a plurality of code trees. In a first step of the method a plurality of requests (*) to access downlink channels are received until the beginning of a scheduling time interval. In a second step permissions to access downlink channels ( ) are coordinated according to the assignment of downlink channels to the different code trees (A, B).
摘要翻译：本发明旨在避免CDMA蜂窝移动通信网络中的代码限制，而不会降低数据传输质量。该目的通过一种调度数据传送到蜂窝移动通信网络中的至少一个用户的方法来实现，其中通过使用从多个码树中选择的代码经由下行链路信道来实现数据传送。在该方法的第一步骤中，接收到访问下行链路信道的多个请求（*），直到调度时间间隔的开始。在第二步中，根据对不同码树（A，B）的下行链路信道的分配来协调接入下行链路信道（）的许可。

67. 发明授权

US06772215B1 Method for minimizing feedback responses in ARQ protocols 有权
标题翻译： ARQ协议中反馈响应最小化的方法
公开(公告)号：US06772215B1
公开(公告)日：2004-08-03
申请号：US09537146
申请日：2000-03-29
申请人： Bela Rathonyi , Joachim Sachs , Michael Meyer , Per Beming , Mathias Johansson , Christiaan Roobol , Erik Schön , Kazuhiko Inoue
发明人： Bela Rathonyi , Joachim Sachs , Michael Meyer , Per Beming , Mathias Johansson , Christiaan Roobol , Erik Schön , Kazuhiko Inoue
IPC分类号： G06F1516
CPC分类号： H04L1/1628 , H04L1/1614 , H04L1/1621 , H04L1/1671 , H04L1/1809
摘要： A method for minimizing feedback responses in an ARQ protocol is disclosed, whereby different mechanisms can be used to indicate erroneous D-PDUs and construct S-PDUs. The S-PDUs are constructed so as to optimize performance in accordance with certain criteria. One such criterion used is to minimize the size of the S-PDUs. A second such criterion used is to maximize the number of SNs included in an S-PDU of limited size.
摘要翻译：公开了一种在ARQ协议中最小化反馈响应的方法，由此可以使用不同的机制来指示错误的D-PDU并构造S-PDU。 S-PDU被构造成根据特定标准优化性能。所使用的一个这样的标准是最小化S-PDU的大小。所使用的第二个这样的标准是使包含在有限大小的S-PDU中的SN的数量最大化。

68. 发明授权

US06301479B1 Technique for providing a secure link in a mobile communication system 有权
标题翻译：在移动通信系统中提供安全链路的技术
公开(公告)号：US06301479B1
公开(公告)日：2001-10-09
申请号：US09349899
申请日：1999-07-08
申请人： Christiaan Roobol , Mathias Johansson , Raul Söderstrom , Bela Rathonyi , Joachim Sachs
发明人： Christiaan Roobol , Mathias Johansson , Raul Söderstrom , Bela Rathonyi , Joachim Sachs
IPC分类号： H04L12413
CPC分类号： H04L1/1835 , H04L1/1607 , H04L1/1874 , H04L1/1887 , H04L29/06 , H04L69/324 , H04W36/02
摘要： A technique for providing a secure link when transitioning between pairs of link layer protocol entities in a mobile communication system is disclosed. The first pair of link layer protocol entities includes a first transmitting link layer protocol entity and a first receiving link layer protocol entity. The second pair of link layer protocol entities includes a second transmitting link layer protocol entity and a second receiving link layer protocol entity. The technique is realized by first suspending data transmissions from the first transmitting link layer protocol entity to the first receiving link layer protocol entity, and then initiating data transmissions from the second transmitting link layer protocol entity to the second receiving link layer protocol entity. Unacknowledged segmented data in the first transmitting link layer protocol entity is then tunneled from the first transmitting link layer protocol entity to the first receiving link layer protocol entity through the second transmitting link layer protocol entity and the second receiving link layer protocol entity.
摘要翻译：公开了一种在移动通信系统中在链路层协议实体对之间转换时提供安全链路的技术。第一对链路层协议实体包括第一传输链路层协议实体和第一接收链路层协议实体。第二对链路层协议实体包括第二传输链路层协议实体和第二接收链路层协议实体。该技术通过首先暂停从第一传输链路层协议实体到第一接收链路层协议实体的数据传输，然后发起从第二传输链路层协议实体到第二接收链路层协议实体的数据传输来实现。然后通过第二传输链路层协议实体和第二接收链路层协议实体，将第一传输链路层协议实体中未确认的分段数据从第一传输链路层协议实体隧道传送到第一接收链路层协议实体。

69. 发明授权

US09775183B2 Radio communication system for assigning a short-lived C-RNTI 有权
公开(公告)号：US09775183B2
公开(公告)日：2017-09-26
申请号：US14370162
申请日：2012-01-03
申请人： György Miklós , Erik Eriksson , Johan Rune , Joachim Sachs , Zoltán Turányi , Niclas Wiberg
发明人： György Miklós , Erik Eriksson , Johan Rune , Joachim Sachs , Zoltán Turányi , Niclas Wiberg
IPC分类号： H04W76/02 , H04W8/26 , H04W72/04 , H04W74/08
CPC分类号： H04W76/11 , H04W8/26 , H04W72/042 , H04W74/0833
摘要： A radio communication system and a method for assigning a short-lived Cell Radio Network Temporary Identifier, “CRNTI”, to a first user equipment performing random access to a radio network node are provided. The radio communication system registers the first user equipment as connected to the radio network node. A message for synchronizing the radio network node and the first user equipment with respect to the first time period is transferred. After the first time period has elapsed, the radio communication system maintains the first user equipment connected to the radio network node, and allows the short-lived CRNTI to be assigned to a second user equipment.

70. 发明授权

US09674073B2 Method and arrangement for route cost determination and selection with link cost interaction 有权
公开(公告)号：US09674073B2
公开(公告)日：2017-06-06
申请号：US11917112
申请日：2005-12-01
申请人： Mikael Prytz , Joachim Sachs , Per Magnusson , Johan Lundsjö , Peter Larsson
发明人： Mikael Prytz , Joachim Sachs , Per Magnusson , Johan Lundsjö , Peter Larsson
IPC分类号： H04L12/721 , H04L12/735 , H04W40/00
CPC分类号： H04L45/123 , H04L45/12 , H04L45/1283 , H04W40/00
摘要： This invention extends routing mechanisms that use link metrics for route selection so that: A link metric cross correlation vector is determined for all links, where each element in the vector corresponds to some other link, and reflects the change in the link metric value if a data flow would already use this other link. The invention further describes a specific embodiment where all cross-correlating links are adjacent to each other, i.e., they terminate or originate in a common node. A mechanism is described to create an extended routing graph. This extended graph permits the use of standard polynomial time algorithms that simultaneously construct the optimal route and find the optimal route metric (such as shortest-path algorithms) also for the adjacent link cross-correlating case.

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式