The new requirements of Metropolitan Area Networks (MAN) have resulted in the emergence of new data transport technology, Resilient Packet Ring (RPR). The Key performance objective of RPR is to simultaneously achieve high bandwidth utilization, spatial reuse, and fairness. In this paper, a Rate Estimation Based Fairness Algorithm (REBFA) in Resilient Packet Rings is described and simulations are given to prove REBFA can achieve better performance than the fairness algorithm described in draft of IEEE standard for RPR.
Network coding is an emerging area in information theory and is expected to have a signification impact on future design of switching systems. Preliminary studied show that network coding may increase the achievable multicast throughput by significant amounts. Thus, deployment of network coding could help better exploit shared resources such as Internet connections or wireless bandwidth. Construction of network coding has become a hotspot in this area. After introducing the basic concepts of network coding, this paper summarizes the research work on required alphabet size and distribute coding scheme. Applications and open problems of network coding are also discussed.
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.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
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.