Kabushiki Kaisha Toshiba

Toshiba America Research, Inc.

Telcordia Technologies, Inc.

Telcordia Inc.

Yasuhiro Katsube

Kenichi Nagami

Hisako Tanaka

Toshikazu Kodama

Hiroshi Esaki

Takeshi Saito

Shigeo Matsuzawa

Yoshihiro Ohba

Junko Ami

Prathima Agrawal

Shinichi Baba

Kensaku Fujimoto

Tao Zhang

Kotaro Ise

Ashutosh Dutta

Sunil H Madhani

Kenichi Taniuchi

Yoshihiro Oba

Junichi Takahashi

Yoshimitsu Shimojo

Katsumi Yamato

Kazuaki Iwamura

Moncef Elaoud

Yasuyuki Tanaka

Yoshimichi Tanizawa

Mikio Hashimoto

Yoshiaki Takabatake

Ririka Takahashi

Abhrajit Ghosh

Farooq M Anjum

Ravichander Vaidyanathan

Yasuhiro Fujiyoshi

Yu Yu

Kataro Ise

A key management device according to an embodiment is a key management device managing an application key for encrypting a communication in an application network including a plurality of applications. The key management device includes a hardware processor configured to function as a collection unit, a calculation unit, a determination unit, and a communication unit. The collection unit collects, using quantum key distribution (QKD), resource information indicating a resource of a link for which a link key is generated. The calculation unit calculates metric for a key relay route including the link on the basis of the resource information. The determination unit determines a key relay route from among a plurality of key relay routes on the basis of the metric. The communication unit uses the key relay route determined by the determination unit to send, to a destination, an application key encrypted with the link key.

Key management device, quantum cryptography communication system, and computer program product

Systems and methods are described for secure and seamless roaming between internal and external networks. Double and triple tunnels may be used to connect a mobile node to a correspondent host. A mobile node may include the ability to connect to two networks simultaneously to enable seamless roaming between networks.

Secure and seamless WAN-LAN roaming

A first confirmation unit performs a first confirmation of confirming presence of a connection to a correspondent node in a first communication layer, presence of a connection to a correspondent node in a second communication layer, and presence of a connection to a correspondent node in a third communication layer. A locating unit locates a failure point in communication based on a result of the first confirmation. An output unit outputs a result of the location.

Computer program product, failure diagnosis method, and communication apparatus

According to some embodiments, systems and methods for binding dynamic host configuration and network access authentication are provided related to, inter alia, interactions between a PAA (PANA Authentication Agent) and a DHCP (Dynamic Host Configuration Protocol) server, such as, e.g., for synchronization between the PANA SA state and the DHCP SA state, such as, e.g., maintaining synchronization when a connection is lost. In some embodiments, systems and methods for binding network bridge and network access authentication are also provided related to, inter alia, interactions between a PAA and a layer-2 switch, such as, e.g., for avoiding service thefts and the like (such as, e.g., MAC address and/or IP address spoofing) in the context of, e.g., the above. In some other embodiments, systems and methods for bootstrapping multicast security from network access authentication protocol are also provided related to, inter alia, key management for protected IP multicast streams, such as, e.g., to avoid IP multicast streams unnecessarily received and/or processed by unauthorized receivers connected to the same layer 2 segment as authorized receivers in the context of, e.g., the above.

Dynamic host configuration and network access authentication

The present invention provides improved quality of service through data transmission rate control in a network. Data rate control may be in the downlink or uplink direction and may be statically or dynamically configured. Rate control may be implemented at varying points in the network including but not limited to at the wireless host, at the access point, at a separate device such as a server or at a separate location within the network. In one example of the present invention, a rate enforcement function is provided for identifying data packets to be enforced or identifying mapping between each packet and corresponding access point. Also, a rate decision function is also provided for determining the data rate to be enforced for each of the access points or each of the wireless hosts.

Quality of service (QoS) assurance system using data transmission control

A router device realizing a datagram transfer method for improving the datagram transfer efficiency by ascertaining the transfer target and/or the requested quality of service without referring to the datagram content. The router device has network interfaces connected with networks including at least one virtual connection oriented network, a table for registering a correspondence between a virtual connection identifier and a transfer target network interface and/or a quality of service, a connection identifier analysis unit for determining a transfer target network interface and/or a quality of service for a datagram entered from one virtual connection, by referring to the table according to a virtual connection identifier of that one virtual connection. The datagram can be transferred to the determined transfer target network interface, while applying a priority control for datagrams to be transferred by the router device according to the determined quality of service.

Router device and datagram transfer method for data communication network system

A packet transfer scheme in a network system capable of realizing a high speed, large capacity inter-network communication under an internet environment. A network interconnection apparatus (router) has a memory for storing a correspondence relationship between a virtual connection used in receiving a packet from one logical network and a virtual connection used in transmitting a packet to another logical network, and a transfer at a datalink layer is carried out according to the registered correspondence relationship, to effectively form a bypass pipe capable of transferring a packet by an datalink layer level processing alone over a plurality of networks from the transmission terminal to the destination terminal, so that a high speed packet transfer between networks can be realized.

Network interconnection apparatus, network node apparatus, and packet transfer method for high speed, large capacity inter-network communication

Aspects of the invention provide a method and system for managing or coordinating data transmission in a Local Area Network (LAN) such that Quality of Service (QoS) concerns are met. A LAN resource manager (LRM) is provided for managing the LAN resources by providing solutions for providing users with several levels of QoS. Once the LRM admits a user at a certain QoS level, the level is assured within the LAN for as long as the user is in the LAN. A user may submit a request to transmit data to the LRM. The LRM may determine if time allocation is possible and allocate the time slots for data transmission. The LRM may send time slot allocation information to an Access Server in a LAN, which may inform the user of the time slot allocation and prepare a queue according to the slot allocation information.

Local area network resource manager

A node device and a label switched path loop detection method which are capable of detecting a label switched path loop efficiently and quickly are disclosed. In a node device for carrying out the label switching, an ingress node information is included in a message that is to be successively transmitted from the upstream side in order to set up a label switched path, and the fact that the message with the same ingress node information for the same packet flow will be received from a previous hop node that is different from before if the label switched path has a loop formed thereon is utilized. Also, at a time of transmitting a message for the purpose of setting up a label switched path, if a node at which the label switched path for that packet flow already exists on the upstream or downstream side is encountered, this already existing label switched path is traced along the same or opposite direction as the flow, and the label switched path is set up if no loop is detected after tracing to the end.

Scheme for label switched path loop detection at node device

A communication resource management scheme capable of guaranteeing the communication quality with respect to the flow while not requiring the processing for each flow to nodes other than edge nodes is disclosed. The edge node stores an information for obtaining an available amount of communication resources that can be newly allocated in the network to one set of flows which share at least a route from that edge node to an egress node of the network. Then, the edge node carries out an admission control by newly receiving a request for allocation of communication resources for one flow belonging to that one set of flows, judging whether or not to accept the request according to a requested amount of communication resources and the available amount of communication resources as obtained from the information stored for that one set of flows, and allocating requested communication resources to that one flow when it is judged that the request is to be accepted, while the edge node and the core node carry out the priority control.

Communication resource management method and node control device using priority control and admission control

Communication resource management method and node device using priority control and admission control

In a label switched path (LSP) including label switching nodes, some of which process a Time To Live (TTL) value of a generic label header and others of which that do not process the TTL value, an adequate hop-count information regarding the LSP is reported from node to node by using a label distribution protocol. A node, which has received a message including a hop-count of the LSP from an upstream node or a downstream node, determines whether or not the node itself is to update the TTL value in a packet if received through the LSP. The node then transmits a message indicating that the hop-count is one or a message including the incremented hop-count, in accordance with this determination, to the downstream node or the upstream node. Thus, upon transferring packets on the LSP, the nodes forming the LSP that process the TTL value can appropriately decrement the TTL value of the packet.

Method of managing hop-count in label switching network and node apparatus

Growing community of inventors

Kanagawa, Japan

Yasuhiro Katsube