Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Md. Golam Rabbani

dblp:59/7545 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 2016
0000-0002-8114-9135ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 3 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
2 papers
Internet architecture and protocols · 74% Network performance modeling · 26%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Internet architecture and protocols
information-centric networking
0.422016
αRoute: Routing on Names · IEEE/ACM Trans. Netw. 2016
αRoute: A name based routing scheme for Information Centric Networks · INFOCOM 2013
Internet architecture and protocols › information-centric networking
name-based routing
0.422016
αRoute: Routing on Names · IEEE/ACM Trans. Netw. 2016
αRoute: A name based routing scheme for Information Centric Networks · INFOCOM 2013
Network performance modeling › protocol performance analysis › routing performance
routing scalability
0.422016
αRoute: Routing on Names · IEEE/ACM Trans. Netw. 2016
αRoute: A name based routing scheme for Information Centric Networks · INFOCOM 2013
Internet architecture and protocols › overlay networks › peer-to-peer routing
DHT-based routing
0.212016
αRoute: Routing on Names · IEEE/ACM Trans. Netw. 2016

Methods — techniques the papers use, named apart from their topics

overlay-to-underlay mapping · 0.2distributed hash table · 0.2anycast routing · 0.2
YearPublicationVenuePosition
2016 αRoute: Routing on Names
abstract
One of the crucial building blocks for Information Centric Networking ICN is a name based routing scheme that can route directly on content names instead of IP addresses. However, moving the address space from IP addresses to content names brings the scalability issues to a whole new level, due to two reasons. First, name aggregation is not as trivial a task as the IP address aggregation in BGP routing. Second, the number of addressable contents in the Internet is several orders of magnitude higher than the number of IP addresses. With the current size of the Internet, name based, anycast routing is very challenging specially when routing efficiency is of prime importance. We propose a name-based routing scheme αRoute for ICN that offers efficient bandwidth usage, guaranteed content lookup and scalable routing table size. αRoute consists of two components: an alphanumeric Distributed Hash Table DHT and an overlay to underlay Internet topology mapping algorithm. Simulation results show that αRoute performs significantly better than Content Centric Network CCN in terms of network bandwidth usage, lookup latency and load balancing.
Reaz Ahmed, Md. Faizul Bari, Shihabur Rahman Chowdhury, Md. Golam Rabbani, Raouf Boutaba, Bertrand Mathieu
IEEE/ACM Trans. Netw.4
2013 On tackling virtual data center embedding problem
Md. Golam Rabbani, Rafael Pereira Esteves, Maxim Podlesny, Gwendal Simon, Lisandro Z. Granville, Raouf Boutaba
IM1
2013 αRoute: A name based routing scheme for Information Centric Networks
abstract
One of the crucial building blocks for Information Centric Networking (ICN) is a name based routing scheme that can route directly on content names instead of IP addresses. However, moving the address space from IP addresses to content names brings scalability issues to a whole new level, due to two reasons. First, name aggregation is not as trivial a task as the IP address aggregation in BGP routing. Second, the number of addressable contents in the Internet is several orders of magnitude higher than the number of IP addresses. With the current size of the Internet, name based, anycast routing is very challenging specially when routing efficiency is of prime importance. We propose a novel name-based routing scheme (αRoute) for ICN that offers efficient bandwidth usage, guaranteed content lookup and scalable routing table size.
Reaz Ahmed, Md. Faizul Bari, Shihabur Rahman Chowdhury, Md. Golam Rabbani, Raouf Boutaba, Bertrand Mathieu
INFOCOM4
2011 A new resource distribution model for improved QoS in an integrated WiMAX/WiFi architecture
abstract
Wireless access technology has come a long way in its relatively short but remarkable lifetime, which has so far been led by the WiFi technology. While WiFi enjoys a high penetration in the market, its hotspots are connected to the internet through wired connections, making its deployment cost very high. WiMAX has emerged as an existing new wireless technology, which provides larger coverage and higher bandwidth. Deployment of WiMAX only infrastructure, however, is highly expensive, which has motivated researchers to search for a low cost integrated WiMAX/WiFi architecture (using WiMAX as the backhaul and WiFi as the last mile technology) that supports 4G applications and provides high speed broadband services. WiMAX technology is equipped with mechanisms capable of delivering guaranteed quality of service (QoS). WiFi, on the other hand, has very limited capacity for providing QoS to the end applications. Delivering improved QoS in an integrated WiMAX/WiFi architecture poses a serious technological challenge. In this paper, we depict a converged architecture of WiMAX and WiFi, and then propose an adaptive resource distribution model for the access points. The new model is designed as an optimization problem that maximizes the QoS utility of the network. A new QoS utility function is proposed that takes the connection priority and continuity into account. Our simulation results show that our proposed scheme maintains QoS in different scenarios whereas existing other resource sharing schemes experience violation of QoS (minimum rate requirement) in 66% cases.
Md. Golam Rabbani, Joarder Kamruzzaman, Iqbal Gondal, Iftekhar Ahmad
IWCMC1