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

Vikram V. Karmarkar

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

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

Systems, architecture and hardware · 2 · 2 first-authorComputer networks · 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
2 papers
Network management and operations · 46% Wireless networking · 35% Physical-layer communications · 12%

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

TopicWeightPapersLastEvidence papers
Network management and operations › fault management
fault diagnosis
0.011994
Assuring SS7 dependability: a robustness characterization of signaling network elements · IEEE J. Sel. Areas Commun. 1994
Network management and operations › network robustness
fault tolerance
0.011994
Assuring SS7 dependability: a robustness characterization of signaling network elements · IEEE J. Sel. Areas Commun. 1994
Wireless networking › medium access control › carrier sense multiple access
CSMA/CD
0.011989
An Integrated Approach to Distributed Demand Assignment in Multiple-Bus Local Networks · IEEE Trans. Computers 1989
Physical-layer communications › multiple access
demand assignment multiple access
0.011989
An Integrated Approach to Distributed Demand Assignment in Multiple-Bus Local Networks · IEEE Trans. Computers 1989
Wireless networking
medium access control
0.011989
An Integrated Approach to Distributed Demand Assignment in Multiple-Bus Local Networks · IEEE Trans. Computers 1989
Wireless networking › medium access control › conflict-free multiple access
token passing
0.011989
An Integrated Approach to Distributed Demand Assignment in Multiple-Bus Local Networks · IEEE Trans. Computers 1989
Cellular and mobile networks › mobile networks › mobile network architecture › signaling system
signaling system no. 7
0.011994
Assuring SS7 dependability: a robustness characterization of signaling network elements · IEEE J. Sel. Areas Commun. 1994

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

sensitivity analysis · 0.0probabilistic and deterministic measures · 0.0
YearPublicationVenuePosition
1994 Assuring SS7 dependability: a robustness characterization of signaling network elements
abstract
Current and evolving telecommunication services will rely on signaling network performance and reliability properties to build competitive call and connection control mechanisms under increasing demands on flexibility without compromising on quality. The dimensions of signaling dependability most often evaluated are the rate of call loss and end-to-end route unavailability. A third dimension of dependability that captures the concern about large or catastrophic failures can be termed network robustness. The paper is concerned with the dependability aspects of the evolving Signaling System No. 7 (SS7) networks and attempts to strike a balance between the probabilistic and deterministic measures that must be evaluated to accomplish a risk-trend assessment to drive architecture decisions. Starting with high-level network dependability objectives and field experience with SS7 in the U.S., potential areas of growing stringency in network element (NE) dependability are identified to improve against current measures of SS7 network quality, as per-call signaling interactions increase. A sensitivity analysis is presented to highlight the impact due to imperfect coverage of duplex network component or element failures (i.e., correlated failures), to assist in the setting of requirements on NE robustness. A benefit analysis, covering several dimensions of dependability, is used to generate the domain of solutions available to the network architect in terms of network and network element fault tolerance that may be specified to meet the desired signaling quality goals.>
Vikram V. Karmarkar
IEEE J. Sel. Areas Commun.1
1989 A high performance virtual token-passing multiple-access method for multiple-bus local networks
abstract
A new integrated demand-assignment multiple-access (DAMA) method for multiple-bus local networks (MBLNs) is proposed and evaluated. The performance of this method is shown to be superior to independent token-passing as well as to previously proposed integrated access schemes. V-STIA, a virtual token-passing extension of a modified explicit token-passing scheme called single-token integrated access (STIA), delivers the best overall performance at medium to heavy loads while achieving good light-load performance without collision detection. Consequently, V-STIA makes the fewest possible demands on interface capabilities for DAMA support in MBLNs. Additionally, V-STIA implementation does not require simultaneous transmit capability for correct operation and greatly reduces design complexity. Performance advantages of MBLNs over an equivalent bandwidth single-bus DAMA system are established.>
Vikram V. Karmarkar, Jon G. Kuhl
ICDCS1
1989 An Integrated Approach to Distributed Demand Assignment in Multiple-Bus Local Networks
abstract
Multiple-bus local networks (MBLNs) provide an architecturally simple solution to serve high-reliability high-capacity local area networks applications. Access mechanisms for MBLNs possessing stability and favorable delay characteristics are developed. A technique is proposed that uses a single explicit token to achieve demand-assignment multiple access (DAMA) to arbitrate access on all buses in the system. The performance of this algorithm in pure DAMA form and its hybrid, carrier-sense multiple access with collision detection (CSMA-CD), version are discussed. The unique features of the hybrid algorithm are that no backoff policy is needed for colliding messages and the token-passing operation is never suspended, unlike some existing hybrid DAMA approaches.>
Vikram V. Karmarkar, Jon G. Kuhl
IEEE Trans. Computers1