会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 36. 发明公开
    • PROCEDE DE ROUTAGE DANS UN RESEAU AD HOC
    • 路易斯安那州赫尔辛基(Einem AD-HOC-NETZWERK)
    • EP2005668A1
    • 2008-12-24
    • EP07731678.4
    • 2007-03-01
    • France Télécom
    • VU DUONG, ThangKETTAF, NoureddineHAFID, AbouaissaLORENZ, Pascal
    • H04L12/56H04L12/28
    • H04L47/824H04L45/26H04L45/302H04L45/32H04L45/34H04L47/70H04L47/724H04L47/822H04L47/829H04W40/28H04W84/18
    • The invention concerns a routing method in an ad hoc network between a source node (S) and a recipient node (M). In order to establish a route to the recipient node (M), the source node (S) transmits a route request in multicast mode to the neighbouring nodes, said request containing at least said requested quality of service level and an initial value of a cost function. A neighbouring node receiving the route request transmitted by the source node refuses it if it is not capable of ensuring said requested QoS level, or in turn transmits a route request on the network, said request containing at least said requested QoS level and one value of said cost function calculated on the link with the source node. The recipient node (M), in response to the cumulated values of the cost function it receives, transmits cumulatively a route reply towards the source node (S) containing at least the cumulated value of said cost function corresponding to a route formed by successive links between the source node (S) and the recipient node (M). The source node selects the route between the source node (S) and the recipient node (M) having the best cumulated cost function.
    • 在源节点(S)和目的地节点(M)之间的自组织网络中的路由方法,以保证源节点和目的地节点之间所需的服务质量水平。 源节点(S)向网络发送路由请求,请求包含所需的服务质量级别和成本函数的初始值(Fg)。 如果节点不能保证所要求的服务质量水平,接收到相邻节点发送的路由请求的节点拒绝所述请求,并且通过网络发送包含所需服务质量等级和成本函数值的路由请求 从先前的邻居节点接收的成本函数的值和在与邻居节点的连接上计算出的成本函数的值。 目的地节点(M)逐步向包含源节点(S)和目的地节点(S)之间的连续连接形成的路由的成本函数(Fg)的累积值的源节点(S) (M)。 源节点选择具有最佳累积成本函数的源节点(S)和目的地节点(M)之间的路由。
    • 40. 发明公开
    • RESOURCE ALLOCATION
    • BETRIEBSMITTELZUTEILUNG
    • EP1805950A1
    • 2007-07-11
    • EP05782156.3
    • 2005-09-09
    • BRITISH TELECOMMUNICATIONS public limited company
    • CONWAY, Anthony StephenDORNE, Raphael Jean Henri
    • H04L12/56
    • H04L47/746G06Q10/06H04L41/22H04L45/04H04L47/15H04L47/70H04L47/782H04L47/829
    • In order to satisfy requests for a connection path having a specified capacity between two specified terminations (21, 29) of a telecommunications network, a plurality of distinct subsidiary networks are defined (30, 31, 32, 33, 34, 35), each comprising a subset of the nodes making up the complete network (20), and the connections between the subset of nodes. A connection path is determined by identifying connection path elements between interface nodes (312, 324; 334, 345), etc in each subsidiary network (31, 33 etc), identifying connections (302-312, 324-334, 345-355), between the subsidiary networks, and selecting a complete connection path (21, 302, 312, 324, 334, 345, 355, 29) by combining the connection path elements so identified. By partitioning the problem to be solved in this way, the processing time is reduced and any changes to part of the system only require adjustment of that part.
    • 为了满足在电信网络的两个指定终端(21,29)之间具有指定容量的连接路径的请求,定义了多个不同的辅助网络(30,31,32,33,34,35),每个 包括构成完整网络(20)的节点的子集,以及节点子集之间的连接。 通过识别每个辅助网络(31,33等)中的接口节点(312,324,334,345)等之间的连接路径元素来确定连接路径,识别连接(302-312,324-344,345,355) ,在辅助网络之间,以及通过组合所识别的连接路径元素来选择完整的连接路径(21,302,312,324,334,345,355,29)。 通过以这种方式分解待解决的问题,处理时间减少,系统部分的任何更改只需要调整该部分。