Mr. Bing Zhang Profile

Bing Zhang

PhD Candidate at Xidian Univ

SPIE Involvement:

Author

Publications (3)

This will count as one of your downloads.

You will have access to both the presentation and article (if available).

DOWNLOAD NOW

This content is available for download via your institution's subscription. To access this item, please sign in to your personal account.

Email or Username Forgot your username?

Password Forgot your password?

Show

Keep me signed in

No SPIE account? Create an account

Proceedings Article | 2 October 2006 Paper

Fixed-rate layered multicast congestion control

Bing Zhang, Bing Yuan, Zengji Liu

Proceedings Volume 6387, 63870N (2006) https://doi.org/10.1117/12.686626

KEYWORDS: Receivers, Internet, Sensor networks, Statistical analysis, Computer simulations

Read Abstract +

A new fixed-rate layered multicast congestion control algorithm called FLMCC is proposed. The sender of a multicast session transmits data packets at a fixed rate on each layer, while receivers each obtain different throughput by cumulatively subscribing to deferent number of layers based on their expected rates. In order to provide TCP-friendliness and estimate the expected rate accurately, a window-based mechanism implemented at receivers is presented. To achieve this, each receiver maintains a congestion window, adjusts it based on the GAIMD algorithm, and from the congestion window an expected rate is calculated. To measure RTT, a new method is presented which combines an accurate measurement with a rough estimation. A feedback suppression based on a random timer mechanism is given to avoid feedback implosion in the accurate measurement. The protocol is simple in its implementation. Simulations indicate that FLMCC shows good TCP-friendliness, responsiveness as well as intra-protocol fairness, and provides high link utilization.

Proceedings Article | 11 February 2005 Paper

Ant algorithm in OBS RWA

Shi Zhang, TinJin Yu, Bing Zhang

Proceedings Volume 5625, (2005) https://doi.org/10.1117/12.573795

KEYWORDS: Computer simulations, Switching, Optical networks, Optical fibers, Telecommunications, Control systems, Algorithm development, Positive feedback, Computing systems, Distributed computing

Read Abstract +

The current routing and wavelength assignment (RWA) algorithms in optical switching (OBS) networks usually adopt the shortest path between the source-destination pairs as the routes and assign wavelengths hop-by-hop. There are two main problems exist in theses algorithms: (1) If there are common links among the shortest paths of different source-destination pairs, the one-way reservation protocol may cause congestion on these links while other links are underutilized, which may deteriorate the network performance, especially in an unsymmetrical network. (2) Few RWA algorithms take the fault recovery into consideration, which is important for the network to operate smoothly. An ant system based RWA algorithm is proposed in this paper to resolve these two problems. The destination nodes send ACKs back for each successfully received burst control packet (BCP). The ACKs are feed back along the same path as the one through which BCPs are forwarded. ACKs leave some "pheromone" along the path. The coming bursts will choose the output links with the probability proportioned to their pheromone intensity. Numerical results obtained from simulation show that our RWA algorithm can find the optimal routes adaptively and get a better burst drop probability performance compared with current RWA algorithms in an unsymmetrical network. Furthermore, our RWA algorithm is robust for fault recovery. When there are failures on some fibers, the bursts can be dynamically deflected to a suitable route without any extra information exchange among the switching nodes.

Proceedings Article | 25 October 2004 Paper

Binomial congestion control at receivers for multicast

Bing Zhang, Zengji Liu, Yayan Xu, Zhen Li, Shi Zhang

Proceedings Volume 5598, (2004) https://doi.org/10.1117/12.571059

KEYWORDS: Receivers, Astatine, Internet, Feature extraction, Lithium, Multimedia, Computer simulations, Solids, Stars, Time metrology

Read Abstract +

A single rate multicast congestion control for streaming media applications called Binomial congestion control At Receivers for Multicast (BARM) is proposed. Combining aspects of window-based and rate-based congestion control, the protocol shifts most of the congestion control mechanisms to multicast receivers. The main features of BARM are as follows. (1) The protocol adopts binomial algorithm (k=l=0.5, α=0.28, β=0.2 for our implementation) to adjust congestion window, which not only provides TCP-friendliness but decreases abrupt rate fluctuations, making it suitable for real time streaming media multicast applications. (2) The binomial algorithm is executed at the receivers instead of at the sender; to do this, a congestion window is maintained and updated separately by each receiver. Hence the protocol not only has a better scalability but reduces the burden of the sender significantly and is suitable to Client/Server model. (3) The congestion window is converted to the expected receiving rate which is then fed back to the sender if permitted. Compared to window feedback scheme, rate feedback scheme is simpler and increases the scalability. (4) The representative approach is used to suppress the feedback implosion. Simulations results indicate that BARM shows good fairness, TCP-friendliness, smoothness, scalability, and acceptable responsiveness.

My Library

You currently do not have any folders to save your paper to! Create a new folder below.

Folder Name

Folder Description

View contact details

UPDATE YOUR PROFILE

Is this your profile? Update it now.

Sign into your SPIE.org account

Don’t have a profile and want one?

Create an account on SPIE.org

Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks. You are receiving this notice because your organization may not have SPIE eBooks access.*

*Shibboleth/Open Athens users─please sign in to access your institution's subscriptions.

To obtain this item, you may purchase the complete book in print or electronic format on SPIE.org.

ORGANIZATIONAL
Sign in with credentials provided by your organization.

Organizational Username

Organizational Password

Show/Hide Password

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available

Members:

Non-members: ADD TO CART

Keywords/Phrases

Search In:

Publication Years