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

Alessandro Ordine

dblp:00/3370 · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
0since 2021 · last 2011
—ORCID · none

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

Computer networks · 4 · 1 first-authorHuman-computer interaction and ubiquitous computing · 1 · 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
1 paper
Routing and switching · 44% Wireless networking · 28% Datacenter networks · 28%

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

TopicWeightPapersLastEvidence papers
Datacenter networks
load balancing
0.112006
Multiple-path layer-2 based routing and load balancing approach for wireless infrastructure mesh networks · CoNEXT 2006
Routing and switching
routing
0.112006
Multiple-path layer-2 based routing and load balancing approach for wireless infrastructure mesh networks · CoNEXT 2006
Wireless networking
wireless mesh network
0.112006
Multiple-path layer-2 based routing and load balancing approach for wireless infrastructure mesh networks · CoNEXT 2006
Routing and switching › switching
layer-2 routing
0.012006
Multiple-path layer-2 based routing and load balancing approach for wireless infrastructure mesh networks · CoNEXT 2006
Routing and switching
spanning tree
0.012006
Multiple-path layer-2 based routing and load balancing approach for wireless infrastructure mesh networks · CoNEXT 2006

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

path quality measurement · 0.1multiple spanning tree · 0.1VLAN tagging · 0.1
YearPublicationVenuePosition
2011 Per-station throughput fairness in a WLAN hot-spot with TCP traffic
Andrea Detti, Nicola Blefari-Melazzi, Ibrahim W. Habib, Alessandro Ordine
Comput. Networks4
2007 A mechanism to enforce TCP Fairness in 802.11 wireless LANs and its performance evaluation in a real test-bed
abstract
In this paper, we study the problem of maintaining fairness for TCP connections in wireless local area networks (WLANs), based upon the IEEE 802.11 standard and operating in DCF mode. Although this mode of operation ensures fair access to the medium at the MAC level, it does not provide fairness among TCP connections. TCP unfairness may result in significant degradation of performance, leading to users perceiving unsatisfactory quality of service. We propose and analyze a solution capable of enabling TCP fairness with minimal additional complexity. The proposed solution is based on utilizing an IP rate-limiter with an adaptive rate control mechanism and does not require modifying existing standards at the MAC or network layers. The solution is fully compatible with existing devices and can be integrated either within the access point or within and external device (e.g., the network gateway). The performance analysis is performed in a real test-bed and proves the feasibility and effectiveness of our mechanism. To allow fellow researchers to reproduce our work we published on the WEB all the implementation code.
Nicola Blefari-Melazzi, Andrea Detti, Alessandro Ordine, Stefano Salsano
WOWMOM3
2007 TCP Fairness Issues in IEEE 802.11 Networks: Problem Analysis and Solutions Based on Rate Control
abstract
In this paper, we study the problem of maintaining fairness for TCP connections in wireless local area networks (WLANs) based upon the IEEE 802.11 standard. Current implementations of 802.11 use the so-called distributed coordination function (DCF), which provides similar medium access priority to all stations. Although this mode of operation ensures fair access to the medium at the MAC level, it does not provide any provisions for ensuring fairness among the TCP connections. TCP unfairness may result in significant degradation of performance leading to users perceiving unsatisfactory quality of service. We propose and analyze two solutions that are capable of enabling TCP fairness with minimal additional complexity. The proposed solutions are based on utilizing a rate-control mechanism in two modes: static or adaptive. They do not require modifying existing standards at the MAC or network layers. Hence, they are fully compatible with existing devices. Our performance analysis results prove the efficaciousness of our proposed solutions in achieving TCP fairness compared to existing approaches. We have, also, implemented the proposed solutions in an ad-hoc experimental test-bed, and performed measurements to demonstrate the validity of our approach and results
Nicola Blefari-Melazzi, Andrea Detti, Ibrahim W. Habib, Alessandro Ordine, Stefano Salsano
IEEE Trans. Wirel. Commun.4
2006 Multiple-path layer-2 based routing and load balancing approach for wireless infrastructure mesh networks
abstract
This work presents a general layer-2 approach for routing and load balancing in Wireless Infrastructure Mesh Network The key idea is dynamic select routes among a set of slowly changing alternative network paths. Our approach decouples the routing and load balancing problem into two distinct sub-problems: path creation and path selection. Paths are created through the reuse of classical 802.1Q multiple spanning tree mechanisms. This guarantees that, for each formed tree, a path is deployed from each mesh node to the Mesh Gateway. Moreover, each tree (path) is assigned a Virtual LAN identifier. Path selection is driven by a local algorithm running at each mesh node, fed by measurements (taken along each path connecting the mesh node to the gateway) which allow to dynamically determine which are the best paths. In order to route a packet it is sufficient to mark the packet with the VLAN tag corresponding to the chosen path. The described approach provides a very general and flexible framework: performance/stability trade-offs can be tuned through the choice of i) the mechanism used to measure the path quality; ii) the algorithm employed to select the path, and iii) the system parameter used (link costs and link weights) for the multiple spanning tree formation.
Alessandro Ordine, Fabio Feuli, Giuseppe Bianchi 0001
CoNEXT1
2006 SIP roaming solution amongst different WLAN-based service providers
abstract
Deployment of 802.11 wireless LANs is increasingly on the rise leading to new service scenarios in which users are connected everywhere-everytime. However the IEEE 802.11 standard was designed for short range wireless data transmissions and does not natively provide any support for roaming amongst different access networks. In the more general case, a mobile user should be expected to be able to roam into a visited domain and gain access to the network on the basis of some credentials shared with his home domain or WISP. There are several mechanisms that can be involved in providing such access control and roaming functionality but no any standard has overcome. In this paper a new SIP based solution is proposed. SIP-based authentication is provided end-to-end between user-to-network and network-to-network. The proposed solution realizes full proxy-to-proxy authentication at SIP level, enabling dynamic and secure WISP-to-WISP interworking. The proposed solution has been also implemented and successfully tested in a demonstrating testbed
Alessandro Ordine, Julian F. Gutierrez, Luca Veltri
MobiQuitous1