-
Advances in Computer Systems Architecture, 10th Asia-Pacific Conference, ACSAC 2005, Singapore, October 24-26, 2005, Proceedings; 01/2005
-
Networking - ICN 2005, 4th International Conference on Networking, ReunionIsland, France, April 17-21, 2005, Proceedings, Part I; 01/2005
-
IEEE Communications Letters 01/2004; 8:314-316. · 0.98 Impact Factor
-
[show abstract]
[hide abstract]
ABSTRACT: Cyclic Cubes, proposed as a new family of interconnection networks, is proved not new and is equivalent to the wrapped butterfly networks. There is a similar fact that the Cyclic Cubes is also equivalent to the Bidi Shufflenet, which is investigated recently. But this fact is almost neglected. In this paper, we discuss the equivalence between the Cyclic Cubes and the Bidi Shufflenet.
Advanced Information Networking and Applications, 2003. AINA 2003. 17th International Conference on; 04/2003
-
[show abstract]
[hide abstract]
ABSTRACT: IEEE is currently standardizing a new high-speed backbone technology for MANs - the Resilient Packet Ring (RPR). A key performance objective of RPR is to achieve high utilization, spatial reuse, and fairness simultaneously. However, the algorithms proposed in current draft standards have some critical limitations. As shown in an unbalanced traffic scenario, the draft RPR algorithm will suffer from dramatic bandwidth oscillations within nearly the entire range of the link capacity. In this paper, we propose a new dynamic bandwidth allocation algorithm called Distributed Bandwidth Reallocated in Rings (DBRR), which is based on approximately virtual-time. It shows that with fairness information propagated along the ring, each node can remotely approximate the ideal fair rate for its own traffic at each downstream link, and the whole ring can obtain maximum spatial reuse and nearly lossless throughput.
Advanced Information Networking and Applications, 2003. AINA 2003. 17th International Conference on; 04/2003
-
[show abstract]
[hide abstract]
ABSTRACT: We propose a dynamic routing and wavelength assignment algorithm in an all-optical network with limited-range wavelength conversions. For each randomly arrived request, the correlation of different wavelengths on different links in all possible routes is described by the wavelength weight in our algorithm. We try to assign wavelengths on each candidate route using a shortest-path algorithm based on the wavelength weight and choose the best as its route and wavelength assignment scheme. Numerical results obtained for NSFNET and a 12-node ring show that our algorithm can greatly reduce the blocking probability and the number of required conversions under uniform traffic or traffic dominated by larger hop routes.
IEEE Communications Letters 04/2003; · 0.98 Impact Factor
-
[show abstract]
[hide abstract]
ABSTRACT: In this letter, the routing and wavelength assignment problem in all optical networks is considered. We improve the Max-RWA model presented by R. M. Krishnaswamy and K. N. Sivarajan (see ibid., vol.5, p.435-7, Oct. 2001) by introducing limited-range wavelength conversions. Considering transmission performance, we propose a new optimization objective, which is to establish the maximum number of connections with the least number of wavelength converters. The modified Max-RWA problem is formulated as a integer linear programming (ILP) problem, and then solved using a genetic algorithm. The extended layered-graph approach is used to assign routes and wavelengths when necessary, thus reducing the complexity of the genetic algorithm. Numerical results obtained for NSFNET are presented.
IEEE Communications Letters 11/2002; · 0.98 Impact Factor
-
[show abstract]
[hide abstract]
ABSTRACT: Aggregating the traffic to different forwarding equivalence class is an indispensable and significant phase for layer-3 and layer-2 hybrid switching. Regarding existed schemes mainly focusing on high efficiency of network resource but taking little consideration on user's demand, we put forward a new scalable framework for traffic partitioning based on some generalized concepts and optional priority serving mechanism to satisfy both users and networks' requirement. In this letter, the design of the conceptual framework regarding the key technologies and corresponding adaptive algorithms are presented. Simulation using real Internet traces shows that our adaptive adjustment can guarantee delivering bound, the maximum delay of concerned packets while consuming bandwidth around the average traffic rate.
IEEE Communications Letters 05/2002; · 0.98 Impact Factor
-
[show abstract]
[hide abstract]
ABSTRACT: In multimedia systems end to end delay jitter has a great impact on the continuity of information playback. Therefore, it is necessary to compensate for delay variations to preserve the intramedia and intermedia temporal relationships. A buffer at the destination site is often adopted to compensate for the delay jitter. In this paper, a mapping relationship from P_QoS to buffer which is used to compensate for delay variations is given based on delay jitter statistics, and its theoretical analysis is also shown. So the buffer size of a multimedia synchronization system can be determined.
IEEE Communications Letters 09/2001; · 0.98 Impact Factor
-
[show abstract]
[hide abstract]
ABSTRACT: A wide variety of mobile computing devices have emerged, including
portables, palmtops and personal digital assistants. Providing adequate
network connectivity for these devices will require a new generation
wireless technology. This paper describes medium access protocols and
proposes a CDMA-based CSMA protocol to solve the collision problems well
with the help of multi-channel scheme. New methods of code
synchronization and assignment are presented. Our analysis results show
that the proposed protocol offers high throughput
Vehicular Technology Conference, 2001. VTC 2001 Spring. IEEE VTS 53rd; 02/2001
-
IEEE Communications Letters. 01/2001; 5:355-357.
-
[show abstract]
[hide abstract]
ABSTRACT: In order to schedule cells fairly and cost-effectively in ATM networks, this paper develops a new type of fair service referred to as fair-base-weighted round robin (FWRR). It combines well the fairness of an ideal fair service with the simplicity of a typical round robin (RR) service such that it can offer fair service to all connections over each “fair cycle”, with flexible operations and low expense close to that of a typical RR. We show that FWRR possesses fairness over each of fair cycles. Also, we analyze its worst-case fairness, upper bound of cell delay, and complexity. Numerical results obtained from simulation further support the analysis, with two main conclusions that FWRR can not only offer better fairness but present lower cell delay bound to higher-speed connections than carry-over round robin
Communication Technology Proceedings, 2000. WCC - ICCT 2000. International Conference on; 02/2000
-
[show abstract]
[hide abstract]
ABSTRACT: This paper proposes a congestion control algorithm of FACC based
on active networks, which provides an open network control mechanism to
user and ISP by building programmability into the network infrastructure
itself. By providing congestion detection and congestion control
mechanism on network nodes, FACC greatly reduces the congestion reaction
delay of source endpoint. In this paper the FACC algorithm is described
in detail and the performance analysis is given. The result of
simulation shows that FACC can obviously increase the average throughput
of each endpoint with or without the cross traffic in network resulting
in a little additional computation delay of the network node
Circuits and Systems, 2000. IEEE APCCAS 2000. The 2000 IEEE Asia-Pacific Conference on; 02/2000
-
[show abstract]
[hide abstract]
ABSTRACT: One of the important considerations for discarding cells is to guarantee the quality of service (QoS) of each virtual channel connections (VCCs) in ATM networks. The wasted volume of network resources due to discarding cells should be, however, considered as another major criterion in the design of an effective cell discard scheme. From the viewpoint of such volume, this paper develops a novel cell discard scheme: the “forwarding-strength-based” one, which can minimize the average lost (i.e., wasted) volume of network resources due to cell discarding. First the definition of forwarding strength δ, then the δ cell discard scheme and finally the performance analysis of the proposed scheme on the average lost volume of network resources and the cell lost probability are described respectively. In the case that a dynamic monitor of CLR-QoS is accommodated, the CLR-QoS of each VCC can be guaranteed under the proposed δ cell discard scheme
Communications, 1999. APCC/OECC '99. Fifth Asia-Pacific Conference on ... and Fourth Optoelectronics and Communications Conference; 02/1999
-
[show abstract]
[hide abstract]
ABSTRACT: In this paper, a novel technique to realize frequency quadrupling in the radio over fiber system is proposed. The frequency quadrupling is achieved by using an integrated Mach–Zehnder modulator (MZM) consisting of a 1 × 4 multimode interference (MMI) coupler and four optical phase modulator arms. Due to the inherent optical splitting ratio and phase relations between the outputs of the MMI coupler, the optical harmonics at + 1 order and − 3 order are generated corresponding to four times frequency of the microwave drive signal, only by setting the DC bias voltage of the main MZM at the minimum transmission point. That leads to the integrated MZM with reduced complexity compared with the conventional dual-parallel MZM. The effect of the nonideal integrated MZM, including the splitting imbalance and the bias drift, on all the sidebands is also analyzed theoretically. The following simulation results show that the slight deviation of the ideal values would not cause great degradation of the generated optical millimeter-wave signal.Research highlights► The integrated Mach-Zehnder modulator is based on the multimode interference coupler. ► The complexity of the proposed MZM is largely reduced. ► Frequency quadrupling is achieved by beating of +1 order and -3 order harmonics. ► The RoF system using our proposed technique has better robustness.
Optics Communications 284:4052-4058. · 1.49 Impact Factor
-
[show abstract]
[hide abstract]
ABSTRACT: In this letter, a new addressing scheme for hexagonal networks is proposed. Using the new addressing scheme, many routing algorithms designed for networks using square-based topologies such as mesh and torus can also be applied to hexagonal networks. Methods of applying the turn model to hexagonal networks are derived, with some new minimal and partial adaptive routing algorithms obtained. Simulations of the new routing algorithms under different working conditions are carried on hexagonal networks of various sizes. The results show that the proposed algorithms can offer lower packet delay and loss rate than the popular dimension order routing algorithm.
