Article Per Year (5 Year)
p-Index From 2021 - 2026
0
P-Index
This Author published in this journals
All Journal TELKOMNIKA (Telecommunication Computing Electronics and Control)
Huanlin Liu
Chongiqng University of Posts and Telecommunications
Computer Science & IT

Published : 2 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search

 1 
Maximization Network Throughput based on Maximal Flow for Single-Source Two-Destinations Multicast Huanlin Liu; Ruiyan Li; Liang Qin; Sheng Huang
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 12, No 3: September 2014
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12928/telkomnika.v12i3.102

Abstract

For guaranteeing all multicast destination nodes receiving the source information with their maximal flow respectively and obtaining the network maximal throughput, a heuristic algorithm based on network coding, Maximal Flow for Single-source Two-destinations Multicast (MFSTM) is proposed to maximize the network throughput. By calculating the each destination’s maximal flow, the number of link-disjoint paths which equals to destination’s maximal flow, are searched for each destination to construct the network coding graph. A heuristic algorithm based on network coding is designed to delete the redundant link in the network coding graph and guarantee the network throughput maximization. Comparing the traditional maximal multicast stream algorithm based on network coding, the simulation results show that the MFSTM algorithm makes two destinations receive the information at the speed of their maximal flow respectively, and decode the source node information at each destination node successfully.
Chord-based Resource Identifier-to-Locator Mapping and Searching for the Future Internet Huanlin Liu; Hongyue Dai; Shuaiyong Wu; Sheng Huang
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 12, No 3: September 2014
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12928/telkomnika.v12i3.99

Abstract

A great many problems, such as scalability, mapping data searching, high frequency update of mapping data, arise in the future network resource mapping system for its vast data processing need. Future Network Chord (FN Chord), an algorithm based on Chord and aims at solving the resources identity mapping and searching problem, is put forward by taking advantage of the qualities of scalability, rapid searching speed, high searching efficiency and flexible naming of chord in order to solve this problem. What’s more, an extra interest node index table for FN Chord is designed to record the hotspot resource mapping location in the paper. So, the resource searching strategy, which is named as Interest Index Table Future Network Chord (IIT-FN Chord) is proposed to search the resource in the paper. The entropy weight method is used to calculate the node interest level according the interest nodes’ resource item online time and visited times and to renew the interest index table. Moreover, probability replacement method is proposed to replace the outdated item on interest index table with new item. Simulation results show that the algorithm can decrease the average searching latency, average searching hops and thus increases the searching efficiency for the resource searching.
Co-Authors Hongyue Dai Liang Qin Ruiyan Li Sheng Huang Shuaiyong Wu