Showing papers on "Core router published in 2016"

Method and apparatus for multi-network communication in vehicular networks

Abstract: Wireless network data router for a vehicle, and operating method thereof, comprising: a multi-connection interface for wireless access in vehicular environments, herewith WAVE; a wireless local area network, herewith Wi-Fi, interface; a mobile network data interface; a downlink data connection for the vehicle and/or users in the vehicle and its vicinity; a data processing unit for routing data between said interfaces; wherein the data processing unit is configured to: calculate a score for each reachable network on the WAVE, Wi-Fi and mobile network interfaces; switch the uplink connection of the wireless network data router to the reachable network with the best score. Also a wireless network data router for vehicles for connecting vehicles to the Internet through a multi-network device, said router being a mobile router suitable to form a mesh network of connected vehicles, wherein the router is arranged for using parked cars for redistributing Wi-Fi signal from fixed hotspots.

Remotely configurable routers with failover features, and methods and apparatus for reliable web-based administration of same

Abstract: Web-enabled routers are remotely and securely administered in a centralized fashion. A router receives a configuration profile from a dedicated web domain that maintains a repository of configuration profiles for multiple routers. The web domain also provides a web portal for customized generation of new configuration profiles based on stored profiles. When a new profile is deployed to and instantiated on a router, the router transmits a "heartbeat" to ensure that it can maintain connectivity with the web domain; if not, the router reverts to a previous "failover" configuration profile that ensures connectivity to the web domain. A router also may be equipped with both a wired and a wireless (e.g., a 3G, 4G, or 4G LTE) WAN communication interface. In the event of a wired connectivity issue, the router controls the wireless WAN interface to prioritize traffic for the router heartbeat and data backup/restore operations between a computer network for which the router serves as a gateway and the web domain.

CUTBUF: Buffer Management and Router Design for Traffic Mixing in VNET-Based NoCs

Abstract: Router's buffer design and management strongly influence energy, area and performance of on-chip networks, hence it is crucial to encompass all of these aspects in the design process. At the same time, the NoC design cannot disregard preventing network-level and protocol-level deadlocks by devoting ad-hoc buffer resources to that purpose. In chip multiprocessor systems the coherence protocol usually requires different virtual networks (VNETs) to avoid deadlocks. Moreover, VNET utilization is highly unbalanced and there is no way to share buffers between them due to the need to isolate different traffic types. This paper proposes CUTBUF , a novel NoC router architecture to dynamically assign virtual channels (VCs) to VNETs depending on the actual VNETs load to significantly reduce the number of physical buffers in routers, thus saving area and power without decreasing NoC performance. Moreover, CUTBUF allows to reuse the same buffer for different traffic types while ensuring that the optimized NoC is deadlock-free both at network and protocol level. In this perspective, all the VCs are considered spare queues not statically assigned to a specific VNET and the coherence protocol only imposes a minimum number of queues to be implemented. Synthetic applications as well as real benchmarks have been used to validate CUTBUF , considering architectures ranging from 16 up to 48 cores. Moreover, a complete RTL router has been designed to explore area and power overheads. Results highlight how CUTBUF can reduce router buffers up to 33 percent with 2 percent of performance degradation, a 5 percent of operating frequency decrease and area and power saving up to 30.6 and 30.7 percent, respectively. Conversely, the flexibility of the proposed architecture improves by 23.8 percent the performance of the baseline NoC router when the same number of buffers is used.

Power efficient router architecture for wireless Network-on-Chip

Abstract: Wireless Networks-on-Chip (WNoCs) offer the most promising solution to overcome limitations of conventional Networks-on-Chip (NoCs) for long distance communications in future many-core processors. Detailed investigations of NoC with wireless interfaces (WIs) highlight their many benefits. But, static power consumption associated with WI components and routers, in general, is considerably high. By selectively turning off unused/ rarely used routers, static power consumption can be reduced. Additionally, in WNoCs with broadcast-capable antennas, only a single active wireless communication is allowed and many WIs remain inactive for longer duration and dissipate static power. To avoid this, we propose power-efficient fine-grained router architecture (FGRA) to keep power consumption to minimum. We also minimize wake-up latency by using an approach to wake-up a power-gated transceiver whenever signal is detected at its receiving antenna. We also propose non-blocking bypass channel (NBBC) to bypass power-gated routers and minimize routing latency and contention. We evaluate our proposed router design in presence of real and synthetic traffic patterns. FGRA saves up to 88.76% (per base router) and 62.50% (per WI) of static power as compared to regular architecture with 2.42% area overhead. Based on the utilization, FGRA also reduces overall network power consumption by 37.20% on average with negligible performance degradation. Design considerations for augmenting existing NoCs with these power-gated routers and corresponding overheads are also presented.

Quality of service provisioning and energy minimized scheduling in software defined flexible optical networks

Abstract: The over-provisioning of capacities in optical networks is not a sustainable approach in the long run. In this paper, we propose a software defined networking scheme for quality of service provisioning through energy efficient assignment of optical transponders, employing bandwidth variable distance adaptive modulation and coding. Our scheme enables avoiding over-provisioning of transponder capacity as well as short-term major changes in equipment allocation for networks with dynamic traffic. We make use of the seasonal auto-regressive integrated moving average model to forecast the statistics of network traffic for an arbitrary time span based on the requirements and the constraints of the service provider. The quality of service measure is defined as the probability of congestion at the core router ports. A stochastic linear programming approach is used to provide a solution for energy efficient assignment of optical transponders and electronic switching capacity while ensuring a certain level of quality of service to core routers. The scheduling of optical lightpath capacities is performed for the entire duration of time under consideration, whereas the scheduling of electronic switching capacities is performed based on the short-term dynamics of the traffic. Numerical results show up to 48% improvement in the energy efficiency of optical networks and 45% reduction in the number of optical lightpaths through the implementation of the proposed technique, compared to a design based on employing conventional fixed optical transponders and no traffic rerouting, where both schemes satisfy the congestion probability requirements.

A New Unicast-Based Multicast Scheme for Network-on-Chip Router and Interconnect Testing

Abstract: 3D technology for networks-on-chip (NOCs) becomes attractive. It is important to present an effective scheme for 3D stacked NOC router and interconnect testing. A new approach to testing of NOC routers is proposed by classifying the routers. Routers with the same number of input/output ports fall into the same class. Routers of the same class are identical if their tests are the same. A test packet is delivered to all the identical routers by a simple unicast-based multicast scheme. It is found that the depth of the consumption buffer at each router has great impact on the test delivery time because test application and test delivery for router testing cannot be handled concurrently. Test delivery must set a router to operational mode. A mathematical model is presented to evaluate the impact of consumption buffer depth on the test delivery time. A new and simple test application scheme is proposed for interconnect testing. Some interesting extensions are presented for further test time reduction and thermal considerations. Sufficient experimental results are presented by comparison with one previous method. The proposed method works for single stuck-at, transition, even small delay faults at routers, and single bridging faults at physical, consumption and injection channels.

Accurate anomaly detection using correlation-based time-series analysis in a core router system

Abstract: Fault tolerance is used in communication systems to ensure high reliability and rapid error recovery. The effectiveness of most proactive fault-tolerant mechanism depends on whether anomalies can be accurately detected before a failure occurs. However, traditional anomaly detection techniques fail to detect “outliers” when the monitored data involves temporal measurements and exhibits significantly different statistical characteristics for its constituent features. We describe the design of an anomaly detector that monitors the time-series data of a complex core router system. Anomaly detection techniques are compared in terms of their effectiveness for detecting different types of anomalies. A feature-categorizing-based hybrid method is proposed to overcome the difficulty of detecting anomalies in features with different statistical characteristics. Furthermore, a correlation analyzer is implemented to remove irrelevant and redundant features. Three types of synthetic anomalies, generated using a small amount of real data for a commercial telecom system, are used to validate the proposed anomaly detector.

Layer 3 high availability router

Abstract: Systems and methods for providing Open Systems Interconnection (OSI) layer 3 highly-available routers. An example method comprises: receiving a request to create a highly-available (HA) virtual router; configuring a HA virtual router to run on a plurality of network nodes, the HA virtual router comprising a master instance and a plurality of standby instances; assigning a floating Internet Protocol (IP) address associated with the virtual router to an internal network interface of the master instance; responsive to detecting a failure of the master instance of the HA virtual router, identifying a standby instance to act as a new master instance; and assigning the floating IP address to an internal network interface of the new master instance.

Design and implementation of 6LoWPAN border router

Abstract: Accessing end devices (nodes) in the Internet of things (IoT) with a uniquie IP address is possible with the evolution IPv6 and 6LoWPAN. 6LoWPAN stands for IPv6 over a Low Power WPAN, which is a open stack developed by IETF to provides communication between LoWPAN devices and the internet. 6LoWPAN Border Router (6LBR) is gateway between nodes and internet, which connects 6LoWPAN devices to the Internet and is also responsible for handling traffic between IPv6 and IEEE 802.15.4 interfaces. There are many solutions to implement 6LoWPAN Networks, but very few are open standards which can be implemented on development boards like Raspberry Pi, Beagle bones etc. In this paper CETIC-6LBR is chosen, which is open source, Contiki based, and well supported by popular repositories. This Paper aims at design and implementation of 6LoWPAN border router with an embedded Webserver on Beagle Bone Black (BBB) and implement bridge between 6LoWPAN devices to the internet (IPv4 as well as IPv6).

Fault-tolerance improvement for core and edge of IP network

Abstract: The fault-tolerance improvement for the core and edge of the IP network is proposed in the given paper. In solving the technological problem of the fault-tolerant IP routing during minimization of the object function it is necessary to solve either quadratic programming problem or mixed integer nonlinear programming problem with limitations defined. The proposed model also provides the support of load balancing functions on the virtual router interfaces and fault-tolerant routing in the core of the IP network with protection schemes of link, node and path, which has a positive impact on the availability and productivity of communications system as a whole.

Methods for dynamic router configuration in a mesh network

Abstract: A method for router configuration includes: at a router, collecting DHCP server presence data of a local area network; at the router, collecting NAT server presence data of the local area network; generating a network configuration status based upon the DHCP server presence data and the NAT server presence data; and configuring DHCP server and NAT server settings of the router based on the network configuration status.

Information-centric networking with small multi-path or single-path forwarding state

Abstract: One embodiment of the present invention provides a router in an information-centric network (ICN). The router includes a receiving module configured to receive an interest for a piece of content. The interest indicates a name associated with the piece of content. The router further includes an interest-processing module configured to: determine whether the interest can be forwarded; in response to determining that the interest can be forwarded to a second router, obtain a label that is specific to the second router; and attach the label to the interest. The router also includes a forwarding module configured to forward the interest to the second router with the attached label.

An Efficient 2D Router Architecture for Extending the Performance of Inhomogeneous 3D NoC-Based Multi-Core Architectures

Abstract: To meet the performance and scalability demands of the fast-paced technological growth towards exascale and Big-Data processing with the performance bottleneck of conventional metal based interconnects, alternative interconnect fabrics such as inhomogeneous three dimensional integrated Network-on-Chip (3D NoC) has emanated as a cost-effective solution for emerging multi-core design. However, these interconnects trade-off optimized performance for cost by restricting the number of area and power hungry 3D routers. Consequently, in this paper, we propose a low-latency adaptive router with a low-complexity single-cycle bypassing mechanism to alleviate the performance degradation due to the slow 2D routers in inhomogeneous 3D NoCs. By combining the low-complexity bypassing technique with adaptive routing, the proposed router is able to balance the traffic in the network to reduce the average packet latency under various traffic loads. Simulation shows that, the proposed router can reduce the average packet delay by an average of 45% in 3D NoCs.

Cache Control Method Mitigating Packet Concentration of Router Caused by Interest Flooding Attack

Abstract: Interest Flooding Attack (IFA) is one of the problems in Named Data Networking (NDN). In IFA, attackers send an excessive number of requests for non-existing contents, so it makes PIT overflow. It prevents normal users from retrieving Data packets. Pushback mechanism is a representative countermeasure against IFA in NDN. Pushback, however, limits Interest packets at routers near the server, so it also limits normal Interest packets. ICRP is another countermeasure against IFA. In ICRP, edge routers detect attackers and limit Interest packets from attackers. ICRP does not limit normal Interest packets, but each router needs to know the overall structure of the network to confirm whether it is an edge router by itself. In this paper, we propose an Interest flow balancing method focused on the number of requests on Named Data Networking, called IFBN. IFBN aims at decreasing the number of records in PIT from attackers and recovering the number of Data packets that normal users can retrieve. First, routers calculate reputation values for each interface. The reputation value is a proportion of the number of retrieved Data packets to the number of Interest packets forwarded for each interface. In addition to reputation values, routers refer to PIT and check the number of information from each interface. The router concludes that the interface that uses most capacity of PIT is forwarded attack Interest packets. The router does not record information of Interest packets from affected interface in PIT. Therefore, IFBN does not record only information of attack Interest packets without limiting normal Interest packets. We evaluate IFBN by simulation, and confirm IFBN can limit only attack Interest packets.

Systems and methods for intuitive home networking

Abstract: A method for router configuration includes at a remote router management platform, registering a first router, associated with a first router identifier, to a user account; at the first router, establishing an internet connection; at a first user electronic device, transmitting a first router configuration to the remote router management platform; and at the first router, receiving the first router configuration from the remote router management platform via the internet connection.

Networks and hierarchical routing fabrics with heterogeneous memory structures for scalable event-driven computing systems

Abstract: Among other aspects, the present invention relates to a network comprising a plurality of interconnected core circuits (10) particularly arranged on several units (6), wherein each core circuit (10) comprises: an electronic array (8, 9) comprising a plurality of computing nodes (90) and a plurality of memory circuits (80) which is configured to receive incoming events, wherein each computing node (90) is configured to generate an event comprising a data packet when incoming events received by the respective computing node (90) satisfy a pre-defined criterion, and a circuit which is configured to append destination address and additional source information, particularly source core ID, to the respective data packet, and a local first router (R1) for providing intra-core connectivity and/or delivering events to intermediate level second router (R2) for inter-core connectivity and to higher level third router (R3) for inter-unit connectivity, and a broadcast driver (7) for broadcasting incoming events to all the memory circuits (80) in the core circuit (10) in parallel.

System and method of WiFi router based presence detection and control

Abstract: A WiFi router based appliance control system and method The router infers the presence of certain human or animal users based on the association between the user and the WiFi signals emitted by WiFi equipped computerized devices typically associated with the users The router is configured to control various appliances (router controlled devices), and based on the inference that certain users are or are not local to the router, and various algorithms programmed into the router, the router will in turn control the various router controlled devices Thus for example, if the router detects a WiFi equipped smartphone coming in range, it can respond by automatically turning on lights or adjusting heating and air conditioning appropriately

Local stability and Hopf bifurcation analysis for Compound TCP

Abstract: We conduct a local stability and Hopf bifurcation analysis for Compound TCP, with small Drop-tail buffers, in three topologies. The first topology consists of two sets of TCP flows having different round trip times, and feeding into a core router. The second topology corresponds to two queues in tandem, and consists of two distinct sets of TCP flows, regulated by a single edge router and feeding into a core router. The third topology comprises of two distinct sets of TCP flows, regulated by two separate edge routers, and feeding into a common core router. For each of these cases, we conduct a detailed local stability analysis and obtain conditions on the network and protocol parameters to ensure stability. If these conditions get marginally violated, our analysis shows that the underlying systems would lose local stability via a Hopf bifurcation. After exhibiting a Hopf, a key concern is to determine the asymptotic orbital stability of the bifurcating limit cycles. We present a detailed analytical framework to address the stability of the limit cycles, and the type of the Hopf bifurcation by invoking Poincare normal forms and the center manifold theory. We conduct packet-level simulations to highlight the existence and stability of the limit cycles in the queue size dynamics.

System and method for routing packets in a stateless content centric network

Abstract: A gateway router can receive an Interest that includes a location-independent name for a data collection. If the Interest does not include an Anchor Identifier, the gateway router can perform a lookup operation in a name-prefix forwarding-information base (NP-FIB) to select an Anchor Identifier for a target anchor node, and to select an interface for forwarding the Interest toward the anchor. The router can update the Interest to include the Anchor Identifier prior to forwarding the Interest via the interface. An edge or core router that receives the Interest can perform a lookup in a routing table using the Interest's Anonymous Identifier (AID) to obtain an interface toward the anchor node and a second AID that is to be used by the next-hop neighbor to process the Interest. The router may then update the Interest to replace the Interest's AID with the second AID prior to forwarding the Interest.

IS-IS Extensions for Advertising Router Information

Abstract: This document defines a new optional Intermediate System to Intermediate System (IS-IS) TLV named CAPABILITY, formed of multiple sub-TLVs, which allows a router to announce its capabilities within an IS-IS level or the entire routing domain. This document obsoletes RFC 4971.

Source Authentication Techniques for Network-on-Chip Router Configuration Packets

Abstract: It is known that maliciously configured Network-on-Chip routers can enable an attacker to launch different attacks inside a Multiprocessor System-on-Chip. A source authentication mechanism for router configuration packets can prevent such vulnerability. This ensures that a router is configured by the configuration packets sent only by a trusted configuration source. Conventional method like Secure Hash Algorithm-3 (SHA-3) can provide required source authentication in a router but with a router area overhead of 1355.25% compared to a normal router area. We propose eight source authentication mechanisms that can achieve similar level of security as SHA-3 for a router configuration perspective without causing significant area and power increase. Moreover, the processing time of our proposed techniques is 1/100th of SHA-3 implementation. Most of our proposed techniques use different timing channel watermarking methods to transfer source authentication data to the receiver router. We also propose the Individual packet-based stream authentication technique and combinations of this technique with timing channel watermarking techniques. It is shown that, among all of our proposed techniques, maximum router area increment required is 28.32% compared to a normal router.

Assignment of router ID for logical routers

Abstract: Some embodiments provide a method for determining a router identifier for a centralized routing component of a logical router. The method determines that a dynamic routing protocol is enabled for the centralized routing component. When a router identifier was previously stored for the centralized routing component, the method assigns the stored router identifier as the router identifier for the centralized routing component only when the stored router identifier matches one of a set of valid addresses for the centralized routing component. When the centralized routing component does not have a previously stored router identifier that matches one of the set of valid addresses, the method assigns one of the set of valid addresses as the router identifier for the centralized routing component according to a hierarchy among the set of valid addresses.

Energy Efficient and Congestion-Aware Router Design for Future NoCs

Abstract: Network-on-Chip (NoC) has been well accepted for energy efficient on-chip communications for many-core systems. But, a NoC router consumes significantly high power and the number of routers increases linearly with number of cores. For large scale applications, the cumulative power dissipation in routers is comparatively high. Of all router components, input buffers consume significant amount of power. Additionally, removing buffers from NoC router leads to performance degradation and network congestion overhead. To make NoC energy efficient without increasing network congestion, in this paper we approach the router architecture by utilizing the Marching Memory buffers instead of traditional register based buffers for better energy efficiency and performance. Energy analysis on a 16-core mesh based NoC topology running PARSEC and SPLASH-2 benchmark application traffic shows that in the presence of Marching Memory buffer, our proposed router reduces the total energy by 18% and 25% respectively with negligible performance overhead.

MPLS multi-VRF design and implementation using GNS simulator

Abstract: MPLS(Multi Protocol Label Switching) is an emerging technology [1] which has started attracting all the service provider networks with its exceptional and admirable features. VPN(Virtual Private Network) is one of its most popular feature which carries traffic securely and privately from customer's one end to another through the service provider's network. However, in this case the CE(Customer Edge) router is not involved in providing private network through the customary LAN. The Multi-VRF(Virtual Routing and Forwarding) CE feature-also known as VRF-Lite—is a feature whereby the VPN functionality is extended to the CE router in an economical way. A Multi-VRF router can run multiple instances of routing protocols with a neighboring router with overlapping address spaces configured on different VRF instances. Hence, only one CE router is needed for multiple VPNs, thus simplifying provisioning and network management rather than a multiple CE router solution. This paper describes the designing of such a Multi-VRF MPLS network on the service provider's end which can separate a customer's large network into smaller sites and keep them isolated in a cost-effective way. GNS(Graphical Network Simulator) software stack with VMware virtualization were chosen for this purpose, as these applications are well suited for emulation of real network environment. The resultant network obtained after this design is a real time solution to many problems and demands in today's service provider's network.

Design and implementation of a hybrid switching router for the reconfigurable Network-on-Chip

Abstract: Network-on-Chip (NoC) has been proposed as the communication paradigm for the Ultra Large-Scale Integration System-on-Chips. One of the key factors that determine the performance and the implementation cost of a NoC is the switching scheme. In this paper, we propose and implement a hybrid switching router based on the combination of wormhole and virtual cut-through switching schemes. The router is dynamically reconfigurable to exchange between switching schemes at run-time, therefore, it achieves higher average performance than wormhole switching, while reducing the implementation cost in comparison with the virtual cut-through switching. The router has been modelled at Register Transfer Level in VHDL language and then synthesized on Xilinx Virtex-7 FPGA technology. The experimental results show that this router can guarantee reliability and reduce latency about 30.2% and increase average throughput approximately 38.9% compared with the generic router. The area and power overhead compared with the generic router are acceptable.

Method, apparatus, and system for smart device to access router

Abstract: A method for a smart device to access a router includes: receiving (5201) an identifier of the smart device and an SSID of a router currently accessed by the smart device; acquiring (S202) a collection comprising SSIDs of routers corresponding to the identifier of the smart device; judging (S203) whether the router currently accessed by the smart device is an access-barred router, according to the SSID of the router currently accessed and the collection comprising SSIDs of routers, to obtain a judgment result; and transmitting (S204) a corresponding instruction to the smart device according to the judgment result. According to the present disclosure, corresponding processes may be performed upon judging whether the router currently accessed by the smart device is an access-barred router, so as to prevent the smart device from accessing an access-barred router continuously.

Data routing method and device

Abstract: The invention provides a data routing method and device, belonging to the field of data transmission, wherein the data routing method is applied in the data routing device arranged at the edge of a metropolitan area network; the data routing method comprises the following steps that: the data routing device receives user data to be transmitted to an external network by user equipment and obtains comprehensive routing attributes of the user data; the judgment conditions of the comprehensive routing attributes comprise user routing attributes of the user equipment and/or service routing attributes of the user data; the data routing device determines a target network outlet of the user data according to the comprehensive routing attributes; and the data routing device routes the user data to the target network outlet through multi-hop connection between a core router of the metropolitan area network, a convergence router of a provincial network, an access router of a backbone network, a core router of the backbone network and an inter-network interconnection router of the backbone network. By means of the technical scheme provided by the invention, network outlets can be dynamically distributed to the user equipment; and thus, service experiences of users are ensured.

System and method for routing packets in a content centric network using anonymous datagrams

Abstract: A router of a content centric network (CCN) can forward messages using anonymous identifiers. The router can receive an Interest via a first interface, and determines a first anonymous identifier (AID) that identifies a name-independent path to the Interest's source via the router. The router can identify a second interface for forwarding the Interest to a next-hop neighbor via CCN, and performs a bijective function on the first AID to obtain a second AID that is to be used by the next-hop neighbor to return a corresponding data packet to the router. The router updates the Interest to include the second AID, and forwards the Interest via the second interface toward the next-hop neighbor. When the router receives the data packet, the router performs a lookup operation in an anonymous routing table (ART), based on the AID, to determine an interface for forwarding the data packet toward the Interest's source.