-
公开(公告)号:US11089517B2
公开(公告)日:2021-08-10
申请号:US15039292
申请日:2016-03-09
IPC分类号: H04W28/26 , H04L12/911 , H04L12/703 , H04L12/707 , H04L12/735 , H04L12/803
摘要: A network node and a method performed in a network node of a cellular communication network comprising the steps of obtaining an indicator to secure a traffic availability for a connection, wherein the traffic availability is related to how likely the connection will remain operable, determining whether the network node can secure resources to support the traffic availability, allocating resources for the connection when resources can support the traffic availability, and transmitting a positive response when the network node can secure resources to support the traffic availability.
-
公开(公告)号:US10938708B2
公开(公告)日:2021-03-02
申请号:US15508722
申请日:2015-09-07
申请人: K.Mizra LLC
发明人: Borgert Jan van der Kluit , Adrianus Cornelis Gerardus Holtzer , Bart Michel Magdalena Gijsen , Hendrik Bernard Meeuwissen
IPC分类号: H04L12/735 , H04L12/721 , H04L12/741
摘要: A path discovery process is provided for discovering a lowest cost combination of a plurality of paths from the source node to the destination node via links between pairs of nodes along the paths. A path discovery messages from a source node is forwarded through the network. Prior to forwarding the path discovery message a node tests one or more conditions for disabling the forwarding. Upon receiving an instance of the path discovery message, this may include testing whether no other instance of the path discovery message has both smaller cost and a previous path that contains only nodes that occur also in the path of the received instance. Furthermore, this may include testing whether a destination of the path discovery message was also a node to which a preceding node along the path has a further link, and a cost of the path from the preceding node to the next node via said further link is not larger than the cost of the path from the preceding node to the next node. Furthermore, this may include testing whether the node has a further link to the destination node and the cost associated with the link to the next node is not less than the cost associated with the further link to the destination node.
-
公开(公告)号:US10931567B2
公开(公告)日:2021-02-23
申请号:US15978824
申请日:2018-05-14
发明人: Guangzhi Li , Dongmei Wang
IPC分类号: H04L12/703 , H04L12/42 , H04L12/751 , H04L12/721 , H04L12/735 , H04L12/761 , H04L12/707 , H04L12/18 , H04L12/24
摘要: Disclosed herein are systems, methods, and computer readable media for modifying IP backbone link weights such that multicast traffic and unicast traffic will not travel on a same path between nodes. The method comprises assigning link weights to nodes within an IP backbone such that multicast forwarding paths and unicast forwarding paths are failure disjoint, and delivering undelivered multicast packets using IP unicast encapsulation to the loopback address of next hop router on a multicast tree upon link/interface failure.
-
公开(公告)号:US20200252426A1
公开(公告)日:2020-08-06
申请号:US16775627
申请日:2020-01-29
发明人: Joonghwan LEE
IPC分类号: H04L29/06 , H04L12/735
摘要: An electronic device and a control method thereof are provided. The electronic device includes an Internet protocol (IP) address corresponding to a domain name of a web page when a user command inputting the domain name is received, identifies a number of hops included in a network path connecting a server corresponding to the obtained IP address and the electronic device to each other, and determines that a man-in-the-middle attack exists in a network when a communication connection with the server is established on the basis of a smaller number of hops than the identified number of hops.
-
公开(公告)号:US10708169B2
公开(公告)日:2020-07-07
申请号:US15906821
申请日:2018-02-27
IPC分类号: H04L12/735 , H04L12/721 , H04L12/707 , H04L12/717
摘要: A method, an apparatus and a non-transitory computer-readable storage medium for determining multiple disjoint constrained paths in a communications network are disclosed. The method includes selecting upper bounds QoS metrics for each path in a disjoint combination of paths having two or more disjoint paths between a source node and a destination node; determining a minimum-cost disjoint path combination, and a minimum-QoS metric disjoint path combination; computing a maximum QoS metric by summing the QoS metrics of each minimum-cost path in the minimum-cost disjoint path combination, and computing a minimum QoS metric by summing the QoS metrics of each minimum-QoS metric path in the minimum-QoS metric disjoint path combination.
-
公开(公告)号:US10700891B2
公开(公告)日:2020-06-30
申请号:US15835603
申请日:2017-12-08
发明人: Weiguo Hao , Qiandeng Liang , Shibi Huang
IPC分类号: H04L12/46 , H04L12/24 , H04L12/735 , H04L12/721 , H04L12/715 , H04L12/851 , H04L12/725
摘要: A method of implementing a service chain in a service chain-enabled domain network includes: receiving, by an intermediate service node (SN), an extended first Border Gateway Protocol (BGP) packet from a downstream SN that is on a service chain path and immediately adjacent to the intermediate SN, the extended first BGP packet including a service chain path identifier identifying the service chain path and a first service chain path including a service chain path from an ingress SN to the intermediate SN, determining an upstream SN that is on the first service chain path and immediately adjacent to the intermediate SN, and sending an extended second BGP packet to the upstream SN, the extended second BGP packet including the service chain path identifier and a second service chain path including a service chain path from the ingress SN to the upstream SN.
-
公开(公告)号:US10432502B2
公开(公告)日:2019-10-01
申请号:US15818912
申请日:2017-11-21
发明人: Jung Ho Myung
IPC分类号: H04L12/721 , H04L12/707 , H04L12/801 , H04L12/735 , H04L12/715
摘要: A disclosure of the present invention is related to a method and an apparatus for overlap-resistant dynamic routing to prevent a path from overlapping. A method of performing an overlap-resistant routing according to an embodiment of the present disclosure includes: computing p candidate paths (p is an integer more than 2) from a first host to a second host based on information related to a network structure; computing k paths (k is an integer more than 1, k≤P) with low redundancy from the p candidate paths; and setting one path from the k paths according to a path change timing.
-
公开(公告)号:US20190199618A1
公开(公告)日:2019-06-27
申请号:US16222682
申请日:2018-12-17
申请人: SONY CORPORATION
发明人: Ramy Abdallah , Kazuyuki Sakoda
IPC分类号: H04L12/707 , H04W40/06 , H04L12/735 , H04B7/06 , H04B7/0413 , H04L12/721 , H04W40/24 , H04L12/703 , H04W74/08 , H04W74/00
摘要: A method and apparatus for routing the same data through independent routes between stations in a mesh network to increase the robustness of communications. The disclosed feature allows transmission of the same data stream via multiple routes from a source station (STA) to a destination station (STA). An extended routing request (RREQ) and routing reply (RREP) are utilized which provide a primary and secondary flag indication, which is utilized in combination with advanced programming for setting path cost metrics to assure independence of primary and secondary routes.
-
公开(公告)号:US10164867B2
公开(公告)日:2018-12-25
申请号:US15423741
申请日:2017-02-03
IPC分类号: H04L12/705 , H04L12/927 , H04L12/735
摘要: In one embodiment, a method comprises creating, in a computing network, a loop-free routing topology comprising a plurality of routing arcs for reaching a destination network node; identifying, within the loop-free routing topology, non-congruent paths for a source network node to reach the destination node; and determining, from the non-congruent paths, a non-congruent path pair providing no more than a prescribed difference of latency from the source network node to the destination node, enabling the source network node to forward a data packet in a first direction of the one non-congruent path pair and a bicasted copy of the data packet in a second direction of the one non-congruent path pair, for reception of the data packet and the bicasted copy by the destination node within the prescribed difference of latency.
-
公开(公告)号:US09973377B2
公开(公告)日:2018-05-15
申请号:US14974409
申请日:2015-12-18
发明人: Victor Yu Liu , Yufei Wang
IPC分类号: H04L12/24 , H04L12/751 , H04L29/14 , H04L12/437 , H04B10/038 , H04L12/715 , H04L12/707 , H04L12/703 , H04J14/02 , H04L12/735
CPC分类号: H04L41/0654 , H04B10/038 , H04J14/0287 , H04L12/437 , H04L41/12 , H04L41/145 , H04L45/02 , H04L45/1283 , H04L45/22 , H04L45/28 , H04L45/64 , H04L69/40
摘要: A method comprising identifying a physical ring in a physical layer of a network according to a logical ring in a logical layer of the network, wherein the logical ring is formed from a plurality of nodes interconnected by a plurality of logical links, and wherein the physical ring is formed from at least the plurality of nodes interconnected by a first plurality of physical links, computing a plurality of cross cord paths across the physical ring, and mapping the logical ring onto the physical layer to provide dual physical link failure survivability by determining primary paths and secondary paths for the plurality of logical links over the physical ring and the plurality of cross cord paths such that a secondary path of a first of the plurality of logical links is non-overlapping with a primary path of a second of the plurality of logical links.
-
-
-
-
-
-
-
-
-