TAILIEUCHUNG - Probabilistic splitting table helps in back pressure based packet by packet adoptive routing in communication network

In the case of wireless networks the scheduling decisions are made using counters called shadow queues. The results are also extended to the case of networks that employ simple forms of network coding. In that case, our algorithm provides a low-complexity solution to optimally exploit the routing–coding tradeoff. | International Journal of Computer Networks and Communications Security C VOL. 2, NO. 4, APRIL 2014, 137–141 Available online at: ISSN 2308-9830 N C S Probabilistic Splitting Table helps in back pressure based packet by packet adoptive routing in communication network Mrs. JAYASHREE S. YADANNAVAR Department of Information Technology, MIT AOE, Alandi (D),Pune E-mail: 1jaya_y25@ ABSTRACT In the literature we have studied each packet is routed along a possibly different path by using Back Pressure based adaptive routing algorithm. So there is poor delay performance and involve high implementation complexity. After studied Back Pressure algorithm with clearly, we have developed a new adaptive routing algorithm. Here we have designed probabilistic routing table that is used to route packets to per destination queue to decouple the routing and scheduling components of the algorithm. In the case of wireless networks the scheduling decisions are made using counters called shadow queues. The results are also extended to the case of networks that employ simple forms of network coding. In that case, our algorithm provides a low-complexity solution to optimally exploit the routing–coding tradeoff. Keywords: Back-pressure algorithm, network coding, Routing, Scheduling. 1 INTRODUCTION In the traditional back-pressure algorithm, each node n has to maintain a queue qnd for each destination d: Let

TỪ KHÓA LIÊN QUAN
TAILIEUCHUNG - Chia sẻ tài liệu không giới hạn
Địa chỉ : 444 Hoang Hoa Tham, Hanoi, Viet Nam
Website : tailieuchung.com
Email : tailieuchung20@gmail.com
Tailieuchung.com là thư viện tài liệu trực tuyến, nơi chia sẽ trao đổi hàng triệu tài liệu như luận văn đồ án, sách, giáo trình, đề thi.
Chúng tôi không chịu trách nhiệm liên quan đến các vấn đề bản quyền nội dung tài liệu được thành viên tự nguyện đăng tải lên, nếu phát hiện thấy tài liệu xấu hoặc tài liệu có bản quyền xin hãy email cho chúng tôi.
Đã phát hiện trình chặn quảng cáo AdBlock
Trang web này phụ thuộc vào doanh thu từ số lần hiển thị quảng cáo để tồn tại. Vui lòng tắt trình chặn quảng cáo của bạn hoặc tạm dừng tính năng chặn quảng cáo cho trang web này.