H
Hamid Ahmadi
Researcher at IBM
Publications - 30
Citations - 3579
Hamid Ahmadi is an academic researcher from IBM. The author has contributed to research in topics: Packet switching & Network packet. The author has an hindex of 19, co-authored 30 publications receiving 3570 citations.
Papers
More filters
Journal ArticleDOI
Equivalent capacity and its application to bandwidth allocation in high-speed networks
TL;DR: The authors propose a computationally simple approximate expression to provide a unified metric to represent the effective bandwidth used by connections and the corresponding effective load of network links, which can then be used for efficient bandwidth management, routing, and call control procedures aimed at optimizing network usage.
Journal ArticleDOI
A survey of modern high-performance switching techniques
Hamid Ahmadi,W.E. Denzel +1 more
TL;DR: A survey of high-performance switch fabric architectures which incorporate fast packet switching as their underlying switching technique to handle various traffic types is presented.
Patent
Traffic management in packet communications networks
TL;DR: In this article, the authors propose a link traffic metric which represents the effective capacity of each link in the network which participates in the packet connection route and calculate leaky bucket parameters which govern the access of packets to the network once the connection is set up.
Patent
Adaptive medium access control scheme for wireless LAN
Hamid Ahmadi,David Frederick Bantz,Frederic Jacques Bauchot,Arvind Krishna,Maire Richard Orville La,Kadathur S. Natarajan +5 more
TL;DR: In this paper, a fixed frame structure consisting of three periods (A, B, and C) along with their respective headers is proposed for wireless radio access for a plurality of remote stations to a base station.
Patent
Method and apparatus for optimum path selection in packet transmission networks
Hamid Ahmadi,Jeane Shu-Chun Chen,Chee-Seng Chow,Roch Guerin,Levent Gun,Anthony Mangchuen Lee,Theodore Ernest Tedijanto +6 more
TL;DR: In this article, a modified Bellman-Ford breadth-first search algorithm is used to identify the principal links and, using these principal link identifications, determining the optimum path.