In this paper,we present a new self-similar traffic shaping mechanism and investigate its effect on the output traffic characteristics and network performance under self-similar traffic.Simulation results show that ou...In this paper,we present a new self-similar traffic shaping mechanism and investigate its effect on the output traffic characteristics and network performance under self-similar traffic.Simulation results show that our proposed mechanism can not only effectively reduce the burstiness of input traffic,but also perform better than the non-traffic shaping scheme in the terms of packet-loss rate and blocking probability.展开更多
A method of shape encoding and retrieval is proposed in this letter, which uses centripetal code to encode shape and extracts shape's convex for retrieval. For the rotation invariance and translation invariance of...A method of shape encoding and retrieval is proposed in this letter, which uses centripetal code to encode shape and extracts shape's convex for retrieval. For the rotation invariance and translation invariance of the centripetal code and the normalization of convex,the proposed retrieval method is similarity transform resistant, Experimental results confirm this capability.展开更多
This paper investigates the traffic properties before and after assembly at edge node of Ethernet over optical burst switching （OBS） network for the first time. Burst and inter-arrival time distributions are simulat...This paper investigates the traffic properties before and after assembly at edge node of Ethernet over optical burst switching （OBS） network for the first time. Burst and inter-arrival time distributions are simulated under time-based and length-based assembly schemes. Self-similar traffic Hurst parameter is compared through R/S and V/T plot. Finally three self-similar traffic generating methods are given. Simulation resuhs demonstrate that, muhi-source traffic increases self-similar degree, however after assembly, time-based scheme can decrease self similar degree, and aggregated burst size is close to Gaussian distribution. Length-based method has no effects on the self-similarity of input traffic. RMD is fit for study of burst network with large self-similarity.展开更多
This paper presents a criterion for the similarity of length-two elements in a noncommutative principal ideal domain. The criterion enables the authors to develop an algorithm for determining whether B1A1 and B2A2 are...This paper presents a criterion for the similarity of length-two elements in a noncommutative principal ideal domain. The criterion enables the authors to develop an algorithm for determining whether B1A1 and B2A2 are similar, where A1, A2, B1, B2 are first-order differential （difference） operators. The main step in the algorithm is to find a rational solution of a parametric differential （difference） Risch＇s equation, which has been well-studied in symbolic integration （summation）.展开更多
基金Supported by the National Natural Science Foundation of China(No.60132020 ,60302026)
文摘In this paper,we present a new self-similar traffic shaping mechanism and investigate its effect on the output traffic characteristics and network performance under self-similar traffic.Simulation results show that our proposed mechanism can not only effectively reduce the burstiness of input traffic,but also perform better than the non-traffic shaping scheme in the terms of packet-loss rate and blocking probability.
基金National Natural Science Foundation of China(No. 60172045)863-306 Project (863-306-ZT03-09)
文摘A method of shape encoding and retrieval is proposed in this letter, which uses centripetal code to encode shape and extracts shape's convex for retrieval. For the rotation invariance and translation invariance of the centripetal code and the normalization of convex,the proposed retrieval method is similarity transform resistant, Experimental results confirm this capability.
文摘This paper investigates the traffic properties before and after assembly at edge node of Ethernet over optical burst switching （OBS） network for the first time. Burst and inter-arrival time distributions are simulated under time-based and length-based assembly schemes. Self-similar traffic Hurst parameter is compared through R/S and V/T plot. Finally three self-similar traffic generating methods are given. Simulation resuhs demonstrate that, muhi-source traffic increases self-similar degree, however after assembly, time-based scheme can decrease self similar degree, and aggregated burst size is close to Gaussian distribution. Length-based method has no effects on the self-similarity of input traffic. RMD is fit for study of burst network with large self-similarity.
基金supported by a 973 key project under Grant No.2004CB318000the National Natural Science Foundation under Grant No.76596100
文摘This paper presents a criterion for the similarity of length-two elements in a noncommutative principal ideal domain. The criterion enables the authors to develop an algorithm for determining whether B1A1 and B2A2 are similar, where A1, A2, B1, B2 are first-order differential （difference） operators. The main step in the algorithm is to find a rational solution of a parametric differential （difference） Risch＇s equation, which has been well-studied in symbolic integration （summation）.
