Abstract: A data processing system includes a plurality of calculation processors cascaded and a plurality of counters connected to the plurality of calculation processors, respectively. The plurality of calculation processors process a task in an order in which the plurality of calculation processors are cascaded. A count value of an individual one of the plurality of counters is incremented when a corresponding one of the calculation processors starts to process a task and is decremented when a calculation processor in a lowermost stage among the plurality of calculation processors ends the task.

Abstract: A cloud computer system is provided that includes a plurality of computer devices and a database. The plurality of computer devices execute a plurality of virtual machines, with one of the virtual machines serving as a controller node and the remainder serving as worker instances. The controller node is programmed to accept a request to initiate a distributed process that includes a plurality of data jobs, determine a number of worker instances to create across the plurality of computer devices, and cause the number of worker instances to be created on the plurality of computer devices. The worker instances are programmed to create a unique message queue for the corresponding worker instance, and store a reference for the unique message queue that was created for the corresponding worker to the database. The controller node retrieves the reference to the unique message queues and posts jobs to the message queues for execution by the worker instances.

Abstract: A method and apparatus of a device that updates a software image for a network element is described. In an exemplary embodiment, a device receives a signal to update the network element with the new software image, where the network element includes a plurality of hardware forwarding engines and a control plane. The device further boots the control plane with the new software image, where the booting is accomplished without restarting the control plane. In one embodiment, the device boots the control plane by chain booting from a current software image to the new software image. The device additionally restarts and reconfigures the plurality of hardware forwarding engines. In a further embodiment, the device additionally prefills one or more queues in the hardware forwarding engines with keep-alive messages. These keep-alive messages are transmitted during the time that the control plane is being restarted. In a further embodiment, the hardware forwarding engines are reconfigured without restarting them.

Abstract: A microservice architecture includes service instances collectively configured to cooperate with one another to provide a service, and a service router associated with the service instances and configured to receive a service request from a computing device. The service request includes a service request address. The service router includes a routing policy database with routing policies, with each routing policy including a routing policy address and a routing action. The service router queries the routing policy database with the service request address to find a routing policy having a routing policy address matching the service request address, and executes the routing action specified by the matched routing policy to complete routing of the service.

Abstract: Methods, non-transitory computer readable media, network traffic management apparatuses, and network traffic management systems that obtain an assigned Internet Protocol (IP) address from a DHCP server in response to an address request received from a client. One of a plurality of processing cores, on which a traffic management process is executing, is identified. The assigned IP address is modified based on the identified processing core. The modified IP address is sent to the client in response to the received address request. With this technology, connections associated with a same subscriber can advantageously be disaggregated to the same traffic management process.

Abstract: An ad collision machine can be configured to evaluate collision queries for possible ad collisions and is associated with an ad datacenter configured to evaluate and respond to bid requests on behalf of a plurality of advertisers. The ad collision machine can comprise a plurality of nodes and a data cache containing a plurality of user ID-campaign ID keys representing recently submitted bids in response to bid requests. Once a selected node receives a collision query, a user ID-campaign ID key is retrieved from the collision query. If the first key is not found in the data cache, it is written to the data cache by the node and the ad collision machine returns that user ID-campaign ID pair as available to be bid on.

Abstract: A storing unit stores a data set including a plurality of data elements and a first Bloom filter used to determine whether a query-target data element is present in the data set. A calculating unit deletes, when some data elements are deleted, a first bit array from the first Bloom filter. The first bit array has the number of bits corresponding to the number of deleted data elements. When a query-target first data element is entered, the calculating unit adds a second bit array temporarily to a second Bloom filter obtained by deleting the first bit array. The second bit array has the same number of bits as the first bit array, with all bits set to a specific value. Using the second Bloom filter, the calculating unit determines whether the first data element is present in the data set, from which some data elements have been deleted.

Abstract: In accordance with embodiments of the present disclosure, an information handling system may include a host system comprising a host system processor and a network interface coupled to the host system processor and may include a management controller communicatively coupled to the host system processor and configured to provide management of the information handling system. The network interface may be configured to capture discovery protocol packets and encode the discovery protocol packets with extended discovery protocol information comprising information regarding physical functions, virtual functions, and ports associated with the discovery protocol packets.

Abstract: A low-cost cryptographic accelerator is disclosed that accelerates inner loops of a cryptographic process. The cryptographic accelerator performs operations on cryptographic data provided by a central processing unit (CPU) running a software cryptographic process to create a combined hardware and software cryptographic process, resulting in a lower cost secure communication solution than software-only or hardware-only cryptographic processes.

Abstract: In one embodiment, a method is performed. A fat tree route miner (FT-RM) entity may be used to establish a control plane session with a first spine node in communication with a network. The FT-RM entity may identify a prefix that is unreachable by the first spine node. The FT-RM entity may instruct a spine node to disaggregate the prefix.

Abstract: The present disclosure pertains to systems and methods of monitoring communication devices and communication links in a software-defined network (SDN). Network packets may be colored or tagged for routing to a packet analyzer. A VLAN bitmask may be added to a packet to identify the packet for inspection and, optionally, provide origin information identify a switch and/or port of origin. Port mirroring may be utilized and/or eventual routing of network packets to their original destination may ensure that network traffic is not disrupted. In one example, a most significant bit of a VLAN bitmask may be used by a match rule to identify packets intended for a packet analyzer without regard to original packet routing instructions and/or packet content.

Abstract: A satellite communication system may be configured to establish multiple different tunnels between a first satellite modem and a second satellite modem in accordance with a protocol. The first satellite modem may receive a packet via a tunnel established in accordance with a different protocol, determine an endpoint identifier corresponding to the tunnel based on information from one or more headers included in the packet, identify one of the multiple different tunnels that corresponds to the tunnel, generate a corresponding packet omitting at least a portion of the information from the one or more headers and comprising at least a portion of data included in a payload of the packet and an information block comprising a tunnel index corresponding to the identified one of the multiple different tunnels, and transmit the corresponding packet to the second satellite modem via the identified one of the multiple different tunnels.

Abstract: A dynamic SRMS (DSRMS) in a MPLS network generates unique segment identifiers for nodes of the network lacking segment identifiers (SIDs). The DSRMS receives network information from other nodes of the network that may include, for example, Internal Gateway Protocol (IGP) routing information, advertised prefix values for the nodes, and label values used in MPLS routing. The DSRMS analyzes the information and identifies nodes of the network that are not associated with a SID. For each identified node, the DSRMS generates a unique SID and then announces the SID to other nodes within the network. Generating the unique SID may include executing a hashing function using the IP address of the identified node as an input.

Abstract: A method is provided in one example embodiment and includes receiving at a controller an Address Resolution Protocol (“ARP”) packet from a source VXLAN Tunnel End Point (“VTEP”) serving a source host and identifying a destination, the source VTEP having assigned thereto a Virtual Network Identifier (“VNI”) identifying a VXLAN network to which the source VTEP and a plurality of other VTEPs belong, the ARP packet being received by the controller via a control plane; determining whether the received ARP packet is a request message; and, if the received ARP packet is a request message, determining whether address information for the identified destination is stored in a cache of the controller.

Abstract: A service function chain (SFC) based multi-tenancy processing method. The disclosed method allows isolation between SFC enabled domains while facilitating aggregation of tenant related data sets from SFC packet flows of various service function paths (SFPs) through cross domain bridges (CDB) in SFC enabled domains, delegators in a demilitarized zone, and a tenant aware service function (TASF). A CDB serves as a service function (SF) in a SFP and also serves as a classifier forwarding SFC packets to the demilitarized zone. A CDB gateway serves as a classifier in a delegator receives the SFC packets from the CDB. The TASF collects information from the SFC packets.

Abstract: A software-defined network (SDN) system, device and method comprise one or more input ports, a programmable parser, a plurality of programmable lookup and decision engines (LDEs), programmable lookup memories, programmable counters, a programmable rewrite block and one or more output ports. The programmability of the parser, LDEs, lookup memories, counters and rewrite block enable a user to customize each microchip within the system to particular packet environments, data analysis needs, packet processing functions, and other functions as desired. Further, the same microchip is able to be reprogrammed for other purposes and/or optimizations dynamically.

Abstract: In order for efficiently managing communications between a UE (10) and multiple SCSs (20_1-20_n), the UE (10) includes, in one message, multiple pieces of data to be transmitted to the SCSs (20_1-20_n), and sends the message to an MTC-IWF (30). The MTC-IWF (30) receives the message from the UE (10), and distributes the date to the SCSs (20_1-20_n). Each of the SCSs sends (20_1-20_n), to the MTC-IWF (30), data to be transmitted to the UE (10) and an indicator that indicates for the SCSs (20_1-20 n) the time tolerance until the data is transmitted to the UE (10). The MTC-IWF (30) receives the data and the indicators from the SCSs (20_1-20_n), and determines when to forward the data to the UE (10) based on the indicators.

Abstract: A first apparatus includes a memory configured to store first connection information in association with each of connections established between the first apparatus and a second apparatus. The first apparatus synchronizes the first connection information stored in the memory with second connection information that is managed by the second apparatus. When a connection is to be established between the first apparatus and the second apparatus while synchronization of the first connection information performed by the processor is suspended, the first apparatus generates first unique information that is unique at least between the first apparatus and the second apparatus, and transmits the generated first unique information to the second apparatus, and establishes, based on the first unique information, a connection between the first apparatus and the second apparatus.

Abstract: In one embodiment, new Segment Routing capabilities are used in the steering of packets through Segment Routing nodes in a network. A Segment List includes a set of one or more Segment List (SL) Groups, each of which identifies one or more Segments contiguously or non-contiguously stored in the Segment List (or stored across multiple Segment Lists) of a Segment Routing packet. Each SL Group typically includes one Segment that is encoded as a Segment Identifier, and may include Segments that are Extended Values. The steering order of SL Groups is not required to be the same order as they are listed in the Segment List, as the value of Segments Left may be increased, remain the same, or decreased (possibly to skip a next SL Group) and possibly based on the result of an evaluation of a conditional expression.

Abstract: A security configuration for a firewall is generated. Network traffic data, network reputation data, and endpoint protection data are received from a network environment. A reputation score for a network address is generated from the network traffic data and the network reputation data. An endpoint protection configuration is generated from a routine based on the network traffic data and the endpoint protection data. A set of security rules is provided from the endpoint configuration and the reputation score.

Abstract: A method of transmitting a frame by a station (STA) in a wireless LAN system supporting an HE PPDU (high efficiency physical layer protocol data unit) according to an embodiment of the present invention includes: setting a first duration field included in an HE-SIG A field; and transmitting a frame including the HE-SIG A field and a MAC header, wherein the first duration field is set to indicate a TXOP (transmission opportunity) value using a smaller number of bits than a second duration field included in the MAC header, and a granularity of a time unit used for indicating the TXOP value in the first duration field is set to be different from a granularity of a time unit used in the second duration field.

Abstract: The system generally includes a crosspoint switch in the local data collection system having multiple inputs and multiple outputs including a first input connected to the first sensor and a second input connected to the second sensor. The multiple outputs include a first output and a second output configured to be switchable between a condition in which the first output is configured to switch between delivery of the first sensor signal and the second sensor signal and a condition in which there is simultaneous delivery of the first sensor signal from the first output and the second sensor signal from the second output. Each of multiple inputs is configured to be individually assigned to any of the multiple outputs. Unassigned outputs are configured to be switched off producing a high-impedance state. The crosspoint switch includes a third input that is configured with a continuously monitored alarm having a pre-determined trigger condition when the third input is unassigned to any of the multiple outputs.

Abstract: Operating a message queue cluster having multiple nodes. A messaging request from a client is obtained by one or more processors, the messaging request to be routed to one of multiple nodes in a cluster. The one or more processors parse the messaging request to determine whether the messaging request should be routed to an other node. A messaging request is obtained from a client by one or more processors, the messaging request to be routed to one of multiple nodes in a cluster. The messaging request is parsed by one or more processors to determine whether the messaging request should be routed to an other of the multiple nodes in the cluster. The messaging request is routed by one or more processors in response to a determination that the messaging request should be routed to the other one of the multiple nodes in the cluster.

Abstract: A communication system and method are disclosed for transmitting packets of information in at least one first format over a communications link that utilizes packets of information in a second format. In certain embodiments, the packets of information in a first format are converted to packets of information in the second format prior to transmission via the communications link by packing and fragmenting the information in the first format in a coordinated manner. Embodiments may also utilize packing subheaders and fragmentation control bits in the packing and fragmentation processes.

Abstract: Various communication systems may benefit from improved quality of service treatment in the access networks. For example, certain communication systems may benefit from a dynamic varying of the quality of service level of a data flow. A method may include detecting a requested quality of service level requirement at a new data flow or an existing data flow at a network entity. The method may also include retrieving from a table a needed parameter linked to the requested quality of service level. In addition, the method can include using the needed parameter to create a new processing instance or to update an existing processing instance at the network entity. A method may further include updating the content of the table through separate signaling.

Abstract: Some embodiments provide a method for a match-action stage of a packet processing pipeline. The method receives a set of data containers storing input packet data values for a particular packet. The set of data containers includes multiple subsets of data containers. The method performs a set of match operations using a first subset of the set of data containers. The method uses a set of arithmetic logic units (ALUs) to generate output packet data values to store in a second subset of the set of data containers. Output packet data values for a third subset of the data containers are generated without the set of ALUs.

Abstract: Systems and methods related to a multi-server pull-based HTTP request-response structure over ICN systems. In one embodiment, a method comprises: publishing an ICN content request from a cNAP with identification CIDURI; receiving at the cNAP a response from at least one sNAP indicating the availability of the requested content at the at least one sNAP; identifying at the cNAP an optimal segment number, k*, and a set I* of the server IDs, i*, to participate in a network coding based transmission; transmitting the optimal segment number k* from the cNAP to each sNAP identified in the set I*; receiving, at the cNAP, network coding based transmissions from the sNAPs identified in the set I*, and performing decoding of an overall message at the cNAP.

Abstract: A PE and a method of forwarding packet are provided. According to an example of the method, when receiving a packet, the PE may determine a vPort associated to a port through which the packet is received. When a forwarding entry adding condition is satisfied, the PE may add a first forwarding entry in a forwarding table by recording the first vPort as an egress port, a source MAC address of the packet as a MAC address and an VLAN identifier of the VLAN associated with the first vPort as a VLAN identifier. Subsequently, the PE may search the forwarding table for a second forwarding entry matching the destination MAC address of the packet and the VLAN to which the packet belongs. The PE may search a port associating relationship table for a port associated to a second vPort in the second forwarding entry to forward the packet.

Abstract: A network interface controller is provided, including a receiving module, a boundary determination module, a first checksum calculation module, and a second checksum calculation module. The receiving module receives a packet having a segment of a first layer protocol and a segment of a second layer protocol. The boundary determination module performs a boundary determination operation on the packet to generate boundary information, wherein the boundary information includes a length of the segment of the second layer protocol and a boundary indication signal. The first checksum calculation module finishes the calculation of a first checksum corresponding to the segment of the first layer protocol after receiving the length of the segment of the second layer protocol. The second checksum calculation module starts to calculate a second checksum corresponding to the segment of the second layer protocol after receiving the boundary indication signal.

Abstract: A Multibit Trie is created for routing distribution of IP prefixes in each Virtual Private Network (VPN); and each Multibit Trie is divided into multiple layers. When routing search is performed for an IP address of a VPN, an input key is generated for each layer respectively, the input key of the layer comprises a VPN identifier of the VPN and bits corresponding to all of at least one layer before the layer in the IP address. A calculation is performed for the generated input key of each layer by using a Hash function of the layer, and routing is searched for according to a data structure information pointer of a Sub_Trie node corresponding to a longest Hash hit result.

Abstract: When a network host (110H.1) requests an IP address (via DHCP for example), and a candidate IP address is generated, the candidate IP address and the host's MAC address are installed in the ARP table(s) of at least one router present in the host's LAN. If installation is unsuccessful, e.g. due to the ARP table being full or due to a hash collision, the candidate IP address is declined, and another IP address is generated. Other features are also provided.

Abstract: Examples relate to multi-device collaboration. The examples disclosed herein enable identifying, by a first computing device having a first processor, a first role to be played by the first computing device when the first computing device is connected with a second computing device having a second processor. The second computing device may play a second role when the second computing device is connected with the first computing device. The examples further enable determining, by the first computing device, when at least one predetermined triggering event occurs that causes the first role and second role to be switched such that the first role is played by the second computing device and the second role is played by the first computing device.

Abstract: In one embodiment, a network functions virtualization infrastructure can be managed in a decentralized fashion. A front end can receive a request to provision a virtualized network function. The front end can create service descriptors for the request according to the virtualized network function, the service descriptors comprising a hierarchy of information elements organized based on distributed back-end agents operable to provision and manage the virtualized network function. The front end can store the service descriptors in a distributed data store.

Abstract: Examples herein disclose a smaller prefix length and a greater prefix length which are identified from a routing table of various prefix lengths. The smaller prefix length is converted into the greater prefix length. The converted prefix length and the greater prefix length are combined into a hash table.

Abstract: A network interface controller includes a host interface, which is configured to be coupled to a host processor having a host memory. A network interface is configured to receive data packets from a network, each data packet including a header, which includes header fields, and a payload including data. Packet processing circuitry is configured to process one or more of the header fields and at least a part of the data and to select, responsively at least to the one or more of the header fields, a location in the host memory. The circuitry writes the data to the selected location and upon determining that the processed data satisfies a predefined criterion, asserts an interrupt on the host processor so as to cause the host processor to read the data from the selected location in the host memory.

Abstract: A network security device configured to monitor and control incoming and outgoing network traffic allows for concurrently or parallel access to a network session table by multiple session managers in order to increase the network session setup rate within the device. Each of the multiple session managers can gain access to the session table in parallel with each other when the session managers are processing packets associated with different network sessions. Session managers utilize an identifier unique to each network session to be established in the network session table, which is used to determine which session managers can concurrently access the network session table.

Abstract: Packet processors or other devices with packet processing pipelines may implement pipelined evaluations of algorithmic forwarding route lookups. As network packets are received, a destination address for the network packets may be divided into different possible prefix lengths and corresponding entries in a routing table for the different possible prefix lengths may be determined according to a hash scheme for the routing table. The entry values may be read from the routing table and evaluated at subsequent stages to identify the entry with a longest prefix match with respect to the destination address for the network packet. The routing table may include entries for different types of network packets and may be configured to include virtual routing and forwarding for network packets.

Abstract: The present invention relates to techniques for a sensor network, machine-to-machine (M2M) communication, machine-type communication (MTC) and internet of things (IoT). The present invention may be applied to said technique-based intelligent services (such as smart home, smart building, smart city, smart or connected car, health care, digital education, retail business, and services associated with security and safety). A transmission apparatus of a wireless communication system according to an embodiment of the present invention comprises: a transmission unit for transmitting a compressed beacon frame by means of a plurality of transmission beams; a receiving unit for receiving information for the optimal transmission beam from among the plurality of transmission beams; and a control unit for controlling beamforming by means of a beam received from a terminal, wherein the data and header are compressed into a single frame in the compressed beacon frame.

Abstract: Some embodiments provide a method for a hardware forwarding element deparser. The method receives, from a match-action pipeline, (i) packet header field values stored in a set of data containers and (ii) a set of data indicating which packet header fields, of multiple possible packet header fields, to include in a packet constructed from the packet header field values. The method uses the received set of data and a list of data container identifiers for multiple possible packet header fields to generate an ordered list of references to data containers of the set of data containers. Based on the ordered list, the method constructs the packet using the packet header field values stored in the referenced data containers.

Abstract: A method and an apparatus for forwarding an MPLS data packet are provided, which are used in an environment of hybrid networking of an SR network and a non-SR network. The method is as follows: when obtaining a to-be-sent MPLS data packet, a first SR router in an SR network determines whether a next-hop router supports an SR characteristic; the first SR router encapsulates the MPLS data packet into an IP tunnel when determining that the next-hop router does not support the SR characteristic, and sends an encapsulated MPLS data packet to the next-hop router to enable the encapsulated MPLS data packet to be forwarded, based on an IP routing table, to a second SR router. In this way, correct forwarding of an MPLS data packet is completed in an environment of hybrid networking of an SR router and a non-SR router.

Abstract: A method of path computation in a segment routing network, the network comprising a set of nodes. The method comprises receiving a request for computation of a path between end nodes in the network, the request including a constraint. The method further comprises determining a segment identifier-optimised path defined by a stack of one or more segment identifiers, wherein the segment identifier-optimised path meets the constraint. The determining of the segment identifier-optimised path comprises analyzing a topology of the network comprising: at least a sub-set of the nodes, links between adjacent nodes indicative of possible paths between the nodes, and virtual links between pairs of nodes indicative of possible paths between the pairs of nodes. The method further comprises outputting at least one segment identifier which defines the determined path.

Abstract: Described are systems and methods for jointly optimizing Wide Area Network (WAN) and Local Area Network (LAN) network communications. In one embodiment, a management device communicatively interfaced with a WAN and a LAN includes a collection module to collect LAN information from the LAN and WAN information from the WAN; an analysis module to jointly analyze the collected WAN information and the collected LAN information to identify an operational condition; and an implementation module to initiate a management event responsive to the operational condition being identified. In one embodiment, the management event includes generating and transmitting a diagnostics report responsive to a fault being identified. The management device may further generate and execute instructions to remedy the diagnosed fault.

Abstract: A firmware, such as a unified extensible firmware interface (UEFI)-compliant firmware, provides a network protocol stack in a pre-boot execution environment. A network layer in the network protocol stack receives network packets. A firmware driver executing in the network layer determines whether individual network packets received at the network layer meet one or more pre-defined criteria. If individual network packets meet the pre-defined criteria, the firmware driver provides the network packets to a transport layer in the network protocol stack. If, however, the network packets received at the network layer do not meet the pre-defined criteria, the firmware driver discards the individual network packets.

Abstract: Information associated with a communication service need of the user is received from a user of a client computer system. A set of communication service requirements that indicate satellite resources required to satisfy the communication service need of the user are computed based on the received information, and transmitted to a server computer system. A first beam plan that satisfies the set of communication service requirements is received from the server computer system. The first beam plan includes information on satellite beams and spectra for allocation to the user when the first beam plan is deployed to provide a communication service to the user that satisfies the communication service need of the user. Instructions are transmitted to the server computer system to deploy the first beam plan. Information is received from the server computer system indicating that the first beam plan is deployed.

Abstract: Transport packets comprising Universal Serial Bus (USB) packet data are transported over a communications network in a manner adapted to the USB context of the USB data transfers the USB packet data belongs to. A transport packet comprising USB packet data has assigned thereto at least one quality-of-service parameter value that depends on the USB context of the USB data transfer applicable to the USB packet data. A USB-data source device is configured to run a computer program causing it to expose the respective USB contexts of the USB data transfers applicable to USB packet data of the transport packets it outputs. The USB-data source device (or its sink) may inform the network of the relationship between transport packets and USB contexts of USB data transfers.

Abstract: A method and system for inspecting broadcast network traffic between end points residing within a same zone. Specifically, the method and system disclosed herein entail the provisioning of unique forward-service and reverse-service virtual network identifiers (VNIs), and corresponding virtual layer-2 (VL2) forward-service and reverse-service broadcast domains, respectively, to communications originating from and destined to intercept hosts.

Abstract: Embodiments of the present invention relate to a Lookup and Decision Engine (LDE) for generating lookup keys for input tokens and modifying the input tokens based on contents of lookup results. The input tokens are parsed from network packet headers by a Parser, and the tokens are then modified by the LDE. The modified tokens guide how corresponding network packets will be modified or forwarded by other components in a software-defined networking (SDN) system. The design of the LDE is highly flexible and protocol independent. Conditions and rules for generating lookup keys and for modifying tokens are fully programmable such that the LDE can perform a wide variety of reconfigurable network features and protocols in the SDN system.

Abstract: Technologies for context-aware dynamic bandwidth allocation include a network compute device configured to collect context inputs from a plurality of compute devices communicatively coupled to the network compute device. The network compute device is further configured to identify a context of each compute device based on the collected context inputs and determine a bandwidth priority for each compute device based on the identified context. Additionally, the network compute device is configure to determine an amount of bandwidth from a total available bandwidth to allocate to the compute device based on the determined bandwidth priority and update a moderated bandwidth allocation policy to reflect the determined amount of bandwidth allocated to the compute device. Other embodiments are described herein.

Abstract: Various embodiments are presented herein that may reduce the workload of a system tasked with delivering frames of video data to a display generated by applications executing within the system. Applications executing within the system may generate new frames of video content at a specified frame rate known as frames per second (FPS). The CPU and/or GPU may be responsible for actually generating the frames at the specified FPS. These frames are then delivered to a display communicatively coupled with the system for rendering. Reducing the frame rate (FPS) may reduce the work being performed by the system because fewer frames may be generated within a given time period. This may be especially advantageous when the system is operating on battery power because it can extend the life of the battery.

Abstract: A method and apparatus for transmitting information in a wireless communication system is provided. A road side unit (RSU) for vehicle-to-everything (V2X) communication receives a message indicating an event from a vehicle user equipment (V-UE), and broadcasts information on the event to other V-UEs.