Ternary Content Addressable Memory (TCAM) is a special type of memory used in routers to achieve high-speed packet forwarding and classification. Packet forwarding is done by referring to the rules written in the routing table, whereas packet classification is performed by referring to the rules in the Access Control List (ACL). TCAM uses more transistors than Random Access Memory (RAM), resulting in high power consumption and high production cost. Therefore, it is necessary to reduce the entries written in the TCAM to reduce the transistor count. In this paper, we propose a new TCAM architecture by using Range Matching Devices (RMD) integrated within the TCAM's control logic with an optimized prefix expansion algorithm. The proposed method reduces the number of entries required to express ACL rules, especially when specifying port ranges. With less than 10 RMDs, the total number of lines required to write port ranges in the TCAM can be reduced to approximately 50%.

We propose an opportunistic spectrum access scheme for unslotted secondary users exploiting spectrum opportunities in unslotted primary networks. An analytical model is developed to investigate the performance of the proposed scheme, and numerical results are presented to evaluate the performance in unslotted primary networks.

In recent years, the usage of IPTV (Internet Protocol Television) has been increased. The reason is a technological convergence of broadcasting and telecommunication delivering interactive applications and multimedia content through high speed Internet connections. The main critical point of IPTV security requirements is subscriber authentication. That is, IPTV service should have the capability to identify the subscribers to prohibit illegal access. Currently, IPTV service does not provide a sound authentication mechanism to verify the identity of its wireless users (or devices). This paper focuses on a lightweight authentication and key establishment protocol based on the use of hash functions. The proposed approach provides effective authentication for a mobile user with a RFID tag whose authentication information is communicated back and forth with the IPTV authentication server via IPTV set-top box (STB). That is, the proposed protocol generates user's authentication information that is a bundle of two public keys derived from hashing user's private keys and RFID tag's session identifier, and adds 1 bit to this bundled information for subscriber's information confidentiality before passing it to the authentication server.

This letter proposes novel optical fiber cables with extremely small cable diameter that employs rollable 20-fiber ribbons, which will improve fiber ribbon and cable productivity compared with optical fiber cable employing rollable 4-fiber ribbons. We fabricated the cables and investigated its feasibility in terms of high-count compactness, cable productivity, fiber strain induced by cable bending, optical loss characteristics and capacity for mass splicing. As a result, we confirmed the excellence of these cables and their fiber splicing workability.

Dynamic spectrum access has become a focal issue recently, in which identifying the available spectrum plays a rather important role. Lots of work has been done concerning secondary user (SU) synchronously accessing primary user's (PU's) network. However, on one hand, SU may have no idea about PU's communication protocols; on the other, it is possible that communications among PU are not based on synchronous scheme at all. In order to address such problems, this paper advances a strategy for SU to search available spectrums with asynchronous MAC-layer sensing. With this method, SUs need not know the communication mechanisms in PU's network when dynamically accessing. We will focus on four aspects: 1) strategy for searching available channels; 2) vacating strategy when PUs come back; 3) estimation of channel parameters; 4) impact of SUs' interference on PU's data rate. The simulations show that our search strategy not only can achieve nearly 50% less interference probability than equal allocation of total search time, but also well adapts to time-varying channels. Moreover, access by our strategies can attain 150% more access time than random access. The moment matching estimator shows good performance in estimating and tracing time-varying channels.

In this study, we construct an analytical model to investigate the system throughput of 802.15.3c WPAN by examining hybrid slotted CSMA/CA-TDMA and slotted CSMA/CA multiple access methods. Our analysis clearly shows the differences between the system throughputs of both multiple access methods. The obtained results show that the hybrid slotted CSMA/CA-TDMA can achieve a considerably higher system throughput compared to the slotted CSMA/CA; the difference between the two access methods is especially pronounced as the increase in the number of devices contending for the network increase. The system throughput comparisons have established why the hybrid slotted CSMA/CA-TDMA is preferred over the slotted CSMA/CA for high-speed wireless communications of the 802.15.3c WPAN.

Recently, a graph labeling technique based on prime numbers has been suggested for reducing the costly transitive closure computations in RDF query languages. The suggested prime number graph labeling provides the benefit of fast query processing by a simple divisibility test of labels. However, it has an inherent problem that originates with the nature of prime numbers. Since each prime number must be used exclusively, labels can become significantly large. Therefore, in this paper, we introduce a novel optimization technique to effectively reduce the problem of label overflow. The suggested idea is based on graph decomposition. When label overflow occurs, the full graph is divided into several sub-graphs, and nodes in each sub-graph are separately labeled. Through experiments, we also analyze the effectiveness of the graph decomposition optimization, which is evaluated by the number of divisions.

Various types of optical connector with a precise alignment mechanism and long-term reliability have been researched, developed and improved during about 30 years since practical optical communication systems were first introduced in Japan in 1981. The main issues related to optical fiber connector development changed from performance improvement to miniaturization, cost reduction and ease of field assembly when optical communication systems expanded from optical trunk networks to optical access networks. Various different key technologies for optical connectors have been developed to meet these requirements, and a large number of optical connectors are currently being used for the flexible and efficient construction, maintenance and operation of optical access networks. This paper describes the structure, features, and basic technologies of the optical connectors employed in optical access networks in Japan and their standardization and future prospects.

The optical access fiber network is spreading rapidly as a result of the progress made on optical communication technologies and the availability of a wide range of broadband Internet content. If the optical access network is not properly maintained, the service quality will decrease. This paper describes some effective technologies that have been researched and developed to maintain a high quality of service, and to achieve efficient maintenance and operation.

This paper presents spectral multi-level (M-ary) amplitude shift keying (ASK) optical code-division-multiplexing (OCDM) as a key technology for future optical access network. A novel transmitter configuration to achieve flexible scalability that is required in future optical access network is proposed. The transmitter employs pre-biasing circuits and dummy data input. Pre-biasing circuits enable us to achieve high tolerance to multiple access interference by compensating for the nonlinearity of the M-ary ASK and increase the number of multiplexed binary data streams. By inputting the dummy data into the transmitter so that the total number of multiplexed binary data streams including those that actually accommodate users/services and the dummy streams remains constant, the number of users/services can be increased up to the total number of data streams without changing the parameters for pre-biasing. Therefore, the proposed transmitter can flexibly enhance the scalability of the spectral M-ary ASK OCDM. The formulas for calculating the bit error rate characteristics are described when using the conventional and proposed transmitters. The feasibility of the proposed transmitter is verified theoretically using the established formulas.

In this letter, a derivative constraint minimum output energy (MOE) receiver is proposed the offers enhanced robustness against carrier frequency offset (CFO). A theoretical analysis of the output signal-to-interference-plus-noise ratio (SINR) is presented to confirm its efficacy. Numerical results demonstrate that the proposed receiver basically offers the same performance as an optimal receiver with no CFO present.

Since the length of wires between different layers, even between the top and bottom layers, is acceptably small in 3D mesh-based NoC (three-Dimensional mesh-based Network on Chip), a structure in which an IP (Intelligence Property) core in a certain layer directly connected to a proper router in another layer may efficiently decrease the average latency of messages and increase the maximum throughput. With this idea, in the paper, we introduce a dual-port access structure, in which each IP core except that in the bottom layer is connected to two routers in two adjacent layers, and, in particular, the IP core in the bottom layer can be directly connected to the proper router in the top layer. Furthermore, we derive the close form expression of the average number of hops of messages and also give the quantitative analysis of the performance when the dual-port access structure is used. All the analytical results reveal that the average number of hops is reduced and the system performance is improved, including a decrease of average latency and an increase of maximum throughput. Finally, the simulation results confirm our theoretical analysis and show the advantage of the proposed dual-port access structure with a relatively small increment of area overhead.

10G-EPON systems have attracted a great deal of attention as a way of exceeding to realize over 10 Gb/s for optical subscriber networking. Rapid burst-mode transmitting/receiving techniques are the key technologies enabling the burst-mode upstream transmission of 10G-EPON systems. In this paper, we have developed a OLT burst-mode 3R receiver incorporating a burst-mode AGC optical receiver and an 82.5 GS/s over-sampling burst-mode CDR and a ONU burst-mode transmitter with high launch power DFB-LD of 1.27 µm wavelength to fully compliant with IEEE802.3av 10G-EPON PR30 standards. The transmitting characteristics of a fast LD turn-on/off time of less than 6ns and a high launch power of more than +8.0 dBm, and the receiving characteristics of receiver sensitivity of -30.1 dBm and the upstream power budget of 38.1 dB are successfully achieved.

The CSMA/CA driven MAC protocols withhold packet transmissions from exposed stations when they detect carrier signal above a certain threshold. This is to avoid collisions at other receiving stations. However, this conservative scheme often exposes many stations unnecessarily, and thus minimizes the utilization of the spatial spectral resource. In this paper, we demonstrate that remote estimation of the status at the active receivers is more effective at avoiding collisions in wireless networks than the carrier sensing. We apply a new concept of the interference range, named as n-tolerant interference range, to guarantee reliable communications in the presence of n (n≥ 0) concurrent transmissions from outside the range. We design a distributed interference preventive MAC ( IP-MAC ) using the n-tolerant interference range that enables parallel accesses from the noninterfering stations for an active communication. In IP-MAC, an exposed station goes through an Interference Potentiality Check (IPC) to resolve whether it is potentially interfering or noninterfering to the active communication. During the resolve operation, IPC takes the capture effect at an active receiver into account with interfering signals from a number of possible concurrent transmissions near that receiver. The performance enhancement offered by IP-MAC is studied via simulations in different environments. Results reveal that IP-MAC significantly improves network performance in terms of throughput and delay.

Previously, we have proposed an access point (AP) allocation algorithm in indoor environments for the Wireless Internet-access Mesh NETwork (WIMNET) using one gateway (GW) to the Internet. WIMNET consists of multiple APs that are connected wirelessly mainly by the Wireless Distribution System (WDS), to expand the coverage area inexpensively and flexibly. In this paper, we present two extensions of this algorithm to enhance the applicability to the large-scale WIMNET. One is the multiple GW extension of the algorithm to increase the communication bandwidth with multiple GWs, where all the rooms in the network field are first partitioned into a set of disjoint GW clusters and then, our previous allocation algorithm is applied to each GW cluster sequentially. The APs in a GW cluster share the same GW. The other is the dependability extension to assure the network function by maintaining the connectivity and the host coverage, even if one link/AP fault occurs, where redundant APs are added to the AP allocation by our previous algorithm. The effectiveness of our proposal in terms of the number of APs and the throughput is verified through simulations using the WIMNET simulator.

In this letter, we propose a Throughput-aimed MAC Protocol with Quality of Service (QoS) provision (T-MAC) for cognitive Ad Hoc networks. This protocol operates based on the Time Division Multiple Access (TDMA) slot assignments and the power control mechanism, which can improve the QoS provision and network throughput. Our simulation results show that the T-MAC protocol can efficiently increase the network throughput and reduce the access delay.

The bit-error-rate (BER) performance predicted by the semi-analytical evolution technique proposed by Li Ping et al. becomes inaccurate for parallel concatenated coded interleave-division multiple-access (PCC-IDMA) systems. To solve this problem, we develop a novel evolution technique of such systems. Numerical results show that the predicted performance agrees well with the simulation results, and that this technique is useful for system optimization.

This paper proposes a multicast delivery system using base station diversity for cellular systems. Conventional works utilize single wireless link communication to achieve reliable multicast. In cellular systems, received signal intensity declines in cell edge areas. Therefore, wireless terminals in cell edge areas suffer from many transmission errors due to low received signal intensity. Additionally, multi-path fading also causes dynamic fluctuation of received signal intensity. Wireless terminals also suffer from transmission errors due to the multi-path fading. The proposed system utilizes multiple wireless link communication to improve transmission performance. Each wireless terminal communicates with some neighbor base stations, and combines frame information which arrives from different base stations. Numerical results demonstrate that the proposed system can achieve multicast data delivery with a short transmission period and can reduce consumed wireless resource due to retransmission.

Broadband wireless access networks are promising technology for providing better end user services. For such networks, designing a scheduling algorithm that fairly allocates the available bandwidth to the end users and maximizes the overall network throughput is a challenging task. In this paper, we develop a centralized fair scheduling algorithm for IEEE 802.16 mesh networks that exploits the spatio-temporal bandwidth reuse to further enhance the network throughput. The proposed mechanism reduces the length of a transmission round by increasing the number of non-contending links that can be scheduled simultaneously. We also propose a greedy algorithm that runs in polynomial time. Performance of the proposed algorithms is evaluated by extensive simulations. Results show that our algorithms achieve higher throughput than that of the existing ones and reduce the computational complexity.

The access privileges in distributed systems can be effectively organized as a partial-order hierarchy that consists of distinct security classes, and the access rights are often designated with certain temporal restrictions. The time-bound hierarchical key assignment problem is to assign distinct cryptographic keys to distinct security classes according to their privileges so that users from a higher class can use their class key to derive the keys of lower classes, and these keys are time-variant with respect to sequentially allocated temporal units called time slots. In this paper, we present the involved principle, survey the state of the art, and particularly, look into two representative approaches to time-bound hierarchical key assignment for in-depth case studies.