Ali Ghiasian

Learn More
SUMMARY Recently, we have proposed a new prefix lookup algorithm which would use the prefixes as scalar numbers. This algorithm could be applied to different tree structures such as Binary Search Tree and some other balanced trees like RB-tree, AVL-tree and B-tree with minor modifications in the search, insert and/or delete procedures to make them capable(More)
In single channel wireless networks, concurrent transmission at different links may interfere with each other. To improve system through-put, a scheduling algorithm is necessary to choose a subset of links at each time slot for data transmission. Throughput optimal link scheduling discipline in such a wireless network is generally an NP-hard problem. In(More)
  • 1