By means of a management framework and programmable routing tables, Software Defined Network (SDN) architectures offer network's adaptability to today's computer systems. In Networks-on-Chip (NoC) based systems, management methods have been implemented as specific solutions unable to be reused in further designs. A Software Defined NoC (SDNoC) architecture will permit on-the-fly re / configuration and reduce Non-Recurring Engineering costs. In this paper, performance evaluations of a SDNoC through flit-accurate SystemC models are presented. We measure the average values of the configuration time (CT), global delay and throughput for various routing algorithms and packet injection rates.

Modern communication systems are characterized by intensive computation signal processing algorithms. System-on-Chip implementations of these systems are generally based on Networks-on-Chip (NoC). The router and Network Interface (NI) are the main elements of the NoC, but the router is the architecture most discussed in the literature. Here, a NI + router microarchitecture is presented. Our router implementation outperforms the previous work in operational frequency by a 20%. The NI usually is assumed as a simple wrapper, although results in this work show that the NI can consume almost twice resources than the router. This indicates that further discussions must be carried out for the design of NoC-based communication systems.

In this paper, call admission and code allocation schemes are proposed to provide service differentiation in the forward link of wideband code-division multiple-access (WCDMA) systems. In particular, this paper proposes multiple leaf code reservation (MLCR) schemes, where different numbers of orthogonal variable spreading factor (OVSF) leaf codes (i.e., codes of the lowest layer of the OVSF code tree) are reserved to differentiate users with different bandwidth requirements. Leaf codes are only reserved for as long as the call admission process lasts. Once the decision of whether a new request is admitted or not has been made, a Code Dereservation procedure is carried out to increase flexibility in the code assignment phase. The performance of these MLCR strategies with/without code reassignments is then evaluated. Analysis shows that MLCR schemes are also useful in improving fair access among different traffic classes. In addition, perfect fair access among requests with different data rates can be achieved when code reassignments are jointly employed with the proposed OVSF-code reservation schemes.

In this paper, the performance of mobile cellular systems with link adaptation (LA) is analytically evaluated. Half- and full-rate vocoders are considered in the analysis. Mathematical expressions for the new call blocking, handoff failure, and forced termination probabilities are obtained. To our knowledge, no similar analysis considering LA exists in the literature. Also, the link quality-aware dual fractional channel reservation (LQA DFCR) scheme is proposed. In LQA DFCR, user differentiation is implemented in terms of link quality. Preference is given to users with good link quality because they require fewer resources than users with bad link quality. Numerical results show that the proposed LQA DFCR scheme effectively increases system capacity: LQA DFCR achieves more than a 11% capacity gain relative to systems with the non priority scheme (NPS) and with LA, and approximately 3% relative to the fair access prioritisation scheme (FAPS) strategy. Numerical results also show that LA yields an approximately 18% capacity increase relative to a cellular system without LA when no admission control is employed (admission control strategies further increase system capacity.) The synergy between LA and admission control strategies yields more than a 31% capacity gain

In this letter, recursive formulas for the new call blocking and handoff failure probabilities for Fractional Guard Channel (FGC) policies in cellular networks are derived. The effect of users' mobility on the maximum system capacity achieved with the Guard Channel (GC), the Limited Fractional Guard Channel (LFGC), and the Uniform Fractional Guard Channel (UFGC) strategies is then evaluated. Results show that maximum system capacity decreases exponentially as the mean cell dwell time decreases and that the relative capacity gain of each scheme depends on the mean cell dwell time. It was also found that LFGC outperforms GC and UFGC under any mobility condition.

In this paper, recursive formulas to calculate the new call blocking and handoff failure probabilities for fractional guard channel (FGC) policies in cellular networks are derived. Since the limited fractional guard channel (LFGC), the uniform fractional guard channel (UFGC), the guard channel (GC), and the non-prioritization schemes (NPS) are particular cases of the FGC policies; the recursive formulas for the blocking probabilities of these schemes are implicitly obtained as well. The optimal performance of the GC, LFGC, and UFGC strategies is compared in terms of the maximum system capacity for different mobility conditions. It is observed that as mobility increases the system capacity decreases. Results show that the relative capacity gain of the different schemes depends on the value of the mean cell dwell time relative to the mean service time. It is shown that LFGC overcome the GC, UFGC, and NPS strategies for any mobility condition and can achieve as much as 3% capacity gain relative to GC, 10% relative to UFGC, and 12% relative to NPS.