Abstract: There is provided a computer-implemented method for controlling operation of a plurality of devices of a facility that consume energy. The method comprises obtaining parameters of an energy model representing the energy consumed by the plurality of devices of the facility, the energy model including a first plurality of variables for operating the plurality of devices and a second plurality of variables for scheduling activities to be conducted in the facility; receiving requests for the activities to be conducted in the facility, the requests including requirements in relation to the activities; and automatically determining, based on the energy model, values of the first plurality of variables to control the operation of the plurality of devices, and values of the second plurality of variables that meet the requirements in relation to the activities.

Abstract: There is provided a computer-implemented method for controlling operation of a plurality of devices of a facility that consume energy. The method comprises obtaining parameters of an energy model representing the energy consumed by the plurality of devices of the facility, the energy model including a first plurality of variables for operating the plurality of devices and a second plurality of variables for scheduling activities to be conducted in the facility; receiving requests for the activities to be conducted in the facility, the requests including requirements in relation to the activities; and automatically determining, based on the energy model, values of the first plurality of variables to control the operation of the plurality of devices, and values of the second plurality of variables that meet the requirements in relation to the activities.

Abstract: It is an object to provide a communication terminal capable of determining a cluster formation so as to promptly perform addition of a participant terminal, while maintaining the quality of a stream relay path. Cluster monitoring terminal (430) is an apparatus to determine a cluster formation in a network performing packet transfer according to terminal relay-type multipoint communication, and includes: a cluster quality calculation section (432) for acquiring cluster quality representing a small loss in a packet to be received, per a cluster; a cluster sustainability calculation section (433) for acquiring cluster sustainability representing ease of acceptance of a participant terminal, per a cluster; and cluster division/integration analysis section (434) for determining cluster division with respect to a cluster having low cluster quality, and determining integration with other cluster with respect to a cluster having high cluster quality and low cluster sustainability.

Abstract: A network delay estimation apparatus capable of creating a metric tree with high accuracy and in a short time. Network delay estimation apparatus (302) includes first-round measurement target node selection section (306) that selects one pair or a plurality of pairs of nodes located at a long distance from each other from a known metric tree as first-round measurement target nodes and measures a distance from an arbitrary node, second-round measurement target node selection section (310) that selects a node whose distance from the arbitrary node is estimated to be short as a second-round measurement target based on the distance and a known metric tree and measures a distance from the arbitrary node, and an optimum tree processing section (314) that creates a network metric tree including the arbitrary node based on the distance and the known metric tree.

Abstract: A terminal apparatus minimizes traffic congestion by reducing end-to-end delay and maximizes the bandwidth available in shared N-tree ALM nodes. In this terminal apparatus, an optimal stream path information table stores N-tree session information for all nodes. A server forwarding table stores bandwidth-fair ALM route information for all nodes in a specific N-tree session. An ALM forwarding table constructor updates N-tree session information stored in an optimal stream path information table using network metrics and heuristic rules stored in a heuristic rule database, executes ALM_N-tree algorithm using updated N-tree session information, and thereby generates bandwidth-fair ALM route information.

Abstract: It is an object to provide a communication terminal capable of determining a cluster formation so as to promptly perform addition of a participant terminal, while maintaining the quality of a stream relay path. Cluster monitoring terminal (430) is an apparatus to determine a cluster formation in a network performing packet transfer according to terminal relay-type multipoint communication, and includes: a cluster quality calculation section (432) for acquiring cluster quality representing a small loss in a packet to be received, per a cluster; a cluster sustainability calculation section (433) for acquiring cluster sustainability representing ease of acceptance of a participant terminal, per a cluster; and cluster division/integration analysis section (434) for determining cluster division with respect to a cluster having low cluster quality, and determining integration with other cluster with respect to a cluster having high cluster quality and low cluster sustainability.

Abstract: Disclosed is a communication channel building device which can guarantee a fair bandwidth allocation and exhibit a preferable perception AV quality in an ALM application. A transfer table building controller controls building of a distribution type optimal channel table over a plurality of communication nodes. A group constructor distributes communication nodes to a group dedicated for a specific source in accordance with the communication node display resolution and the content type and assigns a priority to the group for the specific source. A bandwidth allocator temporarily allocates a bandwidth which can be used for a logic stream between communication nodes. A transfer table constructor builds a distribution type optimal channel table according to the priority of the group for the specific source.

Abstract: A network delay estimation apparatus capable of creating a metric tree with high accuracy and in a short time. Network delay estimation apparatus (302) includes first-round measurement target node selection section (306) that selects one pair or a plurality of pairs of nodes located at a long distance from each other from a known metric tree as first-round measurement target nodes and measures a distance from an arbitrary node, second-round measurement target node selection section (310) that selects a node whose distance from the arbitrary node is estimated to be short as a second-round measurement target based on the distance and a known metric tree and measures a distance from the arbitrary node, and an optimum tree processing section (314) that creates a network metric tree including the arbitrary node based on the distance and the known metric tree.

Abstract: Disclosed is a communication channel building device which can guarantee a fair bandwidth allocation and exhibit a preferable perception AV quality in an ALM application. A transfer table building controller (316) controls building of a distribution type optimal channel table over a plurality of communication nodes. A group constructor (308) distributes communication nodes to a group dedicated for a specific source in accordance with the communication node display resolution and the content type and assigns a priority to the group for the specific source. A bandwidth allocator (322) temporarily allocates a bandwidth which can be used for a logic stream between communication nodes. A transfer table constructor (328) builds a distribution type optimal channel table according to the priority of the group for the specific source.

Abstract: A terminal apparatus is provided that minimizes traffic congestion by reducing end-to-end delay and maximizes the bandwidth available in shared N-tree ALM nodes. In this terminal apparatus, an optimal stream path information table (204) stores N-tree session information for all nodes. A server forwarding table (202) stores bandwidth-fair ALM route information for all nodes in a specific N-tree session. An ALM forwarding table constructor (218) updates M-tree session information stored in an optimal stream path information table (204) using network metrics and heuristic rules stored in a heuristic rule database (206), executes ALM_N-tree algorithm using updated N-tree session information, and thereby generates bandwidth-fair ALM route information.