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

Jacob Sharony

dblp:34/189 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 2004
—ORCID · none

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

Computer networks · 3 · 3 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
Optical networks · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Interconnection networks and networks-on-chip · 100%

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

TopicWeightPapersLastEvidence papers
Optical networks › optical switching
photonic switching
0.011994
The universality of multidimensional switching networks · IEEE/ACM Trans. Netw. 1994
Interconnection networks and networks-on-chip
channel assignment
0.011994
The universality of multidimensional switching networks · IEEE/ACM Trans. Netw. 1994

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

complexity analysis · 0.0routing algorithms · 0.0routing algorithm · 0.0
YearPublicationVenuePosition
2004 Bandwidth management in 802.11 wireless LANs
abstract
We developed and demonstrated a prototype 802.11b access point that is capable of providing committed bandwidth services to premium users and controls congestion in the wireless medium. We also implement a time-varying deficit round robin (DRR) scheduling algorithm that takes into account the randomly varying time intervals between RF transmissions. Premium users receive (transmit) and maintain their pre-assigned downstream (upstream) target bandwidth independent of the other users in the system, while regular users share the remainder of the bandwidth. Congestion control is achieved by identifying the "marginal MUs" that use a disproportionate amount of network resources due to poor signal quality, and selectively reduces the target bandwidth in order to maintain the desired QoS for the remaining premium users.
Jacob Sharony, Moushumi Sen
ICC1
1996 An Architecture for Mobile Radio Networks With Dynamically Changing Topology Using Virtual Subnets
Jacob Sharony
Mob. Networks Appl.1
1994 The universality of multidimensional switching networks
abstract
Multidimensional switching networks are networks that utilize more than one degree of freedom (e.g., space, wavelength, time, code). The main idea is to use several dimensions of practical size in hierarchical multiplexing to overcome the physical constraints present when using only one dimension of large size. We generalize the case of one-dimensional switching networks to k-dimensional switching networks. Such networks have high degree of connectivity (/spl Gt/1000) and reduced complexity compared to one-dimensional networks. We introduce a technology-independent universal theory discussing two models, one of multidimensional selective switching, and the other of multidimensional broadcasting, concentrating on complexity and channel assignment. The required size of each dimension, hardware complexities, channel assignment, and corresponding routing algorithms and their time complexities are discussed. It is shown with examples bow the complexity of these networks can be reduced to a minimum by optimal allocation of the complexity in each dimension. Several realizations of three-dimensional wavelength-time-space networks using different technologies (e.g., fiber optics, acousto-optics, free-space and photonic switching) are described for both models.>
Jacob Sharony
IEEE/ACM Trans. Netw.1