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

Kamal Jabbour

dblp:45/3790 · DBLP profile ↗
← Back
7ranked-venue papers
1as first author
0since 2021 · last 1996
—ORCID · none

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

Computer networks · 3Software engineering, systems software and programming languages · 2Systems, architecture and hardware · 1Graphics, computer vision, multimedia, augmented reality and games · 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
4 papers
Optical networks · 34% Internet architecture and protocols · 33% Routing and switching · 15%
Computer architecture, parallel and distributed computing, and storage systems
3 papers
Interconnection networks and networks-on-chip · 77% Hardware reliability and fault tolerance · 23%
Software engineering, system software, and programming languages
1 paper
Concurrent programming · 100%

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

TopicWeightPapersLastEvidence papers
Internet architecture and protocols › network architecture design › layered architecture
session layer protocol
0.011996
Formal Specification and Verification of the Kernel Functional Unit of the OSI Session Layer Protocol and Service Using CCS · ISSTA 1996
Concurrent programming › concurrency theory
process calculi
0.011996
Formal Specification and Verification of the Kernel Functional Unit of the OSI Session Layer Protocol and Service Using CCS · ISSTA 1996
Interconnection networks and networks-on-chip
hypercube network
0.031993
Spanning Multiaccess Channel Hypercube Computer Interconnection · IEEE Trans. Computers 1988
A Unified Approach to Local Area Network Interconnection · IEEE J. Sel. Areas Commun. 1987
An optical network interface unit for multichannel ring networks · ICNP 1993
Optical networks
wavelength-division multiplexing
0.011993
An optical network interface unit for multichannel ring networks · ICNP 1993
Hardware reliability and fault tolerance › network fault tolerance
fault-tolerant interconnection network
0.011988
Spanning Multiaccess Channel Hypercube Computer Interconnection · IEEE Trans. Computers 1988
Network management and operations
protocol verification
0.011996
Formal Specification and Verification of the Kernel Functional Unit of the OSI Session Layer Protocol and Service Using CCS · ISSTA 1996
Routing and switching
adaptive routing
0.011987
Evaluation of Point-to-Point Network Routing Algorithms · IEEE Trans. Commun. 1987
Internet architecture and protocols › network interconnection
LAN interconnection
0.011987
A Unified Approach to Local Area Network Interconnection · IEEE J. Sel. Areas Commun. 1987
Routing and switching
routing algorithms
0.011987
Evaluation of Point-to-Point Network Routing Algorithms · IEEE Trans. Commun. 1987
Interconnection networks and networks-on-chip
network topology
0.011987
A Unified Approach to Local Area Network Interconnection · IEEE J. Sel. Areas Commun. 1987
Network performance modeling › delay analysis
average packet delay
0.011987
A Unified Approach to Local Area Network Interconnection · IEEE J. Sel. Areas Commun. 1987

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

formal specification · 0.0CCS · 0.0free-space optics · 0.0analytical modeling · 0.0performance analysis · 0.0simulation · 0.0
YearPublicationVenuePosition
1996 Formal Specification and Verification of the Kernel Functional Unit of the OSI Session Layer Protocol and Service Using CCS
Milica Barjaktarovic, Shiu-Kai Chin, Kamal Jabbour
ISSTA3
1995 Formal specification and verification of communication protocols using automated tools
abstract
The paper compares and contrasts various methods presently available for specification, validation and verification, with emphasis on verification. We describe an application of formal methods to protocol specification, validation, and verification, using an actual protocol as an example. We use a process algebra to build models of an OSI protocol and test these models using a model checker. Model checking allows us to verify large and complex models and use formal methods as practical solutions. We also show an example with an automated theorem prover.
Milica Barjaktarovic, Shiu-Kai Chin, Kamal Jabbour
ICECCS3
1993 An optical network interface unit for multichannel ring networks
abstract
The authors present an all-optical hypercube-based multichannel network, implemented on a ring topology, using wavelength division multiplexed channels. For a network of size N, only log/sub 2/N distinct channels are required. They design an optical network interface unit (ONIU), which employs free-space optics to perform routing and switching functions. The design eliminates the electronic bottleneck at intermediate nodes and is capable of performing high speed packet switching. ONIU can be reconfigured in the GHz range and provides the high bandwidth necessary to perform distributed and parallel computing in a local area network environment.>
Francis Reichmeyer, Salim Hariri, Wang Song, Kamal Jabbour
ICNP4
1988 Spanning Multiaccess Channel Hypercube Computer Interconnection
abstract
A distributed computer system based on a hypercube topology is proposed, where multiaccess channels spanning all dimensional axes provide processor interconnection. The multiprocessor system can be built at relatively low cost by combining the recent advances in high-capacity channels available through fiber optics, and demand-assignment multiple-access protocols, creating a highly fault-tolerant system with good average packet delay and average distance characteristics, at a significantly reduced cost. A totally distributed system has been achieved in which the packets are self-routing, able to take advantage of the multiple paths of equal length between two modes. The proposed structure gives a highly fault tolerant system, degrading gracefully in the presence of failures.>
Patrick W. Dowd, Kamal Jabbour
IEEE Trans. Computers2
1987 A Unified Approach to Local Area Network Interconnection
abstract
An approach to local area network interconnection is presented Which combines the advances in static interconnection topologies, demand assignment multiple access protocols, and the availability of high-bandwidth fiber optic channels to create a cost-effective structure capable of interconnecting a large number of LAN's with heavy traffic. This approach is independent of the protocol implemented at each LAN. The structure is based on a hypercube topology where each vertex of the graph represents a LAN. Multiple access channels spanning all dimensional axes are used in this scheme. This approach is compared to a topology with direct point-to-point connections between all nodes sharing a common axis. Through the development of the degree, diameter, average distance, cost, and average packet delay, we show that using fewer high-capacity channels, a LAN interconnection network with excellent performance characteristics can be constructed, able to support a large number of LAN's with heavy traffic at a significant reduction in cost over the point-to-point case. The resulting structure has many of the desirable characteristics for static interconnection networks such as high fault tolerance, totally distributed packet routing in the interconnection network, low average distance for good performance, and low degree, resulting in low cost. For the total number of required LAN nodes and the expected amount of internode traffic, the structure is optimized for minimum cost.
Patrick W. Dowd, Kamal Jabbour
IEEE J. Sel. Areas Commun.2
1987 Evaluation of Point-to-Point Network Routing Algorithms
abstract
A sampling of routing algorithms is evaluated through simulation. The algorithms selected are random walk, fixed directory, split traffic, isolated shortest queue (hot potato) and backward learning. Backward learning exhibited the most desirable characteristics, approaching fixed directory routing in delay and path length, while adapting to link failures.
Paul R. Bell, Kamal Jabbour
IEEE Trans. Commun.2
1985 Real-time telephone channel simulation
abstract
The paper describes the real-time implementation of a telephone channel simulator on the TMS32010 digital signal processor. Several characteristics are simulated, including harmonic distortion, attenuation distortion, group delay distortion, listener echo, frequency offset, phase jitter, gaussian noise, impulsive noise, phase jumps and gain hits. A design program written in Pascal and running on a personal computer allows the user to specify and test a channel response, then generate the TMS32010 code for the real-time implementation.
Kamal Jabbour, J. Fernando Vega-Riveros
ICASSP1