#### Filter Results:

- Full text PDF available (5)

#### Publication Year

2008

2018

- This year (1)
- Last 5 years (9)
- Last 10 years (10)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Behnaz Omoomi, Ali Pourmiri
- Ars Comb.
- 2008

A local coloring of a graph G is a function c : V (G) âˆ’â†’ N having the property that for each set S âŠ† V (G) with 2 â‰¤ |S| â‰¤ 3, there exist vertices u, v âˆˆ S such that |c(u) âˆ’ c(v)| â‰¥ mS , where mS isâ€¦ (More)

- Behnaz Omoomi, Ali Pourmiri
- Discrete Mathematics
- 2008

A local coloring of a graph G is a function c : V (G)â†’ N having the property that for each set S âŠ† V (G) with 2 â‰¤ |S| â‰¤ 3, there exist vertices u, v âˆˆ S such that |c(u) âˆ’ c(v)| â‰¥ mS , where mS is theâ€¦ (More)

- Ali Pourmiri
- COCOON
- 2016

In this paper we propose an algorithm for allocating n sequential balls into n bins that are organized as a n-vertex d-regular graph G, where d > 3 can be any integer. Let L be a given positiveâ€¦ (More)

- Konstantinos Panagiotou, Ali Pourmiri, Thomas Sauerwald
- ISAAC
- 2013

We consider the random phone call model introduced by Demers et al.,which is a well-studied model for information dissemination in networks. One basic protocol in this model is the so-called Pushâ€¦ (More)

- Ali Pourmiri, Mahdi Jafari Siavoshani, Seyed Pooya Shariatpanahi
- 2017 IEEE International Parallel and Distributedâ€¦
- 2017

We consider load balancing in a network of caching servers delivering contents to end users. Randomized load balancing via the so-called power of two choices is a well-known approach in parallel andâ€¦ (More)

- Abbas Mehrabian, Ali Pourmiri
- DISC
- 2014

The Push-Pull protocol is a well-studied round-robin rumor spreading protocol defined as follows: initially a node knows a rumor and wants to spread it to all nodes in a network quickly. In eachâ€¦ (More)

- Mahdi Jafari Siavoshani, Seyed Pooya Shariatpanahi, Hamid Ghasemi, Ali Pourmiri
- 2017 IEEE Symposium on Computers andâ€¦
- 2017

It is well known that load balancing and low delivery communication cost are two critical issues in mapping requests to servers in Content Delivery Networks (CDNs). However, the trade-off betweenâ€¦ (More)

- Ali Pourmiri
- 2015

We consider a cache network consisting of storage-enabled servers forming a distributed content delivery scenario. Each incoming content request, arriving uniformly at random to these servers, willâ€¦ (More)

- Mahdi Jafari Siavoshani, Ali Pourmiri, Seyed Pooya Shariatpanahi
- IEEE Transactions on Parallel and Distributedâ€¦
- 2018

We consider load balancing in a network of caching servers delivering contents to end users. Randomized load balancing via the so-called <italic>power of two choices</italic> is a well-known approachâ€¦ (More)